EECS 281: Data Structures and Algorithms
Fall 2006

General information

• Instructor: Igor Guskov
  Office hours: Tuesdays and Thursdays 3:00-4:00pm in room 3745 CSE (or send me e-mail)
• Lectures: Tuesdays and Thursdays 1:30pm-3:00pm in room 1670 CSE
• Discussion sections: GSI: Ishan Chaudhuri, e-mail: ishanrc (at) umich.edu
  • Wednesdays 3:30-4:30pm: room 2150 DOW
  • Fridays 1:30-2:30pm: room 1301 EECS
• GSI's office hours and location: Mondays 10-11am, room 3929 CSE
• Autograder support: Pritpaul Mahal, e-mail: pritpaul (at) umich.edu

News

• Please see ctools announcements page for current news.

Course topics

Introduction to algorithm analysis and O-notation. Fundamental data structures including lists, stacks, queues, priority queues, hash tables, binary triees, search trees, balanced trees and graphs. Searching and sorting algorithms, recursive algorithms, basic graph algorithms. Introduction to greedy algorithms and divide-and-conquer strategy. Several programming assignments.

Prerequisites

EECS 280, EECS 203.

Course materials

Required Textbook:

• Data Structures and Algorithm Analysis in C++ by Mark Allen Weiss, ISBN: 0-321-44146-X, Third Edition, Addison Wesley

For more recommended materials please see our syllabus