Chandan Karfa

CS 201: Data Structure

Instructors

• Dr. Chandan Karfa (before Mid-sem)

• Dr. Amit Awekar (after Mid-sem)

Class Timing and Venue:

Syllabus:

• Before Mid-sem:

  • Performance of algorithms: space and time complexity, asymptotics;

  • Fundamental Data structures: linked lists, arrays, matrices, stacks, queues, binary trees, tree traversals, binary search trees;

  • Priority Queues: lists, heaps, binomial heaps, Fibonacci heaps;

  • Graphs: representations, depth first search, breadth first search;

• After Mid-sem:

  • Algorithms for sorting and searching: linear search, binary search, insertion-sort, selection sort, bubble-sort, quicksort, mergesort, heapsort, shellsort;

  • Hashing: separate chaining, linear probing, quadratic probing;

  • Advanced Trees: red-black trees, AVL trees, splay trees, B-trees;

  • Data structures with the memory hierarch;

  • Strings: suffix arrays, tries;

  • Randomized datastructures: skip lists.

Text Book:

• [CLRS] T. H. Cormen, C. E. Leiserson, R L Rivest and C Stein, Introduction to Algorithms, MIT Press, 2001

• [TLA] A. M. Tannenbaum, Y Langsam and M J Augenstein, Data Structures Using C, Prentice Hall India, 1996.

References:

• [HSM] E. Horowitz, S Sahani, D Mehta, Fundamentals of Data Structures in C. University Press 2008.

• S. Lipschutz, Data Structures with C, McGrawHill, 2011.

• R. Sedgewick, Algorithms in C Parts 1-4, 3rd Ed., Pearson Education, 1998.

• R. Sedgewick, Algorithms in C Part 5, 3rd Edn., Pearson Education, 2002.

• [Weiss] M. A. Weiss, Data Structures and Problem Solving Using Java, Addison-Wesley, 1997.

TAs:

Grade Calculation

Classes