CPSC 331 — Information about Assignments

Information about Assignments

Overview

General information about assignments, and the assignments themselves, are provided below.

General Instructions

• Rules about What is Allowed
  
  
  • Assignment Do’s and Don’ts
  • Information about “Integrity and Conduct” from the UofC Calendar
  
  
  
• Quality of Work
  
  
  • Expectations about the Quality of Students’ Work on Assignments
  • Writing Support at the University of Calgary
  • Information about Typesetting Assignments: The Not So Short Introduction to LaTeX 2_ε
  
  
  
• Remove Access — SSH: Includes information that might be helpful if you are not on campus and wish to make sure that your programs can be compiled using CPSC Unix Servers
  
  
• How to Submit a CPSC 331 Assignment

Assignment #1: Proving the Correctness of Simple Algorithms — and Implementing Them as Java Programs

• Problems To Be Solved
  
  
• Code To Be Used When Completing This Assignment:
  
  
  • City.java: Implementation of a city — not to be changed.
  • Reachable.java: Implementation of the “access” method is to be supplied.
    
    
• Code for Testing:
  
  
  • How To Use the Programs for Testing
    
    
  • test_reachable.sh: Shell Script
    
    
  • Test_Reach_1.java: Tests for Use with JUnit
  • Test_Reach_2.java: Tests for Use with JUnit
  • Test_Reach_3.java: Tests for Use with JUnit
  • Test_Reach_4.java: Tests for Use with JUnit
  • Test_Reach_5.java: Tests for Use with JUnit
  • Test_Reach_6.java: Tests for Use with JUnit
  • Test_Reach_7.java: Tests for Use with JUnit
  • Test_Reach_8.java: Tests for Use with JUnit

Assignment #2: AVL Trees

• Problems To Be Solved
  
  
• Code To Be Used When Completing This Assignment:
  
  
  • Mapping.java: Interface for a “Mapping” (Not To Be Changed)
  • Dictionary.java: Interface for a “Dictionary” (Not To Be Changed)
  • AVLDictionary.java: Implementation of a “Dictionary” using an AVL Tree (To Be Completed)
    
    
• Code for Testing:
  
  
  • Information about Software for Testing
    
    
  • AVLUtilities.java: Utilities to be used when designing tests for AVL trees
  • RSeq.java: Generates (pseudo-)random sequences of integers
    
    
  • AVLTest1.java: First set of tests
  • AVLTest2.java: Second set of tests
  • AVLTest3.java: Third set of tests
  • AVLTest4.java: Fourth set of tests
  • AVLTest5.java: Fifth set of tests
  • AVLTest6.java: Sixth set of tests

Assignment #3: A Fast Algorithm for “Selection”

• Problems To Be Solved
  
  
• JUnit Tests
  
  
  • Test_Select_1.java: Tests for a small ArrayList
  • Test_Select_2.java: Tests for a moderately sized ArrayList
  • Test_Select_3.java: Tests for a moderately sized ArrayList
  • Test_Select_4.java: Tests for a moderately sized ArrayList
  • Test_Select_5.java: Tests for a moderately sized ArrayList
  • Test_Select_6.java: Tests for a moderately sized ArrayList
  • Test_Select_7.java: Tests for a moderately sized ArrayList
  • Test_Select_8.java: Tests for a moderately sized ArrayList
  • Test_Select_9.java: Tests for a moderately sized ArrayList
  • Test_Select_10.java: Tests for a moderately sized ArrayList

cpsc 331 computer science faculty of science u of c

cpsc 331 intro and math review analysis of algorithms basic data structures and adts search trees hash tables searching and sorting graph algorithms java develoment exercises assignments tests