CPSC 331 — Information about Assignments

Information about Assignments

Overview

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

General Information

Information to Support Teamwork

• ITP Metrics: Source of the material to support teamwork that is provided for this course
• ITP Lab Team Contract: [ Word ] [ PDF ]
• ITP Metrics Assessments: The personality and conflict management styles assessments can be completed by a student to learn more about herself/himself/theirself and to better understand how other students might work in a group

Information about Academic Integrity

• Information from the University of Calgary Calendar
• Academic Integrity: Student Handbook
• Student Success Centre’s Page for Academic Integrity
• Additional Recommendations and Requirements for CPSC 331

Expectations about Quality of Work

• Expectations about the Quality of Submissions for Assignments
• Writing Support at the University of Calgary
• Recommended Way to Typeset Assignment: The Not-So-Short Guide to LaTeX 2_ε

Groups for Assignments #1–2

The instructions, given below, refer to forms that are available on the D2L page for this course. Students who are still trying to register and cannot access this page should contact the instructor by email in order to request access to these forms.

• Instructions for Creation of Assignment Groups

Assignment #1: Proving the Correctness of a Simple Recursive Algorithm

• Problems To Be Solved
• City.java: This Java program should be downloaded and compiled before you try to compile the programs you write to solve the programming problems on Assignment #1 and #2.
• Test_Benefits.java: JUnit tests for the program you should write to solve the programming problem on this assignment. These tests will also be used when your program is marked.
• Assignment #1: Additional Information about Submission and Grading

Assignment #2: Analyzing an Algorithm with a Loop

• Problems To Be Solved
• Assignment #2: Additional Information about Submission and Grading

Assignment #3: Height-Balanced Binary Search Trees (Part One)

• Problems To Be Solved
• TwoThreeTree.java: Program for You to Complete
  
  
• Code for Testing:
  
  
  • Instructions for Use
  • TwoThreeTreeUtilities.java: Test Utilities
  • TestTwoThreeTree1.java: One Set of JUnit Tests
  • TestTwoThreeTree2.java: Another Set of JUnit Tests
    
    
• Assignment #3: Additional Information about Submission and Grading

Assignment #4: Height-Balanced Binary Search Trees (Part Two)

• Problems To Be Solved
• TwoThreeTree.java: Program for You to Complete
  
  
• Code for Testing:
  
  
  • Instructions for Use
  • TwoThreeUtilities.java: Test Utilities
  • TwoThreeTest_NoJUnit.java: Test that do not require JUnit
  • TestTwoThreeTree1.java: JUnit Tests for TwoThreeTree.java
  • TestTwoThreeTree2.java: More JUnit Tests for TwoThreeTree.java
    
    
• Assignment #4: Additional Information about Submission and Grading

Assignment #5: Height-Balanced Binary Search Trees (Part Three)

• Problems To Be Solved
• TwoThreeTree.java: Program for You to Complete
  
  
• Code for Testing:
  
  
  • TwoThreeUtilities.java: Test Utilities
  • TwoThreeTest_NoJUnit.java: Tests that do not require JUnit
    
    
• Assignment #5: Additional Information about Submission and Grading

cpsc 331 computer science faculty of science u of c

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