spring 2001 417-301 course home page

Spring 2001
CSC 417 Section 301, 304
Foundations of Computer Science III

Time:	Thu 5:45 - 9:00 p.m., Loop Campus CS&T CNTR 228
Instructor:	Noriko Tomuro, tomuro@cs.depaul.edu
Office:	CST 648 (Loop)
Phone:	(312) 362-5218 (Loop)
Fax:	(312) 362-6116 (Loop)
Office Hours:	Wed, Thu 4:15-5:45 p.m. (Loop), or by appointment

Class Announcement
- (6/20 wed) Last notes
  1. Final scores & course grades are posted. See 'Received Assignments'.
  2. Finals were pretty good -- the median was 94. I'm glad to see that you all got the concepts very well. Hope you had fun in this class (because I certainly did :-) ).
  3. I'll be around this summer (after mid July), so if you like to talk to me about anything, let me know. Enjoy your summer!
- Advise on course planning for people in the old programs
- Instruction on Fax Submission
- Important Dates (add,drop,withdraw etc.)

Assignments
- Final Exam (due 6/19 tue)
- Homework #5 (due 6/7)
- Homework #4 (due 5/31)
- Homework #3 [comments on Part II]
  - due 5/17 -- Part I (written) & Part II.A ("ht_sc.h")
  - due 5/24 -- Part II.B ("phonelinst.cpp")
- Homework #2 (due 5/3)
- Homework #1 (due 4/19)

Course Notes
- week 11 (6/14): Review for Final WITH ANSWERS
  - Reading: Handout 3 (Context-free Grammars)
- week 10 (6/7): Languages (3), Languages (4)
  - Reading: Johnsonbaugh 10.3, 10.4
- week 9 (5/31): Regular Expressions, [subset construction]
  - Reading: Handout 2 (Regular Expressions), Johnsonbaugh 10.3, 10.4
- week 8 (5/24): Languages (1), Languages (2) [correctness of FSA's]
  - Reading: Johnsonbaugh 10.1, 10.2, 10.5
- week 7 (5/17): more on Graphs, Languages (1)
  - Reading: Handout 1 (MST), Johnsonbaugh 10.1-2
- week 6 (5/10): Midterm, Graphs [correction on DFT]
  - Reading: Weiss 15.1, Johnsonbaugh 6.1-2
- week 5 (5/3): more on Hash Tables, Review for Midterm WITH ANSWERS
  - Reading: Weiss 20, 15.1
- week 4 (4/26): NO CLASS
- week 3 (4/19): B-trees, Hash Tables [proof on QP]
  - Reading: Weiss 19.8, 20
- week 2 (4/12): R&B trees [correction], B-trees [additional explanation]
  - Reading: Weiss 19.5, 19.8
- week 1 (4/5): Review (1), Review (2), AVL trees, R&B trees
  - Reading: Weiss 18, 19.1-4

Links to algorithm applets etc.
- http://www.cs.niu.edu/~zerwekh/graph/Graph.html (graph traversal)
- http://www-cgrl.cs.mcgill.ca/~godfried/teaching/algorithms-web.html#trees (various data structures & algorithms)
- http://swww.ee.uwa.edu.au/~plsd210/ds/ds_ToC.html
- http://www.ececs.uc.edu/~franco/C321/html/RedBlack/redblack.html
- http://www.seanet.com/users/arsen/avltree.html

Repositories of useful information for writing programs.

Code Development Hints
- Bugs in MS VC++ 6.0 (friend functions)
- Separate compilation and typical compilation errors
- Separate compilation using VC++ 5 & 6 for non-template classes

STL
- STL-Compatible Compilers
- STL guides:
  - A Modest STL Tutorial
  - Silicon Graphics Guide to STL -- Downloadable source code

Some Online C++ References
- C++ reference at Microsoft Developer's Network (MSDN)
- C++ FAQ Lite
- Bjarn Stroustrup's home page