|
Date |
Lecture Chapters |
Topic |
Assignments and Tests Each assignment is worth 7%. Each exam is worth 20%. You can make extra credit by implementing more than 6 projects |
|
8/25 |
9,10 |
Intro, Simple list (array) structure, records - use your book as a reference |
-- |
|
9/8 |
11 pg.442-448 |
Queues - use your book as a reference |
|
| 8/15 |
11 pg.427-437 |
Stacks - use your book as a reference Postfix Additional postfix resource: http://www.spsu.edu/cs/faculty/bbrown/web_lectures/postfix/ Try animated evaluations - it should help you with postfix program. (Skip last paragraph "Understanding Tanebaum") |
|
|
9/22 |
13 |
Recursion Simple intro http://www.cs.usask.ca/resources/tutorials/csconcepts/1998_4/recursion.html Fibonacci numbers and recursion http://www.ics.uci.edu/~eppstein/161/960109.html (don't have to read all of it, look at: "The Fibonacci numbers" and "Recursive algorithm" paragraphs - code is not in Pascal, but easy to understand; also look at the "recursive tree" - try to draw it for F6 Make sure you read Hanoi tower case study in the book |
Hint: Analyze Balanced Parentheses programming example in your book
|
| 9/29 |
15.1 569-580 |
Algorithm analysis Big O notation resource: |
Postfix evaluation |
|
10/6 |
15.3 |
Quicksort - use book as a reference Test 1 review |
The key here is to figure out how to do the indentation (hint - an additional variable that you pass in the recursive call that signifies the depth of recursion - and then use it in writeln statement for formatting)
|
| 10/13 | Test 1 | ||
|
10/20 |
|
Heapsort Heapsort description: http://en.wikipedia.org/wiki/Heapsort note that "pseudo code" is very close to pascal implementation Nice visual representation: http://www.inf.fh-flensburg.de/lang/algorithmen/sortieren/heap/heapen.htm (however implementation is in Java) |
|
|
10/27 |
15.2 |
Searching (linear, binary, hashing) - use your book as reference |
|
| 11/3 |
16.1, 16.3 |
Dynamic data structures (pointers) - use your book as reference (skip mark and release paragraph) More references: http://www.geocities.com/SiliconValley/Park/3230/pas/pasl2001.html |
|
|
11/10 |
16.2 |
Linked lists singly linked lists - use your book as reference doubly linked lists: http://www.geocities.com/SiliconValley/Park/3230/pas/pasl2003.html |
|
|
11/17 |
16.4 |
Finish linked lists, Binary trees More references: http://www.geocities.com/SiliconValley/Park/3230/pas/pasl2004.html Particular references to tree traversals: |
|
|
11/24 |
|
Binary trees (2), Test 2 review |
|
|
12/1 |
Test 2 |
Tree height hint - recursion similar to tree generation and search |
|
|
12/8 |
|
Final |
Take home final due, all assignments due, no exception |