Ensure you have all of the "standard" material: MCS 820 Module, rev 0197, and the 4 required texts (Computer Algorithms along with the 3 MCS 810 texts). You will be using various systems environments provided at CUW (so you don't need to locate these resources on your own!).
 
BTW, the burks on-line CD collection has a number of useful CS tools. Visit their site at http://burks.bton.ac.uk

PRIOR TO JUNE 21 (prior to arriving on campus)

1. Complete all Unit I (Framework) assignments (assignments 2, 3, 4, and 5)

Assignment #1 (no need to call me :-)
Assignment #2 – ensure you have the second edition of Great Ideas in Computer Science.
  Solve the "post correspondence" problems #4 and #5 on page 48 (correction from module)
Assignment #3 – ensure you have the fifth edition of Computer Science: An Overview.
  Solve problems #3, page 133; #1, page 146; and #3, page 177 (corection from module)
Assignment #4 – do only 1 problem (rather than 2) for this assignment.
Assignment #5 - keep your document to a maximum of 2 double-spaced pages.

2. Thoroughly read through chapter 5 in the primary text  Computer Algorithms

3. Complete as much of Unit II as needed .... assignments done before arriving on campus mean more free time in the evening :-)  I'd suggest looking at each problem in Unit II and outlining a solution which can then be expanded after class discussion.

TENTATIVE SCHEDULE

Class will begin at 8:30am each day, Monday - Friday.
Lunch will be from 11:30am - 1:00pm each day, M - F.
Class will end at 3:30pm each day, Monday - Friday.

Prepare for each day by completing the readings prior to the discussion -- come to class armed with any questions.

Class will be held in S118B (Stuenkel Hall)

 Monday, June 21

- All Unit I homework assignments are due
- Review of Unit I concepts
I. Introduction
A. Science of Algorithms
B. Analyzing Algorithms and their associated Problems

C. Classification of Algorithms via Order
D. Searching Algorithms
E. Example: Fibbonacci
II. Sorting

Tuesday, June 22

A. MaxSort
B. BubbleSort
C. Insertion Sort
D. QuickSort

III. Selection
A. k=1 or n
B. k =1 and n
C. Adversary arguments
D. kth largest

Wednesday, June 23

IV. Graphs
A. Shortest Path
B. Traveling Salesperson

- Chapel @ 10am with Dr. Wayne Braun
- MCS 890 Presentation: Mr. Mark Van Donsel, M.S.
- Lunch in Dinning Hall
- InvesRisk demo

C. Greedy approach
D. Backtracking approach

Thursday, June 24

V. String matching
A. Straightforward
B. Finite Automata
C. KMP

- MCS 890 Presentation: Ms. Ann Carter, M.S.
- Lunch at Chancery

VI. Intractability: Theory of NP
A. Intractability
B. General categories of problems
C. Theory of NP

Friday, June 25

C. Theory of NP (cont)

VII. Computer Science
A. Science
B. Computer Science

Final Exam