This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSE 101: ALGORITHMS CSE 101: ALGORITHMS  General notes Syllabus Graph algorithms: strongly connected components, shortest paths, minimum spanning trees Divideandconquer strategies Dynamic programming Linear programming and network flows NPcompleteness and ways to cope with it Course materials 1. Required text (available at bookstore): DasguptaPapadimitriouVazirani 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 121 in HSS 2150 Wed 12 in HSS 2321 Yatharth Saraf Wed 1112 in HSS 1315 Wed 23 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 CSE 101: ALGORITHMS CSE 101: ALGORITHMS  Reading Date Topic Reading Jan 9 Analyzing algorithms Chapter 0 Jan 11 Graphs; undirected depthfirst search Chapter 3.1, 3.2 Jan 16 DFS in directed graphs; DAGs Chapter 3.3 Jan 18 Strongly connected components Chapter 3.4 Jan 23 Breadthfirst search Chapter 4.1, 4.2, 4.3 Jan 25 Dijkstra's algorithm Chapter 4.4, 4.5 Feb 1 BellmanFord algorithm, shortest paths in dags Chapter 4.6, 4.7 Feb 6 Properties of trees Chapter 5.1 Feb 8 Minimum spanning trees Chapter 5.1 Feb 13 Divideandconquer algorithms Chapter 2 (omit 2.6) Feb 15 Divideandconquer algorithms Chapter 2 (omit 2.6) Feb 20 Dynamic programming Chapter 6 Feb 22 Dynamic programming Chapter 6 Mar 1 Flows in networks Chapter 7.2 Mar 6 Flows and matchings Chapter 7.2, 7.3 Mar 8 Linear programming Chapter 7.1 Mar 13 Intractability Chapter 8 Mar 15 Intractability Chapter 8 http://charlotte.ucsd.edu/~dasgupta/101/reading.html9/5/2007 7:06:13 AM Solutions to Homework Two CSE 101 3.1. In the figure below, pre and post numbers are shown for each vertex. Tree edges are solid, back edges are dashed. A B C D E F G H I 1,12 2,11 3,10 4,9 7,8 15,16 14,17 13,18 5,6 3.2. (a) A C B E D G H F 3,14 5,12 8,9 1,16 2,15 4,13 6,11 7,10 Solid edges are tree edges. Among the dotted edges, ( A, F ) and ( B, E ) are forward edges while the rest are back edges. There are no cross edges. 3.3. In the figure below, the algorithm finds the ordering: B, A, C, E, D, F, H, G . There are 8 possible orderings....
View
Full
Document
This note was uploaded on 10/10/2010 for the course CSE CSE101 taught by Professor Paturi during the Summer '10 term at UCSD.
 Summer '10
 Paturi
 Algorithms, C Programming

Click to edit the document details