{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CSE101soln - CSE 101 ALGORITHMS CSE 101 ALGORITHMS General...

Info icon This preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE 101: ALGORITHMS CSE 101: ALGORITHMS -- General notes Syllabus Graph algorithms: strongly connected components, shortest paths, minimum spanning trees Divide-and-conquer strategies Dynamic programming Linear programming and network flows NP-completeness and ways to cope with it Course materials 1. Required text (available at bookstore): Dasgupta-Papadimitriou-Vazirani 2. Recommended text for background material: Neapolitan and Naimipour (on reserve at S&E library) Discussion sections You are welcome to attend more than one section per week William Matthews Wed 12-1 in HSS 2150 Wed 1-2 in HSS 2321 Yatharth Saraf Wed 11-12 in HSS 1315 Wed 2-3 in HSS 2150 Examinations Midterm 1: Jan 30 Midterm 2: Feb 27 Final: March 20, from 7p to 10p, in Center 109 Homework policy Collaboration: A good way to understand the course material is to discuss it with your peers. You are welcome to collaborate in small groups on the homework assignments, but anything you turn in must be in your own words . Lateness: Homeworks should be turned in at the beginning (first five minutes) of class, on the due date. No late homeworks will be accepted. Your lowest homework score will be dropped. Grading Homeworks: 20% Midterms: 20% each Final: 40% http://charlotte.ucsd.edu/~dasgupta/101/syllabus.html9/5/2007 7:05:29 AM
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon