<<<PCP1197>>> ADVANCED DATA STRUCTURES AND ALGORITHMS LAB

{{{credits}}}

L	T	P	C
0	0	4	2

Course Objectives

To learn advanced tree and graph structures.
To learn the need for heap and disjoint set representations.
To understand algorithm design techniques and apply suitable techniques for problems.

Insertion sort and merge sort with complexity analysis
Application of binary search trees
Red-Black Trees
Min heaps, Fibonacci heaps
Disjoint sets
Application of graph traversals – BFS and DFS
Single source Shortest Path Algorithms (e.g. Dijkstra’s and Bellman Ford algorithms)
All-pairs Shortest Path Algorithms: (e.g. Floyd’s algorithm)
Dynamic programming (e.g. Longest common subsequence, 0/1 Knapsack)
Recursive backtracking (e.g. N-Queen’s problem)
Greedy technique (e.g. Job/event scheduling, Minimum spanning tree)
Mini project: For a given application, identify and solve using suitable data structures and design techniques

\hfill Total: 60

After the completion of this course, students will be able to: