CS2 Lecture Notes

This page keeps a record of the lecture notes that have been issued so far in the course. The relevant files will be placed in the appropriate place within one week of each lecture. Please do not report broken links before this.

CS2Ah

• Lecture schedule ( pdf )

• Computer Systems
  1. Computer systems - introduction ( pdf, slides )
     Note 1a. Some MIPS instructions ( pdf )
     
  2. Instructions that operate on data ( pdf, slides )
     
  3. More data types, and control transfers ( pdf, slides )
     
  4. Exceptions ( pdf, slides )
     
  5. Managing the processor ( pdf, slides )
     
  6. Managing the memory 1 ( pdf, slides )
     
  7. Managing the memory 2 ( pdf, slides )
     
  8. I/O Controllers ( pdf, slides )
     
  9. Direct Memory Access ( pdf, slides )
     
  10. Combinational Logic Circuits ( pdf, slides )
      
  11. Sequential Logic Circuits ( pdf, slides )
      
  12. More on the processor ( pdf, slides )
      
  13. Pipelined processors ( pdf, slides )
      

• Language Processing
  1. Languages and finite automata (pdf, slides)
  2. Regular languages (pdf, slides)
  3. Nondeterministic finite automata (pdf, slides)
  4. Regular expressions and Kleene's Theorem (pdf, slides)
  5. Operations and algorithms for regular languages (pdf, slides)
  6. Pattern matching (pdf, slides)
  7. What is Language Processing?
     Example - A Language for Electrical Circuits with Java source code.
  8. Formal Grammars
  9. Top-Down Parsing
  10. Analysis of Grammars
  11. Table-Driven Predictive Parsers
  12. Automatic Generation of Lexers and Parsers with worked example.

• Software Engineering
  1. Software Engineering and Software Engineers ( pdf, slides )
  2. Workflows in the RUP ( pdf, slides )
  3. Project Management in the RUP ( pdf, slides )
  4. Analysis and Design in the RUP ( pdf, slides )
  5. Implementation and Test in the RUP ( pdf, slides-a , slides-b )
  6. An RUP Case Study ( slides )
  7. An RUP Case Study -- Continued ( slides )
  8. Software Design for Reuse ( pdf, slides )

CS2Bh

• Lecture schedule ( pdf )

• Algorithms and Data Structures
  1. Analysing Algorithms ( Lecture Notes, Slides, JAR archive with example test application)
  2. Asymptotic Growth Rates and the Big-Oh Notation ( Lecture Notes, Slides)
  3. Sequential Data Structures ( Lecture Notes, Slides)
  4. Hash Tables ( Lecture Notes, Slides)
  5. Balanced Search Trees ( Lecture Notes, Slides)
  6. Priority Queues and Heaps ( Lecture Notes, Slides, JAVA implementation of heaps)
  7. Mergesort and the Divide-and-Conquer Technique ( Lecture Notes, Slides)
  8. Heapsort and Quicksort ( Lecture Notes, Slides, JAVA implementation of sorting algorithms)
  9. Graphs ( Lecture Notes, Slides, JAVA implementation)
  10. Depth-First Search and Topological Sorting ( Lecture Notes, Slides)
  11. Breadth-First Search and Shortest Paths ( Lecture Notes, Slides)

  Corrections for the ADS Lecture Notes.

• Current Technologies
  1. Relational Database Systems (pdf: slides, notes)
  2. SQL Programming Basics (pdf: slides, notes)
  3. SQL: Joins and Subqueries (pdf: slides, notes)
  4. SQL: Views and Update (pdf: slides, notes)
  5. Data Modelling and Design (pdf: slides, notes)
  6. Core Web Technologies: TCP/IP, DNS & Bind, HTTP ( notes )
  7. What's in a Web Page: HTML, GIF, PNG etc. ( notes )
  8. The Separation of Form from Content: SGML and XML ( notes )
  9. Style for the Web: CSS and XSL ( notes )
  10. XML at Work: XML Linking, XML Schemas, XML Databinding ( notes )

• Advanced Programming in Java
  1. Objects and Classes
  2. Packages and Inheritance
  3. Strings, Input and Output
  4. Concurrent Programming
  5. Managing Concurrency
  6. Collections in Java
  7. Visiting a Datastructure
  8. Swing: GUI building in Java (Code for the Counter examples)
  9. Nested and Inner Classes (Code samples)
  10. Proving Programs Correct

  Answers to some exercises.