|
David Scot Taylor 212 MacQuarrie Hall Assistant Professor Dept. of Computer Science San Jose State University Phone: (408) 924-5124 (email works better) Email: taylor "at" cs.sjsu.edu My office hours for Spring 2008 : Tue/Thur 8:30-9:00, (the last 10 minutes in MH222), 11:50-13:30 (the last 10 minutes in MH223)Note: I will be on leave until March 17. |
Until David Taylor's return, please use Adel Atta's Section 3 website and Edwin Mach's Section 4 website.
| Date | Topics Covered | Readings (Cormen et al 2nd edition) |
Homework |
| May 8 | Floyd-Warshall, Knapsack, brief intro to NP problems and reductions | 25.2, 34.5.2 | Due May 13: 25.2-1. Also, show the knapsack table for items of weight 2, 3, and 7, with a knapsack of size 10. Consider problems on the final review sheet, and come with questions on Tuesday. |
| May 6 | Tests returned, intro to dynamic programming | dicussion based on problem 31-3(a,b) in the text | There will be one last assignment on May 8, due May 13, but nothing assigned today. |
| May 5 | No class, but new program to be posted soon. | Due 5/13, by classtime: Programming Assignment 5. | |
| May 1 | Midterm 2 | ||
| April 29 | Review for Midterm 2 | ||
| April 25 | (No class) | Due 5/6: Programming Assignment 4. | |
| April 24 | Single Source Shortest Path Trees: Acyclic Graphs. Loop Invariants. | Chapter 24.2, page 17-19. Practice Problems given in hardcopy. | Due 4/29: Online Dijkstra and Bellmann Ford
problems at http://oslo.cs.sjsu.edu/moodle.
Important for Mac OSX users: The Interactive Tool for the Bellman Ford problem seems to
not be completely visible if you are using Mac OSX, depending on which
system you have. If, for your interactive tool, you get an application without directions and
buttons on the right, please try a Windows machine, or click around to
the right of the graph until you find the "hidden" buttons and text
(they are there, they just are not refreshing correctly with some machines.)
If you are having problems finding the problems in moodle, click the "resources" button (upper left), or click the box to the right of any problem you see. Note: The deadline for the DFS and BFS problems has passed. The deadline for the Prim and Kruskal problems has also passed, but we will still take answers at least through tomorrow, but definitely not past Sunday. |
| April 22 | Single Source Shortest Path Trees: Dijkstra and Bellman-Ford | Chapter 24.0, 24.1, 24.3 | Online problems to be posted soon. (I will send out an email when they are ready.) |
| April 17 | Minimum Spanning Trees: Kruskal's and Prim's Algorithms | Chapter 23 | Due 4/24: Online Prim and Kruskal problems at: http://oslo.cs.sjsu.edu/moodle. |
| April 15 | Finish Strongly Connected Components, Disjoint Set (using union by Size, not Rank) | Chapters 22.5, 22.1-3 | Due 4/22: Homework.
When logging onto the moodle site, it seems that some of you have to "hunt" for the DFS problem, while it is on the front page for others. The problem is posted, please look for it if you do not see it upon logging in. The online DFS and BFS problems will be closed on 4/17. For those of you who have accidentally closed the problem in the first question, email me with details, and your account may or may not be reset. |
| April 10 | Topological Sort (2 ways), start Strongly Connected Components | Chapters 22.4, start 22.5 | Due 4/15: A new DFS problem is now posted at
http://oslo.cs.sjsu.edu/moodle.
Also, due 4/17: 22.4-2 (page 552) from the text.
For those of you who have not sent me an email, from the 3/20 homework, you won't have an account, and will be unable to do the online homework assignment. |
| April 9 | No class, but 1st programming assignment submission directions posted. | Due 4/13 (extended from 4/11): Programming Assignment 3. | |
| April 8 | Finish BFS, Depth First Search | Chapters 22.2, 22.3 | Due 4/15: A new DFS problem will be posted at
http://oslo.cs.sjsu.edu/moodle,
hopefully by the evening of 4/10.
For those of you who have not sent me an email, from the 3/20 homework, you won't have an account, and will be unable to do the homework assignment. |
| April 3 | Graphs, Representations, and Breadth First Search | Chapters 22.1, 22.2 | Due 4/10: For those of you who have emailed me, I have
emailed you an account number and password for a site yet to be
posted. The website for your homework is http://oslo.cs.sjsu.edu/moodle.
Upon entering the site, you will see the informed consent
sheet, also available here.
For those of you who have not sent me an email, from the 3/20 homework, you won't have an account, and will be unable to do the homework assignment. |
| April 2 | No Class, 1st programming assignment is posted | Due 4/11: Programming Assignment 3. |
| Date | Section 3 Topics Covered | Readings (Cormen et al 2nd edition) |
Homework | Section 4 Topics Covered | Readings (Cormen et al 2nd edition) |
Homework |
| April 1 | 2-3-trees, 2-3-4 trees, B-Trees | Chapter 18-8.2 and balanced binary tree handout. | Due 4/3: Exercise 18.2-1. Give a full answer. Also, answer the same question for the case of a top-down 234 tree. (The minimum degree 2 B-Tree of the book is a 234 tree, so you can answer this question for the top down tree, or the regular, bottom up insertion tree.) Programming assignment will be posted on 4/2. | Finish B-Trees | Chapter 18-8.2 and balanced binary tree handout. | In order to synchronize with the other section, no additional homework due 4/3, but a programming assignment will be posted on 4/2. |
| March 20 | Review 2006 midterm, especially substitution method | Chapters 4.1, 18-18.2, and balanced binary tree handout. You have already covered B-Trees, but I will quickly review them again the first class after break. | Due 4/3: Book Exercise 4.1-5 (note, you are given your "guess"), be very detailed. Also: email me, with subject CS146 Spring2008 Section3, and body with your name and preferred email address. | Review 2006 midterm, top down 234 trees, start B-Trees | Chapter 18-18.2 and balanced binary tree handout. We will finish B-Trees the first class after break. Warning, I will assign more homework on 4/1, but made this due date 4/3 due to spring break. | Due 4/3: Exercise 18.2-1. Give a full answer. Also, answer the same question for the case of a top-down 234 tree. (The minimum degree 2 B-Tree of the book is a 234 tree, so you can answer this question for the top down tree, or the regular, bottom up insertion tree.) Also: email me, with subject CS146 Spring2008 Section4, and body with your name and preferred email address. Warning, I will assign more homework on 4/1, but made this due date 4/3 due to spring break. |
| March 18 | Midterm 1 and QuickSelect | 9.2 | Due 3/20: Midterm 1, 2006, excluding last question (handed out in class) | QuickSelect and 2-3 trees | 9.2 and start balanced binary tree handout | Due 3/20: Midterm 1, 2006, excluding last question (handed out in class) |
| January 24 | Introductions and Administrivia | Skim Chapter 1 | Introductions and Administrivia | Skim Chapter 1 | First HW for Section 4 |