General Course Materials
|
Books
Required: Problem Solving with Algorithms and Data Structure using Python, Bradley Miller and David Ranum, ISBN 1-59028-053-9 |
| Python Tutorial
|
|
Old Quizzes from Fall 2006
|
Book Site with Errata and Source
Code
|
Other Useful
Links
|
Working Schedule
|
| Date | Description | Readings | Work Due |
| Mon., Sept. 1 | Class Into & Python | N/A | N/A |
| Chapter 1, pp1-34 | Class survey | ||
| Fri., Sept. 5 |
Abstract Data Types |
Chapter 1 |
HW: Class for complex numbers |
| Mon., Sept. 8 |
Finish ADT & Start Recursion |
Wikipedia entry on Abstract Data Types & Unified Modeling Language | HW: Formal ADT for Boolean |
| Wed., Sept. 10 |
Recursion HW, Recursions |
Chapter 3 |
HW: P126:1,2,4 |
| Fri., Sept. 12 |
Recursion |
Chapter 3 |
N/A |
| Mon., Sept. 15 |
Analysis of Algorithms morerecursion.py |
Chapter 4 to p136 | HW: P126:3 (Counts double) |
| Wed., Sept. 17 |
Analysis of Algorithms |
Chapter 4 to p141 | HW: Write an anagram program |
| Fri., Sept. 19 | Finish Analysis of Algorithms solution |
Chapter 2 | HW: Rewrite exhaustive program recursively |
| Mon., Sept. 22 | Stacks |
Chapter 2 | N/A |
| Wed., Sept. 24 | Stacks base, tailRecursion |
Chapter 2 | Modify 2.4 for a code file |
|
Fri.,
Sept. 26 |
Queues & Deques | Chapter 2 | HW: P94: 2-5; |
| Mon., Sept. 29 | Bring Questions Review |
HW: P96: 9 | |
|
Wed.,
Oct. 1 |
Test 1 |
||
| Fri., Oct. 3 |
Over Test, Linked Lists | Section 7.2 | N/A |
| Mon., Oct. 6 |
Linked List |
Chapter 7.2 | Play with linked lists, but nothing to turn in. |
| Wed., Oct. 8 |
List Traversals array.py, chap7Delta.py |
Chapter 7.2 | Combine code from chapter 7 into one file to play with, but nothing to turn in. |
| Fri., Oct. 10 |
Searching C7SQD.py, arrayStack.py |
Chapter 4 | Matrix ADT |
| Mon., Oct. 13 |
Hash Tables | Chapter 4 | Extend Linked List Class via Inheritance for 1. queues (assigned) and 2. deques (extra credit) |
| Wed., Oct. 15 |
Sorting | Chapter 4 | Fix Listing 7.7 to check if item is on the list Problem 2, P181 |
| Fri., Oct. 17 |
Sorting | Chapter 4 | Project 2A |
| Mon., Oct. 20 |
Review | N/A | Project
2B (Due Noon Tuesday) |
| Wed., Oct. 22 |
Test 2 |
||
| Fri., Oct. 24 |
Academic Holiday |
||
| Mon., Oct. 27 |
Over Quiz Start Trees, Tree ADTs |
Chapter 5 | N/A |
| Wed.,
Oct. 29 |
Trees Representations | Chapter 5 | N/A |
| Fri.,
Oct. 31 |
Parse Trees & Tree Traversals | Chapter 5 | p233: 1, 2 (not collected) |
| Mon., Nov. 3 |
Parse Trees Revisited, Binary Search Trees | Chapter 5 | N/A |
| Wed., Nov. 5 | Heap Trees, Start Skip Lists |
Chapter 5 Sections 7.4, 7.5 |
Sorting Project |
| Fri., Nov. 7 |
Skip Lists, Images, Tree Rotations, AVL Trees | Sections 7.4, 7.5 |
For the data: 5,1,9,3,7,2,4,8 a) Show the BST & heap tree b) Show each after deleting 7 c) Show each after deleting 1 |
| Mon., Nov. 10 |
Start Graphs | Chapter 6 |
For the data: 5,1,9,3,7,2,4,8 using the BST a) show rotating root with left subtree b) show rotating root with right subtree |
| Wed., Nov. 12 | Graph Applications | Chapter
6 |
P279: 1,2 |
| Fri., Nov. 14 |
NO CLASS TODAY | N/A |
N/A |
| Mon., Nov. 17 |
Graph Applications | Chapter
6 |
Tree-sort Project |
| Wed., Nov. 19 | Review | N/A |
P279: 3,4 |
| Fri., Nov. 21 |
Test 3 |
||
| Mon., Nov. 24 |
Over test Pattern matching |
Section 7.6 |
N/A |
| Wed., Nov. 26 |
Thanksgiving Holidays |
||
| Fri., Nov. 28 |
|||
| Mon., Dec. 3 |
Pattern matching | Section 7.6 |
N/A |
| Wed., Dec. 5 | Intractable Problems | N/A | Hamiltonian Path Problem Test Data |
| Fri., Dec. 8 |
Review | N/A | N/A |
|
Thurs., Dec. 11 9:00 AM |
Final Examination |
||
This page was created by
Joe Sloan.
It was last modified around:
7 November 2008
Send mail to: sloanjd@wofford.edu