MA3205 : Advanced Data Structures and Algorithms (Spring 2014)

Details of MA3205 (Spring 2014)

Level: 3

Type: Theory

Credits: 3.0

Course Code	Course Name	Instructor(s)
MA3205	Advanced Data Structures and Algorithms	Koel Das

Syllabus
Introduction and basic concepts: Complexity measures, worst-case and average-case complexity functions, quick review of basic data structures. Advanced Trees: AVL tree, KD Trees, B-Trees. Priority Queues/ Heaps. Hashing. Dictionaries. bf Graphs: Depth-first and breath-first search, shortest path algorithms, minimal spanning tree algorithms. Sorting and selection: Finding maximum and minimium, k largest elements in order, heap sort methods, lower bound for sorting, other sorting algorithms. Algorithm Paradigms: Greedy, divide and conquer, dynamic programming.

Syllabus

Introduction and basic concepts: Complexity measures, worst-case and average-case complexity functions, quick review of basic data structures.
Advanced Trees: AVL tree, KD Trees, B-Trees.
Priority Queues/ Heaps. Hashing. Dictionaries.
bf Graphs: Depth-first and breath-first search, shortest path algorithms, minimal spanning tree algorithms.
Sorting and selection: Finding maximum and minimium, k largest elements in order, heap sort methods, lower bound for sorting, other sorting algorithms.
Algorithm Paradigms: Greedy, divide and conquer, dynamic programming.

References
J. Klingenberg and E. Tardos, Algorithm Design, Addison Wesley, 2005. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, 2nd Edition, Prentice Hall, 2001. A. V. Aho, J. E. Hopcraft and J. D. Ullman, Design and Analysis of Algorithms, Addison-Wesley, 1974.

Sl. No.	Programme	Semester No	Course Choice
1	IP	2	Elective
2	IP	4	Not Allowed
3	MR	2	Not Allowed
4	MR	4	Not Allowed
5	MS ( Mathematical Sciences )	6	Core
6	RS	1	Not Allowed
7	RS	2	Not Allowed