1. BIT 143:Programming & Data Structures in C++
Instructor: Mike Panitz

2. Today Recursion Carrano, Ch 2 D&D 3.12-3.14
Reading for next class: More recursion
BIT 143: Data Structures

3. H O M E W O R K
H O M E W O R K
20-30 minute ‘Monday Night Help’ session?
If you want to hand in 1 or (at most) 2 assignments (or revisions to assignments) past the Nov 30th deadline (penalty-free) that would be ok.
BIT 143: Data Structures

4. H O M E W O R K H O M E W O R K A3 feedback Need to implement one of:
Re-sizable array
(when your queue runs out of space, allocate more & copy the old tickets into it)
Circular Queue
(so that completed tickets are overwritten)
Linked-list based queue
(So your code can continue to add new tasks to the list)
BIT 143: Data Structures

5. Notice that in the syllabus that November 30th, AT THE BEGINNING OF THE LECTURE, is the last point in time at which you can hand something in.
This includes homework assignments, both the first version, and any revisions to any homeworks
So, your due dates can ‘float’ (be delayed without penalty) until the 30th, at which point everything you haven’t done previously, is due.
Homeworks
Homeworks
BIT 143: Data Structures