Course Description

The objectives of this course are for students to learn to define and implement classic data structures, to learn classic algorithms for basic operations on different data structures, to implement and test classic algorithms for basic operations on different data structures, and to learn to analyze and evaluate algorithm performance and compare different algorithms.

The material of the course will cover Abstract Data Types (ADT), Collections, Data Structures (chapter 3), Traversing a collection; iterators. Implementing iterators for List ADT (chapter 3), Algorithm performance analysis (chapter 2), Efficient sorting algorithms and their analysis (chapter 7), Stacks and stack operations. Queues and queue operations (chapter 3), Priority queues and their implementation. Binary heaps and heap operations (chapter 6), Binary Search Trees and BST operations, AVL Trees and AVL Tree operations, Tree traversals; implementing iterators for different binary tree traversals (chapter 4), Hash Tables. Data arrangement techniques in hash tables. Hash Table operations (chap. 5), and Graphs and graph algorithms (chapter 9).

NEWS

Jan. 2, 2009

Welcome, the new course page is up and running!