CSC270 — Assignments

Please read these general directives:

Assignment 0

Topic:C programming
Handouts: A0 handout (PostScript)
cover sheet (PostScript)
frequently asked questions
Solution: distance.c
palindrome.c
anagram.c
polynomial.c
marking scheme

Assignment 1

Topic:numerical methods
Handouts: A1 handout (PostScript)
cover sheet (PostScript)
sample output (using an undisclosed function f())
Starter code: root.c
function.c
Solution: root.c
function.h
function.c
solution and marking scheme (PostScript)

Assignment 2

Topic:dynamic programming
Handouts: A2 handout (PostScript)
cover sheet (PostScript)
Solution: sample solutions (PostScript)
marking scheme
comments from the markers

Assignment 3

Topic:graph algorithms
Handouts: A3 handout (PostScript)
cover sheet (PostScript)
Solution: fleury.c
graph.h
marking scheme and markers' comments

Assignment 4

Topic:simulation
Handouts: A4 handout (PostScript)
cover sheet (PostScript)
Starter code: Makefile
cars.cpp
cars.h
find_path.cpp
graph.cpp
graph.h
network.cpp
network.h
queues.cpp
queues.h
random_numbers.cpp
random_numbers.h
shortest_path.cpp
shortest_paths.h
trafficsim.cpp
use_queues.cpp

Note: the find_path.cpp and use_queues.cpp files are not part of the simulator, but are provided to demonstrate how the shortest path, graph, and queue modules are used.

For those interested, I have posted a larger city map which you can use as input to your simulator. You can also see a graphical representation of the map.

Solution: marking scheme and markers' comments

Tristan Miller
Last modified: Wed Aug 21 07:13:48 EDT 2002