Course Outline : The course consists of 3 lecture hours per week. The lectures will be focused on the implementation and applications the classical data structures. A basic syllabus will be followed as outlined in the school website here.
Course Instructor : Dr. Arun Kumar Das, SCIS
Teaching Assistants: Saraswathi Gurram, Manisha Kumari
Venue: EB-200, SCIS
Timings : Thursday 3 PM - 6 PM
Grading policy : Assignments - 30%, Minor (Mid Sem) - 30%, Major (End Sem) - 40%
Lecture 1 (07/01/2025) : Introduction, reversing string using arrays, addition and multiplication of large integers using arrays. Analysis of the running time complexity of the algorithm.
Take Home exercise 1: Write a C program to perform division of two large integers given by the user and return the quotient and the remainder.
Lecture 2(23/01/2025) : Recap: Structures in C. Sparse Matrices using structures.
Take Home Exercise 2: Write a C program to report the maximum element in a stack.
Lecture 3(30/01/2025) : Linked list operations, Doubly Linked lists, Reversing a singly linked list.
Lecture 4(06/02/2025) : Polynomial operations using Linked lists, Circular linked list.
Minor 1 (13/02/2025) : Lab Minor Examination!
Lecture 5(20/02/2025) : Sorting algorithms.
Lecture 6(27/02/2025) : Binary search, comparison counting, largest increasing subsequence from an array.
Lecture 7(06/03/2025) : Binary tree implementation, random insertion, printing traversals.
Lecture 8(13/03/2025) : Binary search tree implementation, insertion, printing traversals.
Lecture 9(20/03/2025) : AVL tree implementation, insertion, printing traversals.
Lecture 10(27/03/2025) : AVL tree implementation, deletion.
Minor 2 (03/04/2025) : Lab Minor Examination!
Lecture 11(17/04/2025) : Implementation of Graphs, DFS, BFS.
Project Minor evaluation (24/04/2025) : Evaluation of the assignment project!
Lecture 12(01/05/2025) : Recaps and wrap up!