CSC 270, Fundamental Data Structures and Techniques

The CSC270 newsgroup. See the note on connecting from outside of CDF.

Current announcements	None
Lecture outlines	Summary Just the C/C++ notes September 9, 16, 23, 30 October 7, 14, 21, 28 November 4, 11, 18, 25 December 2
Assignments and tests	Assignment 4, Solutions Assignment 3, Marking guide Assignment 2 Midterm: Marking guide; Solutions (35 Kb Postscript) Assignment 1; Sample functions: 1, 2, 3; Marking Guide
Animations	Knapsack algorithm by Adam Doppelt of Brown University Dijkstra's algorithm by Carla Laffra at Pace University Root-finding methods
Syllabus and policies	Syllabus Remarking policy Lateness policy Missed midterm policy Plagiarism
Other information	Who marked what Marking statistics about CDF A map to locate the CDF machines. Past csc270 exams C and C++: C FAQ C++ FAQ and another GNU C++ FAQ C++ tutorial another C++ tutorial GDB: My brief tutorial (works on CDF) A brief tutorial, plus reference card An online reference manual

• Unclaimed A1s, A2s, and midterms are in the CSSU office.
• Here are the results of the elevator competition.
• Here's a pointer to lots of info on Dynamic Programming.
• My lecture notes are available in the Engineering Library on the second floor of the Sanford Fleming Building.
• Type deadlines on CDF to see upcoming assignment deadlines for other courses.
• Cheap C/C++ on your PC: You can get a version of gcc for your PC either (a) on a $28 cdrom available at the bookstore (the Walnut Creek GNU cdrom) or (b) by downloading it for free from the Web.
• There's an emacs problem with the coloured fonts on monochrome terminals. Here's a solution.