CS 514 - Summer 2003
Fundamentals of Computer Science
This page is saved for archive purposes. There may be a number of dead links.
July 31, 2003 - Here are solutions for Homework 4. Here are the applets for Dijkstra's and Prim's algorithms, which were designed by Kenji Ikeda.
July 23, 2003 - The syllabus is set (I think). Note that there is an extension for Lab 4. It is due at 11:59pm on Sunday, August 3 instead of Thursday. Start early! The lab involves a number of different, but related parts. Also, you will have one week for the take-home final. It will be due Thursday, August 7th at 6pm.
July 15, 2003 - There is another syllabus update because of Thursday's missed class. Also, print out the pseudocode for BFS and DFS and bring it with you to class on Thursday (7/17).
July 3, 2003 - For an in-depth discussion of B-Tree insertion, read section 18.1 of CLR. For deletion, check or section 18.2 or this diagram, which may be easier to follow.
July 1, 2003 - Another syllabus revision.
June 24, 2003 - The syllabus has been revised slightly.
June 10, 2003 - Make sure to take a look at the revised late policy for assignments and labs.
This course, intended for graduate students without a computer science background, covers the core components seen in a computer science undergraduate curriculum on which our graduate level courses rely. Topics include fundamental algorithms, data structures, proof techniques, computational models, machine organization, and software design and implementation. Prerequisites for this class: graduate standing; CS 504N or prior programming experience; some mathematical sophistication highly desirable.
Course:
5:30pm - 7:30pm -- Cupples II 217
Lab Section: 7:30pm - 9:30pm -- Sever 203
Class Email: cs514@cec.wustl.edu
Instructor: Richard Souvenir
rms2@cse.wustl.edu
Teaching Assistant: Corey Warner
cnw1@cec.wustl.edu