‭Department of Computer Science and Engineering‬

‭National Institute of Technology Calicut‬

‭Tentative Course Plan- Winter 2024‬
‭CS2005D Data Structures and Algorithms‬
‭(Fourth Semester B. Tech CSE)‬

‭Lecture:‬

‭Lecture Hours : D1, D2 Slots‬

‭Instructors:‬

‭Name‬
‭Prof. Priya Chandran‬ ‭ r.S Sheerazuddin‬
D ‭Dr Sudharshan‬
‭(CS01)‬ ‭(CS02 & CS04)‬ ‭Chakravarthy(CS03)‬

‭Office‬
‭ELHC-203‬ ‭ELHC 401‬ ‭ELHC-203‬

‭ elephon‬
T
‭e‬ ‭0495-2286804‬ ‭0495-2286815‬ ‭04952286835‬

‭Email‬
‭[email protected]‬ ‭sheeraz‬‭@nitc.ac.in‬ s‭ udarshan.annadanam@nitc.‬
‭ac.in‬

‭Core Competency‬

‭ o understand and analyze simple algorithms, and assess the suitability of data structures for different‬
T
‭computing tasks‬

‭Course Outcomes‬

‭ O1‬‭:‬‭Analyze algorithms and data structures applying‬‭methods for amortized analysis‬

C
‭CO2: Evaluate methods for performance improvement of dictionaries and mergeable heaps‬
‭CO3: Analyze and assess the applicability of fundamental graph algorithms to applications‬
‭CO4: Assess and evaluate data structures based on randomization‬
‭CO5: Describe and apply data structures for distributed computing applications‬

‭Evaluation Scheme:‬
‭Mid-Term Exam: 30‬
‭Assignments/Quizzes/Lessons/Tutorials : 30‬
‭Quiz : 2*10 = 20‬
‭Assignment /Lesson : 2 * 5 = 10‬

‭End Semester Exam : 40‬

‭Weekly Plan:‬

‭Week‬ ‭Activity‬ ‭Topic‬ ‭Details‬

‭1‬ ‭ ectures‬
L I‭ ntroduction, Correctness,‬ ‭ elevance of data structures and‬
R
‭Tutorial 1‬ ‭Complexity Analysis‬ ‭algorithms, and the relation between‬
‭them.‬‭Review: Time and space‬
‭complexity analysis, proof of‬
‭correctness of algorithms, simple data‬
‭structures and applications.(Stacks,‬
‭Queue, Linked List, Heap & Priority‬
‭Queue)‬

‭2‬ ‭Lectures‬ ‭Trees‬ ‭ raphs, Trees and Positional trees.‬

G
‭Review of Binary Trees and‬
‭(Review Topics)‬ ‭Binary Search Trees (Without Parent‬
‭Pointer).‬‭Importance of recursively‬
‭formulated algorithms, proof of‬
‭correctness aspects.‬

‭3‬ ‭Lectures‬ ‭Hashing‬ ‭ ictionaries, Hashing, Collision‬

D
‭resolution using chaining & open‬
‭addressing,Probabilistic Analysis.‬

‭4‬ ‭ ectures‬
L ‭ mortized Analysis,‬
A ‭ ggregate Analysis, Accounting‬
A
‭Quiz 1‬ ‭Methods and Examples‬ ‭Method, Potential Method, Dynamic‬
‭Tables‬

‭5‬ ‭ ectures‬
L ‭Balanced BST‬ ‭Rotations. AVL Trees,Red black Trees‬
‭Assignment‬
‭1/Lesson1‬
‭Tutorial 2‬

‭6‬ ‭ ectures‬
L ‭Red black Trees,Splay trees‬
‭Quiz 2‬

‭7‬ ‭Lectures‬ ‭Mergeable Heaps‬ ‭ eview of binary heap‬‭Binomial‬

R
‭Heap, Fibonacci Heap‬

‭8‬ ‭Midterm‬

‭9‬ ‭Midterm‬

‭10‬ ‭Lectures‬ ‭Disjoint sets‬ ‭ ata structures for disjoint sets - union‬
D
‭by rank and path compression,‬
‭Ackermann’s function, Analysis of‬
‭combined heuristics performance‬
 ‭11‬ ‭ ectures‬
L ‭Graphs‬ ‭Graph representation, DFS, BFS,‬
‭Assignment2‬
‭/Lesson2‬

‭12‬ ‭ ectures‬
L ‭Graph Algorithms‬ ‭ ST - Kruskal's algorithm -‬
M
‭Tutorial 3‬ ‭implementation using disjoint set,‬
‭Prim’s algorithm, implementation of‬
‭Prim's (priority queues)‬

‭13‬ ‭ ectures‬
L ‭Shortest Path Algorithms‬
‭Quiz 3‬ ‭ hortest path problem - Dijkstra's‬
S
‭algorithms, -, Floyd Warshall‬
‭algorithm, Bellman Ford Algorithm,‬
‭Directed Graphs and Transitive‬
‭Closures‬

‭14‬ ‭ andomized & Distributed‬

R
‭Lectures‬ ‭Data Structures‬ ‭Randomized Data Structures.‬

‭15‬ ‭Lectures‬
‭Treaps, Skip lists.‬

‭16‬ ‭Lectures‬ ‭Review‬

‭17‬ ‭End Sem‬

‭Grading Policy:‬
‭●‬ ‭Grading would be relative, but 30% marks are mandatory‬‭for a pass grade‬

‭●‬ ‭The institute regulations with respect to attendance would be strictly adhered to‬

‭●‬ ‭Copying in exams and other breaches of Academic Integrity (refer‬

‭http://cse.nitc.ac.in/sites/default/files/Academic-Integrity.pdf‬‭)‬ ‭will be very strictly penalized.‬

‭References:‬

‭ . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3/e, MIT‬

1
‭Press, 2003‬

‭ . A. V. Aho, J. D. Ullman, and J. E. Hopcroft, Data Structures and Algorithms, Addison Wesley,‬
2
‭1983.‬

‭3. D. Kozen, The Design and Analysis of Algorithms, Springer, 1991.‬

‭4. C. Okasaki, Purely Functional Data Structures, Cambridge University press, 1999‬