|
|
|
|
| mon |
8/11 |
|
Schedule Verification,
Policy Statements, review input stream |
| tue |
8/12 |
|
Ch 19 merge sort,
quicksort, binary search & swap |
| wed |
8/13 |
|
routine of selection
sort. Do review
exercises 19.3, .5, .6, .7, .12, .13 |
| thur |
8/14 |
|
rev ex due |
| fri |
8/15 |
|
pgm 1
proj 19.2 modify
the project by using a timer or threads to control the display
instead of |
|
|
|
a button.
Data set should be at least 100 integers. |
|
|
|
|
| mon |
8/18 |
|
pgm 1 |
| tue |
8/19 |
|
pgm 1 |
| wed |
8/20 |
|
pgm 1 |
| thur |
8/21 |
|
pgm 1 |
| fri |
8/22 |
|
pgm 1 Schram
12 due |
|
|
|
|
| mon |
8/25 |
|
pgm 1 due |
| tue |
8/26 |
|
pgm 2 Using pgm 1 as a basis,
determine the best and worst cases for the data |
|
|
|
sets to be sorted by selection,
merge and quicksort. At
a minimum, consider the |
|
|
|
following cases, nearly sorted
order, random order, nearly sorted in reverse order. |
|
|
|
files provided as 5 digit integers.
verify big O efficencies. |
| wed |
8/27 |
web |
pgm 2 |
| thur |
8/28 |
|
pgm 2 |
| fri |
8/29 |
|
pgm 2 |
|
|
|
|
| mon |
9/1 |
no
school |
| tue |
9/2 |
|
pgm 2 |
| wed |
9/3 |
|
review and pgm 2 due |
| thur |
9/4 |
|
test
ch 19 search and sort |
| fri |
9/5 |
|
Linked lists ch 20 |
|
|
|
|
| mon |
9/8 |
|
Linked lists ch 20 |
| tue |
9/9 |
|
Linked lists ch 20 |
| wed |
9/10 |
web |
Linked lists ch 20 |
| thur |
9/11 |
|
pgm 3 using java
linked list class and java.iterator, construct a linked list and
then construct |
|
|
|
a 2d list from the first that has
the elements in reverse order |
| fri |
9/12 |
|
pgm 3 |
|
|
|
|
| mon |
9/15 |
|
pgm 3 |
| tue |
9/16 |
E Rel |
pgm 4 using java LL
and list iterator, create a linked list that stores strings in |
|
|
|
lexicographical order, rejecting
all duplicates. For
example, a file containing dog Dog Tree tree |
|
|
|
would result in the list containing dog Tree.
print the results |
| wed |
9/17 |
|
pgm 4 |
| thur |
9/18 |
|
pgm 4 |
| fri |
9/19 |
|
pgm 4 due |
|
|
|
|
| mon |
9/22 |
|
pgm 5
create an implementation of a doubly linked list for
characters with at least the following |
|
|
|
methods: default and overloaded
constructors, addFirst, addLast, getFirst, getLast, |
|
|
|
removeFirst, removeLast, size, insertInOrder. Demonstrate
that it functions properly. |
| tue |
9/23 |
|
pgm 5 |
| wed |
9/24 |
|
pgm 5 |
| thur |
9/25 |
|
pgm 5 |
| fri |
9/26 |
|
pgm 5 due Schram
ch 17 and rev ex r20.1, r20.3, r20.5, r20.8, r20.9 due |
|
|
|
|
| mon |
9/29 |
|
pgm 6 ex proj 20.1 polynomial
linked list use the following functions |
|
|
|
f(x) = 3x^2 - 2x + 4
, g(x) =
-5x^4 + 3x^2 - 2x + 7 , h(x)
= 2x^5 - 4x^3 + 7 |
|
|
|
i(x) = 2x - 1 ,
j(x) = 2x + 1 |
|
|
|
find (f+g)(x), (gh)(x), (ij)(x),
(g+h)(x), f ' ,
h ' |
| tue |
9/30 |
|
pgm 6 |
| wed |
10/1 |
web |
pgm 6 |
| thur |
10/2 |
|
pgm 6 |
| fri |
10/3 |
|
review
pgm 6 due |
|
|
|
|
| mon |
10/6 |
|
test
ch 20 linked lists |
| tue |
10/7 |
|
Stacks and queues ch
20 |
| wed |
10/8 |
|
Stacks and queues ch
20 |
| thur |
10/9 |
|
Stacks and queues ch
20 |
| fri |
10/10 |
web |
Stacks and queues ch
20 |
|
|
|
|
| mon |
10/13 |
|
pgm 7
create an implementation of a stack using an arraylist. |
|
|
|
Demonstrate proper functioning of
your push, pop, size, peekTop methods |
| tue |
10/14 |
|
pgm 7 |
| wed |
10/15 |
E Rel |
PSAT |
| thur |
10/16 |
|
pgm 7 |
| fri |
10/17 |
|
pgm 7 due |
|
|
|
|
| mon |
10/20 |
|
pgm 8 ex p20.13 queue as circular
array |
| tue |
10/21 |
|
pgm 8 |
| wed |
10/22 |
web |
pgm 8 |
| thur |
10/23 |
|
pgm 8 |
| fri |
10/24 |
|
pgm 8 due Schram
ch 16 and rev ex r20.4,r20.6, r20.11, r20.12 due |
|
|
|
|
| mon |
10/27 |
|
proj 20.3 algorithm evaluation |
| tue |
10/28 |
|
pgm 9 |
| wed |
10/29 |
web |
pgm 9 |
| thur |
10/30 |
|
pgm 9 |
| fri |
10/31 |
|
pgm 9 |
|
|
|
|
| mon |
11/3 |
|
pgm 9 |
| tue |
11/4 |
No
School |
| wed |
11/5 |
|
pgm 9 due
review |
| thur |
11/6 |
|
test
ch 20 stacks and queues |
| fri |
11/7 |
|
Ch 21 hash sets, hash
maps and priority queues |
|
|
|
|
| mon |
11/10 |
|
hash code |
| tue |
11/11 |
|
pgm 10 ex p21.5 student hash map |
| wed |
11/12 |
web |
pgm 10 |
| thur |
11/13 |
|
pgm 10 |
| fri |
11/14 |
|
pgm 10 due |
|
|
|
|
| mon |
11/17 |
|
pgm 12 er priority queue create a
priority queue for an emergency room.
Patients will be triaged and assigned |
|
|
|
a priority of 1 to 5 where 1 is the
most critical and 5 the least critical.
the queued object |
|
|
|
should contain the priority and name.
The most critical patient will always be seen as soon as |
|
|
|
there is an opening.
If 2 patients have the same priority the time of arrival is
used for admission. |
|
|
|
Demonstrate it works using the
following: tom 2 jane 5
chris 3 (these are in the queue at the start) |
|
|
|
then add mike 1 jill 4 bill 2 jim 1 jake 4 will 2 art 5.
Show the order in which they are processed |
|
|
|
consider treat 1 add 2 treat 1 add
1 treat 1 add 2 treat 1 add 1 treat 1 add 1 continue treating |
| tue |
11/18 |
|
pgm 12 |
| wed |
11/19 |
web |
pgm 12 |
| thur |
11/20 |
|
pgm 12 |
| fri |
11/21 |
|
pgm 12 due |
|
|
|
|
| mon |
11/24 |
Thanksgiving |
| tue |
11/25 |
Thanksgiving |
| wed |
11/26 |
Thanksgiving |
| thur |
11/27 |
Thanksgiving |
| fri |
11/28 |
Thanksgiving |
|
|
|
|
| mon |
12/1 |
|
pgm 13
IntSet Design a
data structure IntSet that can hold a set of |
|
|
|
integers. Hide
the private implementation: a hashSet of Integer objects |
|
|
|
Provide the following methods:
a constructor
to make an empty set, |
|
|
|
add( int x)
to add x if x is not present, remove (int
x) to remove x if |
|
|
|
x is present, print(
) to print all elements currently in the
set, |
|
|
|
an iterator object
that supports only the hasNext()
and next() methods |
|
|
|
the next() returning an int not an
object and 2 additional methods |
|
|
|
IntSet union (IntSet
other) which returns the union of the sets |
|
|
|
IntSet intersection
(IntSet other) which returns the intersection of
the sets |
| tue |
12/2 |
|
pgm 13 |
| wed |
12/3 |
web |
pgm 13 |
| thur |
12/4 |
|
pgm 13 |
| fri |
12/5 |
|
pgm 13 Schram
19 due |
|
|
|
|
| mon |
12/8 |
|
pgm 13 due |
| tue |
12/9 |
|
pgm 14 ex p21.6 sudent
hash set |
| wed |
12/10 |
web |
pgm 14 |
| thur |
12/11 |
|
pgm 14 |
| fri |
12/12 |
|
pgm 14 due |
|
|
|
|
| mon |
12/15 |
|
review |
| tue |
12/16 |
web |
review
no exemptions |
| wed |
12/17 |
|
finals
3 4 5 |
| thur |
12/18 |
|
finals
1,2 |
| fri |
12/19 |
|
finals
6,7 |
|
|
|
|