25B11CI38: Data Structures

This course will introduce fundamental concepts of Data Structures .

Class Schedule

  • Batches: 25A17, 25A18, 25A19
    Day & Time: Monday, Wednesday, Friday | 09:00 – 10:00 | (CR-9)

Tutorial Schedule

  • Batch: 25A17
    Day & Time: Wednesday: 14:00 – 15:00 | (TR-3)
  • Batch: 25A18
    Day & Time: Wednesday: 13:00 – 14:00 | (TR-2)
  • Batch: 25A19
    Day & Time: Friday: 11:00 – 12:00 | (CR-17)

Instructors

  • Dr. Kushal Kanwar (KLK)(Course Coordinator)
  • Mr. Sandeep Kumar Patel (SKP)

Syllabus

This is a 3-1-0 (L–T–P)

  • Unit 1: Overview of Linear Data Structures
    Overview of linear data structures: array, linked list, stack, and queue.
  • Unit 2: Searching, Sorting, and Hashing
    Searching and sorting algorithms Interpolation Search, Median Search; Hashing Hash Table, Chaining, Probing; Sorting Merge, Quick, Radix, Bucket, and Count; Time and Space complexity analysis of searching and sorting algorithms.
  • Unit 3: Advanced Trees and Heaps
    Implementation of Multi List, Binary Tree, K-ary Tree, Tree traversals, Threaded Binary Tree, Priority Queue using Binary Heap, Binomial Heap, and Fibonacci Heap, Heap Sort.
  • Unit 4: Search Trees and Multiway Trees
    Binary Search Tree (BST), Balanced BST: AVL Tree and RB Tree; Multiway Tree: B Tree and B+ Tree.
  • Unit 5: Graph Fundamentals and Algorithms
    Fundamentals of Graph, Adjacency Matrix and List; Graph Traversal using DFS and BFS, Basic Algorithms Shortest Path and Minimum Spanning Tree.
  • Unit 6: Special Trees and String Data Structures
    Interval Tree, Segment Tree, and String Data Structures: Suffix Tree, Tries, Suffix Array.
-->

Syllabus for TEST-1 Examination

Unit 1
  1. Overview of Linear Data Structures
    • Introduction to linear data structures
    • Arrays
    • Linked Lists
    • Stacks
    • Queues
Unit 2
  1. Searching
    • Interpolation Search
    • Median Search
  2. Hashing
    • Hash Table
    • Chaining
    • Probing
  3. Sorting
    • Merge Sort
    • Quick Sort
    • Radix Sort
    • Bucket Sort
    • Counting Sort
  4. Complexity Analysis
    • Time complexity analysis
    • Space complexity analysis
    • Complexity analysis of searching algorithms
    • Complexity analysis of sorting algorithms

Text Books

  1. Aaron M. Tanenbaum, Data Structures Using C, Pearson Education.
  2. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures, Illustrated Edition, Computer Science Press, Year not specified.
  3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms, 3rd Edition, MIT Press, 2009.
  4. Dinesh P. Mehta and Sartaj Sahni, Handbook of Data Structures and Applications, 2nd Edition, Chapman and Hall/CRC Computer and Information Science Series, CRC Press.

Lecture Schedule

Topic Slides
Marking Scheme Preview Download
Unit-1: Overview- Array Preview Download
Unit-1: Overview- Linked List Preview Download
Unit-1: Overview- Stack Preview Download
Unit-1: Overview- Queue Preview Download
Unit-2: Asymptotic Notations Preview Download
Unit-2: Linear, Binary Search Preview Download
Unit-2: Interpolation and Median Search Preview Download
Unit-2: Sorting Preview Download
Unit-2: Hashing Preview Download