top of page
MY TEACHING
Course Name: Advanced Data Structures and Algorithms
​
Course Code: ADA
July - December; Odd Semester
For M.Tech.(I.T.) - 1st Semester
Jointly Offered With: Dr. Triloki Pant
News & Updates:-
​
-
2018: C1 FINAL
-
2018 C1: Review Test Question Papers
-
2018 C1: LAB Assignments
-
2018 C1: Tutorial Assignments
-
2018 C1: Scores
-
All C1 LAB Assignments Scores
-
All C1 Tutorial Assignments Scores
-
C1 FINAL SCORES (Out of 30) [T.B.A.]
-
-
2018 C1: Attendances
-
2018 C2 FINAL SCORES
-
2018: C3
-
Tutorial Evaluation Scores
-
Project Assignments
-
Project Evaluation Scores
-
Review Test Question Paper
-
Review Test Solutions for PART-A
-
Review Test Evaluation Scores
-
Syllabus:-
Topics for Coverage
Unit
Unit 1
Unit 3
Unit 4
Component
Graphs: Representation and Traversal
Graph Algorithms : All source shortest paths,
Transitive closure
Max-flow - Min-Cut
Sets and Their representations
Operations on Sets
Strings : Representation and opertions
Compression and Encoding
Component 2
Component 1
Binary Trees and Search Trees
Scapegoat Trees
Red-Black Trees
Unit 2
Introduction to Data Structures
Introduction to Computing complexity of operations on data structures
Linear Data Structures : Stacks, Queues, Circular Queues
Array-Based and LinkedList based represenation
Book References:-
-
Data Structures Using C and C++ by Yedidyah Langsam, Moshe J. Augenstein and Aaron M. Tenenbaum, Pearson
-
Introduction to Algorithms (Ed 3) by TH Cormen, CE Leiserson, RL Rivest and C Stein, MIT Press
-
Algorithms + Data Structures = Programs by Niklaus Wirth, PHI Learning
Grading Policy:-
-
C1 (30%); C2 (30%); C3 (40%)
-
Division of C1:-
-
LAB (50%)
-
All LAB Assignments (70%)
-
LAB Review Test (25%)
-
LAB Attendance (5%)
-
-
Theory (50%)
-
All Tutorial Assignments (70%)
-
Review Test (25%)
-
Attendance (Tut. + Theory) (5%)
-
-
​
bottom of page