Homeworks and Handouts

CS 132
Intro to Computer Science II
Spring 2005

• For versions of handouts that were also given out on-paper, the on-line formatting will likely vary from the actual paper handouts, but the content should be the same.

• Final Examination Study Suggestions (in PDF)
  
  
• Week #15 Lab Exercise
  • Week #15 Lab Exercise (in PDF)
    
    
  • crunchGrades.cpp
  • avgGrade.cpp
  • countPassing.h , countPassing.cpp
  • minGrade.cpp
  • maxGrade.cpp
  
  
• Homework #11
  • Homework #11 (in PDF) (REVISED 4-28-05 to fix incorrect submission summary at end...)
    
    
  • (some code below adapted from Savitch and Main)
  • graph.h , graph.template , try_graph.cpp
  • node.h , node.template
  • set.h , set.template
  • queue.h , queue.template
  • stack.h , stack.template
  
  
• Homework #10
  • Homework #10 (in PDF)
    
    
  • (some code below adapted from Savitch and Main)
  • node.h
  • node.template
  • hashtable.h
  • hashtable.template
  • stock_item.h
  • test_stock_item.cpp
  
  
• Homework #9
  • Homework #9 (in PDF)
    
    
  • (some code below adapted from Savitch and Main)
  • complete_tree.h
  • complete_tree.template
    
    
  • heap.h
  • test_heap.cpp
  
  
• Homework #8
  • Homework #8 (in PDF)
    
    
  • (all code below adapted from Savitch and Main, Ch. 10)
  • binary_tree_node.h
  • binary_tree_node.template
    
    
  • pseudo-"UML" diagram for binary_tree class (in PDF)
  • binary_tree.h
  • binary_tree.template
  
  
• Exam #2 Study Suggestions (in PDF)
  
  
• Homework #7
  • Homework #7 (in PDF)
  • node class, MINUS LINKED-LIST TOOLKIT, adapted from Savitch and Main's "Data Structures and Other Objects Using C++", 2nd edition, Addison-Wesley
    • node.h
    • node.cpp
    
    
  • stack-related materials
    • "pseudo-UML" diagram for stack class (in PDF)
    • stack.h
    • stack.template
    
    
  • queue-related materials
    • "pseudo-UML" diagram for queue class (in PDF)
    • queue.h
    • queue.template