(Latest Revision: 11/15/2000)
Week 11 Notes for CS 3100 -- Fall 2000
Monday, November 13
- Take Roll.
- Check out this week's schedule
- Announcement(s)
- I am passing back Exam #2 and the grades are posted.
- No grades out for program #3 yet.
- Final version of program #4 is due Friday.
- Discuss methodology relating to doing program #4 --
differentiation and simplification of expression
trees.
Wednesday, November 15
- Take Roll.
- Check out this week's schedule
- Announcement(s)
- I'm working on grading program #3 -- not
finished yet.
- Final version of program #4 was due Friday,
Nov 17. I'm moving this back to Monday, Nov
20.
- Discussion of algorithm efficiency and sorting (chapter 9)
- Discuss how quick sort can keep the size of
the stack O(log(N)). Look in the Examples
directory for information.
Friday, November 17
- Take Roll.
- Check out this week's schedule
- Announcement(s)
- I made a correction to "DiffAsg" -- I added a
rule -- I think everyone may know about the
rule but let's check: Diff(V) = 0 when V is
the variable with respect to which we
are differentiating.
-
- Discussion of algorithm efficiency and sorting (chapter 9)
- Do big-O analysis of merge sort.
- If time allows, do some discussion of chapter 11
material -- tables, heaps, and priority queues.
- Table as ADT (pp. 518-519)
- Compare implementations: array-based list,
pointer-based list, binary search tree.
- Priority Queue as ADT (pp. 536-537)
- Compare implementations: array-based list,
pointer-based list, binary search tree, heap.
- Heapsort
-