2017SP_EECS_336-0_SEC1 Design & Analysis of Algorithms

2017SP_EECS_336-0_SEC1 Design & Analysis of Algorithms

EECS 336: Introduction to Algorithms

[cover]

Required Text: Kleinberg and Tardos, Algorithm Design, 2005.
Discussion/Announcements: on Piazza.
Homework: on Mechanical TA. (Mechanical TA guidelines)

Lectures: Tuesday and Thursday 3:30-4:50 in Tech L211.
Instructor: Jason D. Hartline.
Office Hours: Thursday, 2:00-2:50, or by appt.; Ford 3-329.

Teaching Assistants: Sam Taggart, Aleck Johnsen, and Yiding Feng
Lab Sections: Monday, various times.
Office Hours:

  • Aleck: Monday, 12pm, Tech LG62.
  • Yiding: Tuesday, 11am, Frances Searle 1483.
  • Sam: Wednesday, 11am, Tech LG66.

Overview. Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous framework for the study optimization. This course provides an introduction to algorithm design through a survey of the common algorithm design paradigms of greedy optimization, divide and conquer, dynamic programming, network flows, reductions, and approximation algorithms. Important themes that will be developed in the course include the algorithmic abstraction-design-analysis process and computational tractability (e.g., NP-completeness).

Prerequisites. EECS 212 (Mathematical Foundations of Computer Science) and EECS 214 (Data Structures and Data Management) which cover abstract data types such as stacks, queues, and binary search trees; and discrete mathematics such as recurrence relations, sets, and graphs.

Grading. 30% Homework, 30% Peer review, 20% Midterms, 15% Final, 5% Participation.

Homework Policy. Homeworks are recommended to be done in groups of two; students must not work in groups greater than two.  Both students must contribute to the solution of all problems. Pairs should submit one typed copy of each problem to its corresponding assignment submission in Mechanical TA.  Both students will receive the same grade for the submission.  Assignments must be typed and LaTeX is recommended (see LaTeX Hints). You may consult your text book and course notes when answering homework questions; you must not consult the Internet or other students except for getting ther than for help with LaTeX.   Homeworks are assigned and due on Thursdays at midnight (or as noted).  Peer reviews are assigned on Thursdays at shortly after midnight and due Sunday at midnight.  Late homework and peer reviews will be not be accepted.  All homework problems and peer reviews will be equally weighted in your final grade with the exception of your lowest three of each which will be automatically dropped.  See Homework Preparation Guidelines.

Tentative Schedule:

Week 1: beginning Mar. 27

Week 2: beginning Apr. 3

Week 3: beginning Apr. 10

Week 4: beginning Apr. 17

Week 5: beginning Apr. 24

Week 6: beginning May 1

Week 7: beginning May 8

Week 8: beginning May 15

Week 9: beginning May 22

Week 10: beginning May 29

Week 11: beginning June 5

Course Summary:

Date Details