CS 127 Assignments, Winter 2001

Things to hand in

• Assigned Wednesday 1/3/01, due via HSP by class time Monday, 1/8/01. Complete the implementation of the CString class found in cstring.cpp, cstring.h, and cstringmain.cpp.
  
  
• Assigned Friday 1/12/01, due via HSP by class time Wednesday, 1/17/01. Mazes.
  
  
• Assigned Friday 1/19/01, due on paper at class time Wednesday 1/24/01. Timing.
  
  
• Assigned Friday 2/9/01. Due at class time on Monday 2/19/01. Searches. Hand in your code via HSP, and your report on paper.
  
  
• Assigned Wednesday 2/21/01. Due at class time on Wednesday 2/28/01. Hand in your code via HSP.
  
  Phase I: Write a program that reads a graph from a text file and draws the graph on screen. You may use the g2 graphics library (Intro to C++ graphics using g2 and g2 graphics reference may be helpful).

  Phase II: Same as phase I, but compute a spanning tree for the graph, and draw the edges from the spanning tree in a different color than the other edges.
  
  

• Due 5:00PM Wednesday, March 14. The Final Project.

Suggested Reading

• 1/3/01. Read Chapter 1 from "The P Word" through "The World of C" in Weiss. Read Chapter 3 from the beginning through "Memory Reclamation and the Big Three."
  
  
• 1/10/01. Read Chapter 3.
  
  
• 1/17/01. Read Chapter 2.
  
  
• 1/22/01. Read sections 1.6, 4.1, 4.2, and 4.3.
  
  
• Read section 4.4.
  
  
• Read sections 5.1-4.
  
  
• 2/19/01. Read sections 6.1-4, 7.5.
  
  
• 2/21/01. Read section 9.1, and read about breadth-first search and depth-first search (use the index).
  
  
• 2/26/01. Read section 9.3.1-9.3.2 (Dijkstra's algorithm).