DEPARTMENT OF Computer Science and Engineering

NATIONAL INSTITUTE OF TECHNOLOGY

TIRUCHIRAPPALLI - 620 015, TAMIL NADU, INDIA
COURSE PLAN (PART I)
Name of the programme and specialization M.Tech, Computer Science and Engineering
Course Title Advanced Data structures and algorithms
Course Code CS603 No. of Credits 4 - (3 – 0 - 2)
Course Code of Pre-requisites ---
Session July 2024 Section (if, applicable)
Name of the Faculty Rajeswari Sridhar Department CSE
E-mail [email protected] Telephone No. 3205
Course Coordinator(s) (if, applicable) -
E-mail of Course Coordinator (s) - Telephone No. -
Course Type (tick) Programme Open
IR Core Minor Honours Laboratory
Elective Elective
√
COURSE CONTENT (as in latest curriculum)
Unit I Analysis of Algorithms

Algorithmic design strategies - Review of order of growth of functions, recurrences, probability distributions,
Average case analysis of algorithms, Randomized Algorithms – Analysis - NP – Complete and NP – Hard
Problems – Amortized Analysis
Lab Component:
 Exposure to online coding platforms – Hackerank, SPOJ, LEETCODE
 Solving problems with differing time complexity

Unit II Heaps
Min Heap – Min-max Heaps – Deaps – Leftist heaps – Skew leftist heaps – Binomial Heaps – Lazy binomial
heaps – Fibonacci Heaps.
Lab Component:
 Implementation of all of the Heap datastructures
 Take a target applications and implement using one of the Heap

Unit III Trees

AVL Trees – Red-Black Trees – Splay Trees - B trees – Tries - Point – trees – Quad trees - K-d trees –
Segment trees
Lab Component:
 Implementation of all of the Balanced Tree Structures
 Run a comparative study for any one application by implementing with different Trees

Unit IV Graph Algorithms

Maximum Flow – Flow Networks – Ford-Fulkerson Method – Edmond Karp algorithm - Maximum Bipartite
Matching
Lab Component:
 Implementation of all of the Graph algorithms
 Run applications by implementing one of the graph algorithms

Unit V Geometric Algorithms

Convex Hull – Closest pairs of points – line segment intersection – Map overlay detection – Voronoi diagram
Lab Component:
 Implementation of all the geometric algorithms
 Case study of the geometric algorithms for any real-world problem.
References

Text Books
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, MIT Press, Fourth Edition,
2022.

Reference Books
1. Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars, “Computational
Geometry Algorithms and Applications”, Third Edition, Springer, 2011.
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, “Fundamentals of Computer
Algorithms”, Second Edition, Universities Press, 2008.

COURSE LEARING OBJECTIVES

 To understand the various algorithm design strategies and analysis techniques
 To explore the different heap and tree data structures
 To learn about the different graph algorithms
 To understand the geometric algorithms

COURSE OUTCOMES (CO)

Course Outcomes Aligned Programme Outcomes (PO) (Assign level – 1 or 2 or 3 or blank)
After successful completion of the course, 1 2 3
the students should be able to: CO1 3 2 3
CO2 3 0 3
CO1 Propose algorithmic design CO3 2 2 3
strategies such as brute force, CO4 3 0 3
greedy, and divide and CO5 3 3 3
conquer.
CO2 Suggest appropriate data
structure for any real world
problem
CO3 Use graph, geometric
algorithms for solving real-
world problems
CO4 Propose end to end solution
for any problem by proposing
an optimal data structure and
algorithm

COURSE PLAN (PART II)

COURSE OVERVIEW

This course covers the advanced topics in Data structures including advanced heaps, advanced trees, tree structures that
are used for Multimedia data and for geometric algorithms. Multimedia datastructures will have a different perspective to
search algorithms. Geometric algorithms will cover the problems related to finding line intersectins, map intersections, etc.,
Algorithms strategies, algorithms analysis, asymptotic notations, randomized algorithms will also be discussed.
COURSE TEACHING AND LEARNING ACTIVITIES
Sl. Week Topic Mode of Delivery
No.
1. 12/08/2024 to 16/08/2024 Unit1: Introduction to Algorithms, Need PPT/CHALK AND
2 hours for Analysis, design strategies, TALK
2. 19/08/2024 to 23/08/2024 Analysis of Iterative algorithms PPT/CHALK AND
1 hour TALK
3. 19/08/2024 to 23/08/2024 Asymptotic notations – O, ϴ, Ω – Problems, PPT/CHALK AND
2 hours Randomized algorithms TALK
4. 19/08/2024 to 23/08/2024 Lab 1 – Basic data structures LAB
2 hours
5. 26/08/2024 to 30/08/2024 Analysis of Recursive algorithms – Iterative PPT/CHALK AND
1 hour method TALK
6. 26/08/2024 to 30/08/2024 Lab 2 – LEETCODE LAB
2 hours
7. 26/08/2024 to 30/08/2024 Tree method, Substitution method, Masters
2 hours method, algebraic method
8. 02/09/2024 to 06/09/2024 Lab 3 – Priority queue implementation, LAB
2 hours Leetcode exercise

