 | Spring 04 Calendar |
| Midterm #1 - 08:30 - 9:45am, 2/27/04 Room Assignments: Sections 002/004 (Senesy) - KUPF 210 Sections 006/008 (Calvin) - KUPF 203 Section 010 (Ryon) - KUPF 202 Section 102/106 - KUPF 204 Overflow - KUPF 211 |
| Midterm #2 - 08:30 - 9:45am, 4/2/04 Room Assignments: Same as for Midterm 1 unless you went to the wrong room |
| Final Exam - 08:30 - 11:00am, 5/11/04
Room Assignments TBA
|
| Instructor information |
| Tutor availability |
| Programming Project Cover Sheet |
| Week | Dates | Lecture Notes | Reading Assignment | Practice Problems |
| 1 | 1/20-1/26 | C++ Review | ||
| 2 | 1/27-2/2 | Abstraction | Chapter 3 pgs. 121-125 & 131-154 | 1, 5, 7, 8, 9 of chapter 3 |
| 3 | 2/3-2/9 | Recursion | Chapter 2 pgs. 53-79 & 82-101 | 3, 6, 8, 9, 11, 12, 14, 15 of chapter 2 |
| 4 | 2/10-2/16 | Pointer Review, Linked Lists | Chapter 4 pgs. 163-228 | 3, 4, 5, 6, 11, 14 of chapter 4 |
| 5 | 2/17-2/23 | Stacks | Chapter 6 pgs. 273-319 | 8, 9, 10 of chapter 6 |
| 6 | 2/24-3/1 | Queues | Chapter 7 pgs. 331-366 | 2, 3, 6, 8 of chapter 7 |
| 7 | 3/2-3/8 | More Recursion | Chapter 5 pgs. 238-261 | 5, 6, 7, 8, 12, 13, 14, 15 of chapter 5 |
| 8 | 3/9-3/15 | Sorting (part 1) | Chapter 9 pgs. 452-474 | 1, 2, 3, 4, 5, 6, 7, 8 of chapter 9 |
| 9 | 3/16-3/22 | Spring Break | ||
| 10 | 3/23-3/29 | Sorting (part 2) | Chapter 10 pgs. 484-555 | 9, 120, 13-16 of chapter 9 |
| 11 | 3/30-4/5 | Trees | Chapter 11 pgs. 568-609 | 2-7, 17-24 of chapter 10 |
| 12 | 4/6-4/12 | Priority Queues | Chapter 12 pgs. 619-640 | 3-5, 12, 13, 18, 20, 21 of chapter 11 |
| 13 | 4/13-4/19 | Balanced Search Trees | Chapter 12 pgs. 656-682 & 690-712 | 1 (a-d), 2, 4 of chapter 12 |
| 14 | 4/20-4/26 | Hashing | Chapter 13 pgs. 690-712 | 6, 7 of chapter 12 |
| 15 | 4/27-5/3 | Graphing | 1-3, 7, 8, 10, 14 of chapter 13 |
Notes
Slides
prepared by Dr. John Holme
Reading assignments must be completed by the week listed
Practice problems are assigned to help aid comprehension of the material and are
not for turn-in
| Week |
Dates |
Pre-lab Assignment |
Lab Assignment |
| 1 | 1/20-1/26 | Lab 2: plist.h, ptlist.cpp, lab02-ex1.cpp | Lab 1: Logbook ADT |
| 2 | 1/27-2/2 | Lab 3: listarr.h, show3.cpp, lab03-ex1.cpp | Lab 2: PointList ADT |
| 3 | 2/3-2/9 | Lab 4: ordlist.h, listarr2.h, message.dat, search.cpp, show4.cpp, test4.cpp, test4two.cpp, lab04-ex1.cpp | Lab 3: Array List ADT (ex. 1) |
| 4 | 2/10-2/16 | Lab A: stradt.h, strio.cpp, testa.cpp, progsamp.dat | Lab 4: Ordered List ADT (ex. 1) |
| 5 | 2/17-2/23 | Lab 7: listlnk.h, show7.cpp, slides, slideshw.cs, test7.cpp | Lab A: String ADT (ex. 1) |
| 6 | 2/24-3/1 | Lab5: delim.cs, show5.cpp, stackarr.h, stackdwn.h, stacklnk.h, test5.cpp | Lab 7: Singly Linked List ADT (ex. 1) |
| 7 | 3/2-3/8 | Lab 6: test6.cpp, queuelnk.h, show6.cpp, storesim.cs, queuearr.h | Lab 5: Stack ADT (ex. 1) |
| 8 | 3/9-3/15 | Lab 10: listrec.cs, listrec.h, stacklnk.h, test10.cpp | Lab 6: Queue ADT (ex. 1) |
| 9 | 3/16-3/22 |
Spring Break |
Spring Break |
| 10 | 3/23-3/29 | Lab C: search.cpp, sort.cpp, testc.cs, timer.h, timer.hs, timesort.cpp, timesrch.cpp | Lab 10: Recursion w/Linked Lists (ex. 1) |
| 11 | 3/30-4/5 | Lab C: search.cpp, sort.cpp, testc.cs, timer.h, timer.hs, timesort.cpp, timesrch.cpp | Lab C: Performance Eval. (ex. 1) |
| 12 | 4/6-4/12 | Lab 11: accounts, bstree.hs, database.cs, getdbrec.cpp, show11.cpp, test11.cpp | Lab C: Performance Eval. (ex. 2 & 3) |
| 13 | 4/13-4/19 | Lab B: heap.h, heapsort.cs, ossim.cs, ptyqueue.h, showb.cpp, testb.cpp, testbhs.cpp, testbpq.cpp | Lab 11: Linked Binary Search Tree |
| 14 | 4/20-4/26 | Lab 14: hashtbl.h, lab14-ex1.cpp, password, show14.cpp, std-dev, test14.cpp, tst14std.cpp | Lab B: Heap ADT (ex. 1) |
| 15 | 4/27-5/3 | Lab 14: Hash Table ADT |
Notes
You must
complete the pre-lab assignment and bring it with you to the appropriate lab.
Pre-labs are assigned one week prior to the lab to allow time for
completion.
This webpage maintained by S.J. Senesy