Course page for ID2230 - Data Structures & Applications
Back to my homepage
Class timings: Mon 2:30 pm-4:00 pm & Thu 4:00 pm-5:30 pm.
Basic data types - Lists, Stacks, Queues, Trees, Abstract data types. Big-Oh Notation.
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.
Graphs: Basic representations, Breadth First Search,
Disjoint Set (Union Find) Data Structure and application to Minimum Spanning Tree.
1. Introduction to Algorithms: Cormen, Leiserson, Rivest and Stein
Short Quizzes: 20 %
Programming Assignments: 30%
Long Quizzes: 10+10+30=50%