9. 02/09/2024 to 06/09/2024 Amortized analysis, Potential, aggregate and PPT/CHALK AND

1 hour accounting method TALK

10. 02/09/2024 to 06/09/2024 NP complete and NP hard problems PPT/CHALK AND

2 hours TALK

11. 09/09/2024 to 13/09/2024 Unit 3 – BST implementation, AVL trees PPT/CHALK AND
1 hour TALK

12. 09/09/2024 to 13/09/2024 AVL trees, Red Black trees – all operations PPT/CHALK AND
1 hour TALK

13. 09/09/2024 to 13/09/2024 Red black trees all operations PPT/CHALK AND
1 hour TALK

14. 09/09/2024 to 13/09/2024 Lab 4 – Tree implementation Lab

2 hours

15. 16/09/2024 to 20/09/2024 Splay trees, Tries, B Trees – all operations PPT/CHALK AND
3 hours TALK

16. 16/09/2024 to 20/09/2024 Lab 5 – Splay and B trees Lab

2 hours

17. 23/09/2024 to 27/09/2024 Quad-Trees, K-d trees and Segment trees PPT/CHALK AND
3 hours TALK

18. 23/09/2024 to 27/09/2024 Lab 6 – K-d trees Lab

2 hours
19. 30/09/2024 to 04/10/2024 Unit 2 – Min-max heaps, Deaps, leftist heaps PPT/CHALK AND
2 hours TALK
20. 30/09/2024 to 04/10/2024 Lab 7 – Heaps implementation Lab
2 hours
21. 07/10/2024 to 11/10/2024 Skew leftist heaps, Binomial heaps, Fibonacci PPT/CHALK AND
3 hours heaps TALK

22. 07/10/2024 to 11/10/2024 Lab 8 – Heaps implementation and Lab

2 hours applications
23. 14/10/2024 to 18/10/2024 Unit 4 – Maximum flow – Flow computation – PPT/CHALK AND
2hours Ford Fulkerson method TALK
24. 14/10/2024 to 18/10/2024 CT 1 Written
1 hours
25. 21/10/2024 to 25/10/2024 Ford Fulkerson method proof – Edmond karp PPT/CHALK AND
2 hours algorithm TALK
26. 21/10/2024 to 25/10/2024 Maximum bipartite matching PPT/CHALK AND
1 hour TALK
 27. 21/10/2024 to 25/10/2024 Lab 9 – Graph implementation Lab
2 hours
28. 28/10/2024 to 01/11/2024 Convex hull, Closest pairs of points PPT/CHALK AND
3 hours TALK
29. 28/10/2024 to 01/11/2024 Lab 10 – convex hull implementation Lab
2 hours
30. 04/11/2024 to 08/11/2024 Line segment intersection PPT/CHALK AND
2 hours TALK
31. 04/11/2024 to 08/11/2024 Map overlay algorithm PPT/CHALK AND
1 hour TALK

32. 04/11/2024 to 08/11/2024 Lab 11 – line segment intersection Lab

2 hours

33. 11/11/2024 to 15/11/2024 Map overlay algorithm, doubly connected edge PPT/CHALK AND
2 hours list TALK
34. 11/11/2024 to 15/11/2024 Voronoi diagram PPT/CHALK AND
1 hour TALK
35. 11/11/2024 to 15/11/2024 Lab 12 – Voronoi diagram Lab
2 hours
36. 18/11/2024 to 22/11/2024 Voronoi diagram PPT/CHALK AND
2 hours TALK
37. 18/11/2024 to 22/11/2024 Cycle Test 2 Written
1 hour
COURSE ASSESSMENT METHODS
Sl. Mode of Assessment Week / Date Duration % Weightage
No.
1. Cycle Test 1 As per schedule 1 hour 15
2. Cycle Test 2 As per schedule 1 hour 15
3. Full Semester Weekly
Lab Continuous Assessment 15
assignment
4. Project November, December 2024 16 hours 15

Compensation
As per academic schedule 1 hour 15
Assessment*

5. As per
Final Assessment As per academic schedule institute 40
norms
COURSE EXIT SURVEY (mention the ways in which the feedback about the course is assessed and indicate the
attainment also)

1. Students’ feedback through class committee meetings

2. Feedbacks are collected before final examination through MIS or any other standard
format followed by the institute
3. Students, through their Class Representatives, may give their feedback at any time to
the course faculty which will be duly addressed.

COMPENSATION POLICY
 Only one instance of absence is acceptable in continuous assessment, and a compensation assessment for
such cases will be conducted only once.
 Compensation assessments are restricted to genuine reasons, like severe illness, and require valid proof in
the form of a medical certificate issued by the NITT hospital medical officer.