home
TCSS 343, Winter 2007
Mathematical Principles of Computing II

Current Assignment

Assignment 6 : Due 3/7.


All Assignments
Note: Future assignments will generally not be on the website until they are assigned, which will typically be on the day the previous assignment was due. The anticipated due dates of assigments are listed in the schedule. A missing due date below means the link for the assignment is not yet working, and that the assignment is not yet available.

  1. Assignment 1 : Due 1/10.
  2. Assignment 2 : Due 1/17.
  3. Assignment 3a and 3b : Due 1/31 and 2/5. ClosestPair.java code and example testinput1.txt file for part 3a.
  4. Assignment 4 : Due 2/12.
  5. Assignment 5 : Due 2/26. Starter code for minimum spanning tree .
  6. Assignment 6 : Due 3/7.
  7. Assignment 7 : (no assignment 7 this quarter).
You may also browse the directory of all assignments.

Participation Problems
  • Due M 1/8: Page 59, Exercises section 2.2, Problem #1.
  • Due W 1/10: Exactly how many key comparisons are performed by the Algorithm Merge (p. 126) in the worst case? Your answer should be in terms of p and q, which are the lengths of the two arrays being merged. How about in the best-case?
  • Due W 1/17: Sketch all the points in the (x,y) plane whose Euclidean distance from (0,0) is equal to 1. Do the same for Manhattan distance. (For distance definitions, read problem #3 from Exercises section 3.3.)
  • Due M 1/22: Solve recurrence equation #2, in the new recurrence equation and analysis sheet available from the notes section. The recurrences are at the end of the sheet.
  • Due M 1/29: Exercises section 8.1, problem #1.
  • Due W 1/31: Explain what the Memory Function technique is in the context of Dynamic Programming.
  • Due W 2/7: Do problem #1 on the worksheet handed out in class on 2/5.
  • Due M 2/12: What is the run-time of Prim's algorithm? What assumptions did you make about the underlying data structures you used to get your answer?
  • Due W 2/14: What is the run-time of Kruskal's algorithm? What assumptions did you make about the underlying data structures you used to get your answer?