CS 254, Spring 1995
Accelerated Introduction to Computer Science II

Denbigh Starkey & Ray Babcock

PEXbook@cs.montana.edu (both instructors)

starkey@cs.montana.edu
406-994-4780 (work), 586-7614 (home), 994-4376 (Fax)

babcock@cs.montana.edu
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:
  Roberts 410
  Lecture: Thursday, 2--4
  Labs: MWF, 2--4

  ---

• Required Newsgroups:
  msu.cs.class.cs254
  news.announce.important

  ---

• Grading and Requirements:
  Midterm Test: 20%
  Final: 30%
  Lab/Programs: 50%

---

• Schedule Summary
  • January 12: Review of Data Structures (Babcock)

    ---

  • January 19: Review of Data Structures (Babcock)

    ---

  • January 26: Priority Queues/Heaps (Babcock)

    ---

  • February 2: Sorting Algorithms (Babcock)

    ---

  • February 9: Graph Algorithms (Starkey)

    ---

  • February 16: Graph Algorithms (Starkey)

    ---

  • February 23: Graph Algorithms (Starkey) and BNCT Research Presentation (Babcock & Starkey)

    ---

  • March 2: Dr. Cimikowski's & Dr. Harkin's Research Presentations

    ---

  • March 9: Dr. Paxton's & Dr. Ross' Research Presentations

    ---

  • March 16: Spring Break

    ---

  • March 23: Midterm Test

    ---

  • March 30: Compiler Design (JDS)

    ---

  • April 6: Attend seminars by Jean-Louis and Catherine Lassez

    ---

  • April 13: Networks (RSB)

    ---

  • April 20: Operating Systems (RSB)

    ---

  • April 27: Operating Systems (RSB)

    ---

  • May 4: TBA

    ---

  • May 8: Final Exam: 12:00-1:50 p.m., Roberts 412

  ---

• Detailed Lecture Descriptions:
  • January 12--19: Introduction to the class.
    Review of Data Structures covered in CS 252.
    Schedule Summary (1/12/95)

    ---

  • January 26: Priority Queues/Heaps.
    Reading Assignment: Weiss, Chapter 6.
    Schedule Summary (1/26/95)

    ---

  • February 2: Sorting Algorithms.
    Reading Assignment: Weiss, Chapter 7.
    Schedule Summary (2/2/95)

    ---

  • February 9--21: Graph Algorithms.
    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)

    ---

  • March 23: Midterm Test. Open books and notes.
    Schedule Summary (3/23/95)

    ---

  • March 30: Compiler Design.
    Since the texts do not include material on compiler design, I used detailed transparancies 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)

    ---

  • May 8: Final Exam. Open books and notes. Comprehensive.
    Schedule Summary (5/8/95)

    ---