Logistics
  Grading Policy
  Syllabus/Lecture Notes
  Useful Links
  Announcements
  
  Homeworks
 
       
  HW1
  HW2
  
  Programming Assignments
 
       
  PA1
  PA2
  
 

Don't see the menu?

Welcome to Fall 2011 EECS 281 (First Half)!

Coordinates:
Lectures:
Time: TT 10:30-12:00, 1:30-3:00
Place: 1670 CSE
Pre-requisites (strict): EECS 203, EECS 280
Course page: http://www.eecs.umich.edu/~sugih/courses/eecs281/

Faculty: Sugih Jamin
Office: 4737 CSE
Office Hours: TT 12-12:30, 3-3:30; F 9-10 and by appt.
Tel: +1 734 763 1583
email:

GSIs/IAs (uniqname): Office hours held in 1695 CSE
Max Corman (cormamax): TT 3:30-4:30
Gaurav Kulkarni (kgaurav): F 3:30-4:30
Rong Ling (lingrong): MW 4:30-5:30
Peter Terlep (pterlep): M 3-4, W 1-2
Steve Wishnousky (swish): M 2-3

Discussion Sessions:



Required Readings:
  • [CLRS] Cormen et al., Introduction to Algorithms, 3rd. ed., MIT Press, 2009, ISBN: 978-0262033848.
  • All the contents of the course website.
    We will post important course-related information on Announcements page.

Recommended Readings: for concise descriptions of data structures and algorithms that "emphasize rigor over formalism":
  • Lewis and Denenberg, Data Structures and Their Algorithms, Addison-Wesley, 1991, ISBN: 978-0673397362
  • Dasgupta, Papadimitriou, and Vazirani, Algorithms, McGraw Hill, 2006, ISBN: 978-0073523408 (online draft)

Recommended C++ References:
Or if you prefer flipping physical pages:
  • Stroustrup, C++ Programming Language, 3rd. ed., Addison-Wesley, 1998, ISBN: 0201889544
  • Lippman, Lajoie, and Moo, C++ Primer, 4th. ed., Addison-Wesley, 2005, ISBN: 0201721481, gentler and more verbose than Stroustrup
  • Josuttis, The C++ Standard Library, 1st. ed., Addison-Wesley, 1999, ISBN: 0201379260

EECS 281 is an introductory course in data structures and algorithms at the undergraduate level. The objective of the course is to present a number of fundamental techniques to solve common programming problems. We will also consider the time and space requirements of the solution to these problems.

Students must have obtained a passing grade in each of EECS 203 and EECS 280. We will strictly enforce the prerequisites. Students are also expected to be or to become acquainted with make and a debugger such as gdb.