Back to my homepage
Class timings: Mon 2:30 pm-4:00 pm & Thu 4:00 pm-5:30 pm.
Syllabus (Approx):
Part I:
Basic data types - Lists, Stacks, Queues, Trees, Abstract data types. Big-Oh Notation.
Part II:
Dictionaries. Binary search trees,
Balanced search trees (such as AVL trees or Red-black trees), B Trees;
Hash tables -- Chaining and Open Addressing; Priority queues & heaps.
Part III:
Graphs: Basic representations, Breadth First Search,
Disjoint Set (Union Find) Data Structure and application to Minimum Spanning Tree.