CS 254, Spring 1995
Accelerated Introduction to Computer Science II
PEXbook@cs.montana.edu (both instructors)
406-994-4780 (work), 586-7614 (home), 994-4376 (Fax)
406-994-4810 (work), 586-4160 (home), 994-4376 (Fax)
- Catalog Description:
5 credits, 2 hours lecture/week, 6 hours lab/week.
Semester taught: Spring, every year.
Prerequisite: CS 252 (Accelerated Introduction to Computer Science I).
This course is intended for graduate students who plan to enter the
computer science graduate program or need an accelerated computer science
course to support their graduate program, and whose undergraduate degree
is outside of computer science.
Covers the material in CS 222, CS 223, CS 225, CS 226, CS 324, and CS 327.
- Room & Time:
Lecture: Thursday, 2--4
Labs: MWF, 2--4
Grading and Requirements:
Midterm Test: 20%
- Schedule Summary
- Detailed Lecture Descriptions:
Introduction to the class.
Review of Data Structures covered in CS 252.
Schedule Summary (1/12/95)
Reading Assignment: Weiss, Chapter 6.
Schedule Summary (1/26/95)
Reading Assignment: Weiss, Chapter 7.
Schedule Summary (2/2/95)
Reading Assignments: Weiss, Chapters 9 and 10.
I will be integrating material from Chapter 10 into the discussions
of specific algorithms in Chapter 9.
E.g., I will use the discussion of Dijkstra's shortest path algorithm
from Chapter 9 to introduce the concept of Greedy Algorithms
from Chapter 10.
A different view of the same material can be found in Gersting, Chapters
6 and 8.
Schedule Summary (2/9/95)
Midterm Test. Open books and notes.
Schedule Summary (3/23/95)
Since the texts do not include material on compiler design, I used
in the class, which are available here.
My favorite text for Compiler Design is
Compilers: Principles, Techniques, and Tools, by
Aho, Sethi, and Ullman.
The LR table used in class came from that book.
Schedule Summary (3/30/95)
Final Exam. Open books and notes. Comprehensive.
Schedule Summary (5/8/95)
Last modified: January 20, 1995