CompSci 161: Design and Analysis of Algorithms

• Class meetings (Summer 2013)
  • Lectures:       M W 10-11:20am in ELH 110
  • Discussions: M W 11:20am-11:50pm in ELH 110
        some discussions may run longer
        some discussions (as announced in class) will be moderated

• Instructor
  • Professor Dan Hirschberg -- dan (at) ics.uci.edu
        office hours by appointment in DBH 4226
  • Teaching Assistant:    

• Prerequisites
  • calculus (Math 2AB), discrete mathematics (ICS 6D), data structures (ICS 46)

• Add/drop policy
  • All adds/drops handled through Summer Session office
  • No instructor signatures for adds/drops after July 12

• Course Texts
  • Required: Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms (3rd ed.), MIT Press, 2009.
  • Recommended: Baase, Van Gelder, Computer Algorithms (3rd ed.), Addison-Wesley, 2000.
  • Reference: Goodrich and Tamassia, Algorithm Design, Wiley, 2002.
  • Reference: Dasgupta, Papadimitriou, and Vazirani, Algorithms, McGraw-Hill, 2007.
  • List of reference books

• Course Goals
  To develop an understanding of efficiency of algorithms, to learn some algorithmic design techniques, and to analyze the complexity of the amount of resources required by algorithms for a variety of applications.

• Homeworks and Examinations
  • Policies
  • Schedule

• Course Outline

• Lecture Notes

• Grading
  • Policies
  • 10% -- homework submissions
  • 20% -- several pop quizzes
  • 30% -- two midterm examinations (M of week 4, W of week 7)
  • 40% -- final exam (Wed Aug 28 at 10am)
  • To pass the course you must pass the final exam and have an overall passing average
  • Instances of academic dishonesty will be reflected in the final grade because dishonesty devalues the learning experience for the whole class.