Loyola College in Maryland

CS 301 - Data Structures and Algorithms I
Fall 2003


Loyola College > Department of Computer Science > CS 301 > Homework
Homework Due Date Assignment Solutions
1 9/10/2003 html
2 9/12/2003 html
Practice 1 NA html Solutions
3 9/17/2003 snippet code Testing Doc Document solution code
4 9/22/2003 html Solutions
5 9/24/2003 html Solutions
6 9/26/2003 html Solutions
7 9/29/2003 html Solutions
Midterm Review 10/1/2003 html Solutions
8 10/8/2003 html Solutions
9 10/10/2003 html Solutions
10 10/14/2003 5.5, p 328 Solutions
11 10/20/2003 5.15, 5.16, & 5.17, p 331 Solutions
12 10/22/2003 5.12a, 5.12b, & 6.4 Solutions
13 10/24/2003 6.10 & 6.12 Solutions
14 10/27/2003 html Solutions
15 10/31/2003 7.7, & 7.17 Solutions
16 11/3/2003 7.11 Solutions
Extra NA Recursion Practice
17 11/7/2003 html Solutions
Midterm Review 11/11/2003 html Solutions
18 11/14/2003 8.34, 8.39, 8.40 Solutions
19 11/17/2003 8.18, 8.21 Solutions
20 11/19/2003 9.4, 9.8 Solutions
21 11/19/2003 9.8b&c*, 10.1 Solutions
22 11/19/2003 10.2, 10.3 Solutions
23 12/3/2003 10.34, 10.35 Solutions
24 12/5/2003 10.29, 10.30, 10.32 Solutions
25 NA 9.12, 9.13, 9.14 Solutions
Practice Final NA html Solutions
*9.8 is assigned again to give you a second chance at solving this problem, if you didn't get it the first time. Part b wants you to write push and pop using PQType methods. For Part c, you have two versions of push and pop. Compare the running time of push using a PQType methods to the version in chapter 4. Do the same for pop.