Scribd
Upload
152 views2 pages

Algo AdvancedDS Guidelines

Du guidelines for advanced algorithm

Uploaded by

Avinash Shrivastava
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
152 views2 pages

Algo AdvancedDS Guidelines

Du guidelines for advanced algorithm

Uploaded by

Avinash Shrivastava
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Guidelines for B.Sc. (Hons.

) Computer Science V Sem


Algorithms and Advanced Data Structures
Unit Name Syllabus Guidelines Suggested
No. of
Lectures
Unit 1: Vectors, Lists, Sequences 6.1, 6.2, 6.3 [1] 4
List and Iterator
ADTs
Unit 2: Hash Functions, Collision 10.1 – 10.3 [4] 6
Hash Tables, resolution schemes
Dictionaries
Unit 3: String Matching: Brute Force, 12.3.1, 12.3.3, 12.5 [1] 8
Strings KMP algorithm;
Tries: Standard Tries,
Compressed Tries, Suffix Tries,
Search Engines
Unit 4: 2-4 Trees, B Trees 7.1.8 [4] 8
More on Trees 7.1.1 [4]

Unit 5: Bellman Ford Algorithm, 6.8 [3] 8


More on Graphs Union Find Data Structures - 4.6 [3]
application Kruskal’s algorithm
Unit 6: Randomized Quicksort, 7.3, 9.2 [2] 6
Randomization Randomized Select, Skip lists 9.4, 9.4.1 [1]
Unit 7: Ford Fulkerson algorithm for 7.1 [3] 5
Network Flows the max flow problem

Essential/Recommended readings
1. Goodrich, M.T, Tamassia, R., & Mount, D. Data Structures and Algorithms Analysis
in C++, 2nd edition, Wiley, 2011 (Note: An e-copy of this book can be procured from
the publisher for the college library).
2. Cormen, T.H., Leiserson, C.E., Rivest, R. L., Stein C. Introduction to Algorithms, 4th
edition, Prentice Hall of India, 2022.
3. Kleinberg, J., Tardos, E. Algorithm Design, 1st edition, Pearson, 2013.
4. Drozdek, A. Data Structures and Algorithms in C++, 4th edition, Cengage Learning.
2012.
Practical List (30 Hours)

1. Write a program to sort the elements of an array using Randomized Quick Sort (the
program should report the number of comparisons).
2. Write a program to find the ith smallest element of an array using Randomized Select.
3. Write a program to determine the minimum spanning tree of a graph using Kruskal’s
algorithm.
4. Write a program to implement the Bellman-Ford algorithm to find the shortest paths
from a given source node to all other nodes in a graph.
5. Write a program to implement a B-Tree.
6. Write a program to implement the Tree Data structure, which supports the following
operations:
a. Insert
b. Search
7. Write a program to search a pattern in a given text using the KMP algorithm.
8. Write a program to implement a Suffix tree.

Mansi Sood Sonika Thakral Sapna Grover


(SPMC) (SSCBS) (DSC)

You might also like