All below assignments are from the Goodrich book. (If you are looking for the old Weiss 2e questions to complete your incomplete, look at the 216 link under your programming language off my main page here.)

Select an assignment for further details...

Portfolio I

Due Thursday of Week by 21:00
Problem # C++Problem # JavaNotesLevel
P-3.2P-3.36 that's a class and a driver, of course
and by arbitrary, he means of any shape
3
P-3.3P-3.37 you'll also have to update the constructor and destructor and add a node class 3
P-3.4P-3.38 see notes on P-3.3/P-3.37 above 4
P-3.5P-3.38 but use a linked list that is both circularly and doubly linked explain how this helped for this particular situation 4
P-4.1P-4.60 any visualization software will do; just make the results into a PDF 3
P-4.2P-4.61 any visualization software will do; just make the results into a PDF 3
P-4.3P-4.62 any visualization software will do; just make the results into a PDF 2
P-4.4P-4.63 any visualization software will do; just make the results into a PDF
C++ students only do the non-recursive algorithms
3
C-3.15C-5.15 recursion 4
C-3.18C-5.20 recursion 3
P-3.8P-5.30 recursion 4
C-4.5C-5.22 recursion 4
  

You can

Now

Hand

These

in for

Extra Credit

Requirements:

       Items: <= 3 (try to spread them out...)

       Levels: >= 10

Portfolio II

Due Thursday of Week by 21:00
Problem # C++Problem # JavaNotesLevel
P-5.11P-6.36 do not change the input format except to allow "share" to agree with its noun 2.5
P-5.12P-6.35 2
P-6.3 P-7.61 he's considering the cursor to be in front of a character rather than at a character
don't forget to let them quit, too!
3
Option: add two more commands to load and save the text from/to a file 2
P-7.3
P-7.4
P-8.61
P-8.62
choose one or the other 2
Option: do both and write a short — 1-2 pages — paper detailing their differences 2
P-7.5
P-7.6
P-8.69
P-8.70
choose one or the other 3
Option: do both and write a short — 1-2 pages — paper detailing their differences 2
P-7.10 P-8.65 minimal operations to include are +, -, *, /, % (call fmod if using double values in C++), and parentheses to alter precedence; but not the "For an additional challenge..." (see the projects..!)
to test your tree, you can design them by hand in the code this time; parsing is a bit harder and worth more here're some links to help you get started
4
Option: write a token stream level parser
this would take a stream of tokens like operators and numbers and parentheses and turn it into a tree
1
Option: write a lexer for expressions
this would take an expression typed by the user and turn it into either a tree directly or a token stream for the above option to parse; here're some links to help you get started
1.5
Option: use an iterator class for your expression tree 1
P-8.4P-9.50 2
P-8.7P-9.55 2
P-8.6P-9.54 do not change the input format except to allow "share" to agree with its noun 2.5
C-8.23P-9.56 implementation time! 3
C-9.2P-10.73 implementation time! 3
P-9.6 P-10.71 C++ students: you'll need to implement a skip list, too 4
Option: do the follow-up problem: P-9.7/P-10.72 5
more from chapters 5-9/6-10 coming 'soon'?
  

Don't

Forget

to Hand

These

in for

Corrections

Requirements:

       Items: <= 3

       Levels: >= 9


Portfolio III

Due Thursday of Week by 21:00
Problem # C++Problem # JavaNotesLevel
C-10.21P-11.63 implementation time! 3
P-10.1P-11.64 3
P-10.4P-11.59 Java students use an AVL tree 2
P-11.1P-12.66 1
P-11.2P-12.60 1
P-11.3P-12.64 2
P-11.4-6P-12.61-3 2
P-13.1P-14.73 2.5
P-13.2P-14.75 2.5
P-13.3P-14.74 2.5
P-13.8P-14.77 3
P-13.11P-14.78 2.5
P-13.12P-14.79 3
P-13.14P-14.81 4
more from chapters 10/11, 11/12, and 13/14 coming 'soon'
  

Don't

Forget

to Hand

These

in for

Corrections

Requirements:

       Items: <= ?

       Levels: >= ?