All below assignments with chapter/problem numbers are for Goodrich. (If you are looking for the Weiss 2e problems to finish your incomplete, look at the 216 link under your programming language off my main page here.)

General Instructions

Make sure you prepare your answers neatly and with a heading that totals your Level efforts. Make the document into a PDF named like the labs and projects: Last-First-Chapter_or_Topic.pdf.

Now follow the general guidelines for sending me a PDF.

Select an assignment for further details...

Portfolio I

Due Thursday of Week by 21:00
Homework NameTopic(s)
Linked Lists single/double & linearly/circularly
Algorithm Analysis analysis and justification techniques
Recursion solving and analyzing algorithms involving recursion
   

You can

Now

Hand

These

in for

Extra Credit

Requirements:

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

       Levels: >= 9

Portfolio II

Due Thursday Tuesday Thursday Tuesday of Week by 21:00
Homework NameTopic(s)
Stacks, Queues, and Deques building it up, lining it up, etc.
Lists with Iterators moving effectively and efficiently
Trees growing it naturally
Heaps and Priority Queues piling it up in a hurry
Hash Tables, Maps, and Skip Lists chop, hop, relate
more from Chapters 5-9/6-10 coming 'soon'?
   

Don't

Forget

to Hand

These

in for

Corrections

Requirements:

       Items: <= 3

       Levels: >= 12

Portfolio III

Due Thursday of Week by 21:00
Homework NameTopic(s)
Search Trees find them
Sorting, Sets, and Selection order them, group them, pick them
Graphs connect them
more from Chapters 10/11, 11/12, and 13/14 coming 'soon'
   

Don't

Forget

to Hand

These

in for

Corrections

Requirements:

       Items: <= ?

       Levels: >= ?