Solutions to Testing Instruments
Quizzes, Written Exams, and Programs


Introduction to Computer Science III
ICS-23: Lecture A/Labs 1-4
Spring 2008



I will turn text into links soon after the due-date of each testing instrument.

When you have submitted your homework, you are only half done. As soon my solutions become available, you should download and study them (also, you should examine your homework when it is returned to you graded). While such activities won't help your grade on the current assignment, you will inevitably learn something by following this process (which will help your grade on subsequent assignments).


Quizzes

Students can benefit greatly by reading these solutions and comparing them to their own. These kinds of problems will most likely show up (in this form or another) on the written exams, so make sure you understand what I am asking for, and understand my solution. If you have any questions, please come by during my office hours so I can award you the points you deserve (if I am wrong) or correct any misconceptions you have about the material (if you are wrong). Also, the first person to e-mail me with any mistake on my quiz solution will get bonus points equivalent to the number of points that I would have taken off for the answer.

Quiz 1: Solution
Quiz 2: Solution
Quiz 3: Solution
Quiz 4: Solution
Quiz 5: Solution
Quiz 6: Solution 1     Solution 2-4
Quiz 7: Not Given
Quiz 8: Solution 1-2     Solution 3


Written Exams

Midterm Exam           : Solution
Final Written Exam    : Solution


Programming Assignments

Students can benefit greatly by reading these solutions and comparing them to their programs. Sometime my code my contain a useful advanced feature that we have not yet covered in class. Other times the correctness may not be obvious because of a subtle interplay between statements. If you have any questions about my code, please come by during my office hours so that we can talk.

Program   1: Implementing Simple Generic Collections (and real iterators) with Linked Lists
Program   2: Programming using Generic Collection Classes: List, Stack, Queue, Priority Queue, Set, and Map
Program   3: Trees: Average Heights and Priority Queues via Max-Heap,
Program   4: Maps via BST and Hash Tables
Program   5: Graphs implemented via Collections and Dijkstra's Algorithm