Lecture material

This web page contains links to material that I presented in lectures during previous terms that I have taught this course. It also contains some lecture notes that another instructor used during a previous term. The lecture material from previous terms is somewhat similar to what is being presented during the Summer 2001 term (the biggest change is that we now use a Book class example, rather than a WashingMachine example). If you print these notes in advance, it may simplify the note-taking process for you during lectures. Please note that for each week, the newer material that will be presented this term is listed first, followed by a blank line, and then the notes from the other instructor.

The notes that the other instructor presented during previous terms are available in PostScript format only. A PostScript viewer is installed on the CDF-PC computers, or you can download a free Postscript viewer (called Ghostscript) that will allow you to view the lecture notes from home. To download Ghostview for a home PC running Windows 95/98, go to the "MS-Windows" section of the Ghostscript 7.00 download page and download the gs700w32.exe and gsv40w32.exe installation programs.

Week 1

• Lecture Outline and Announcements
• Objects vs Classes
• A complete program
• The Book class: the first try
• Memory model introduction
• CodeWarrior software Overview:
  • CodeWarrior General Guide - how to create a HelloWorld.java program in CodeWarrior
  • CodeWarrior Quiz 2 Guide - how to download take-home quiz 2 from the web page and include it in CodeWarrior. Here is a simple Java program that you could practice with as well: TutorialOne.java.
  • How to create test output - how to capture output and print it
  
  
  
• Fig 1.0 myWashingMachine: a reference to an object.
• Fig 1.1 The programming process.
• Fig 1.2 First version of the washing-machine program.
• Fig 1.3 Outline for the WashingMachine class.
• Fig 2.0 Second version of the washing machine program

Week 2

• Lecture Outline and Announcements
• A variable can only have one value
• Return values
• More than one object
• Constructors
• Sports Car Example
  
  
• Washing Machine Class example 1.
• Washing Machine Class example 2.
• Fig 2.1 An analogy: mathematical functions vs. Java methods.
• Fig 4.0 Variables in Java.
• Fig 4.1 Variables continued - set value before use.
• Fig 4.2 Return values in methods.
• Fig 4.3 More than one object.
  
  
• Tracing Code: The Memory Model (in PDF) by Michelle Craig
• Tracing Code: The Memory Model (in PostScript) by Michelle Craig
• Java Memory Model (in PostScript) by Alberto Mendelzon
• The Memory Model Rules by Paul Gries

Week 3

• Lecture Outline and Announcements
• CD Collection Example
• String s = "hi";
• Input
• File Input and Output
• String examples
• Memory Model review example #1
• Memory Model review example #2
  
  
• Fig 2.2 String s = "Hello World!";
• Fig 3.0 Some examples of String methods.
• Fig 3.1 Some examples of assignment statements.
• Fig 5.0 Program input/output, and the JVM.
• Fig 5.1 Program input via System.in.

Week 4

• Lecture Outline and Announcements
• this Example
• Static - Book Class
• Static - Input
• Another static example (will cover if time)
  
  
• Review: Static variables and methods
• Fig 5.2 A first look at static.
• Fig 5.3 The basic Java data types.
• Fig 6.0 Variables of primitive type. - this slide fixed Feb 2001
• Fig 6.1 Some examples using primitive types.
• Fig 6.2 Automatic type conversion.

Week 5

• Lecture Outline and Announcements
• Conditional Statements
• toString() Method
• Name class example 1
• Name class example 2
  
  
• Final version of Student class
• Fig 7.3 Building a class to represent students
• Fig 7.4 The Student class continued
• Fig 7.5 Student st1 = new Student()
• Fig 8.1 toString() revisited.

Week 6

• Lecture Outline and Announcements
• Objects vs Primitive Data Types
• Method Parameters
• Comparing objects
• Information Hiding Example
• Name class example 3 - static review
• Midterm Review
  
  
• Review: Parameter passing
• Fig 8.2 Variables of class type vs. primitive type.
• Fig 8.3 Method parameters.
• Fig 8.4 Method parameters (continued).
• Fig 8.5 Comparing objects.
• Fig 9.0 Comparing Strings.
• Fig 7.3 Building a class to represent students. - information hiding
• Fig 7.4 The Student class continued.
• Fig 7.5 Student stu1 = new Student();
• Fig 8.0 Constructors revisited.

Week 7

• Lecture Outline and Announcements
• Loop to add five numbers
• Loop Patterns (schemas)
• Complete program for string reversal
  
  
• For loop example program
• Fig 6.3 A first look at loops.
• Fig 7.0 Summary of statement types so far.
• Fig 7.1 Two new statements: if and break
• Fig 7.2 Another example: string reversal

Week 8

• Lecture Outline and Announcements
• Loop Review - Replace 'e' Example
• Program Testing
• Programming Style
• Loop Review - Student Example
• Loop Review - Most J's line
  
  
• Commenting Notes -- by Paul Gries

Week 9

• Lecture Outline and Announcements
• Palindrome - Loop Review
• Wrapper Classes
• Book class with no Vector
• Book class with Vector
• Vector to print middle line of input
• Vector of Vector (same example without enumeration)
• Vector of Vector
  
  
• Fig 9.1 A first look at Vectors.
• Fig 9.2 The Vector class.
• Fig 9.3 The WashingMachine class with a Vector.
• Fig 9.4 Some rules about Vectors.
• Vector of Vector
• Vector of Objects containing Vector
• Fig 10.0 Wrapper classes.
• Fig 10.1 Processing a Vector.
• Fig 10.2 Some useful Vector methods.

Week 10

• Lecture Outline and Announcements
• Working with Arrays
• Array Example - Statistics (soln)
• 2D Array Example - Matrix Transpose
• 2D Array Example - Print Lower Triangle
• Some array humour :-)
  
  
• Transpose Matrix - 2D Array Example
• Fig 11.0 A first look at Arrays.
• Fig 11.1 The median example (continued).
• Fig 11.2 Some rules about Arrays.
• Fig 12.0 The median example, completed.
• Fig 12.1 The parameters of main().
• Fig 12.2 Two-dimensional arrays.
• Fig 12.3 Arrays vs. Vectors.

Week 11

• Lecture Outline and Announcements
• Overloading constructors and methods
• Class Hierarchy Diagram
• Inheritance Example
• Super
• Polymorphism
• The instanceof operator
• Inheritance - protected modifier
  
  
• Inheritance notes
• Multiple Inheritance?
• Fig 13.0 Overloading revisited.
• Fig 13.1 Method overloading.
• Fig 13.2 A first look at Inheritance.
• Fig 14.0 The Mark class continued.
• Fig 14.1 Superclass extended by subclasses.
• Fig 14.2 The marks example, completed.
• Fig 15.0 Another inheritance example.
• Fig 15.1 Student extends Person.
• Fig 15.2 What is Polymorphism?
• Fig 15.3 The class Object.
• Fig 16.0 Object-orientedness - a review.
• Fig 16.1 OO review, continued.
• Fig 16.2 The instanceof operator.
• Fig 16.3 Abstract classes.
• Overloading, Inheritance (9 pages)

Week 12

• Lecture Outline and Announcements
• Complexity, Linear Search, Binary Search, Big-Oh
  
  
• Fig 19.0 Choosing an algorithm.
• Fig 19.1 Measuring the speed of an algorithm.
• Fig 19.2 The speed of counting sort.
• Fig 19.3 Conclusions from the timing.
• Fig 20.0 A simpler problem - searching.
• Fig 20.1 The speed of linear search.
• Fig 20.2 Another way of searching - binary search.

Week 13

• Lecture Outline and Announcements
• Sorting
  
  
• Fig 17.0 Sorting - by hand vs. computer.
• Fig 17.1 A first sorting algorithm.
• Fig 17.2 Sorting non-ints.
• Fig 17.3 Sorting non-ints (continued).
• Fig 18.0 Interfaces in Java. (not covered)
• Fig 18.1 Using an interface.
• Fig 18.2 Fixing the bug in sort().
• Fig 18.3 Another way of sorting - bubble sort.

[ CSC108 Home | Outline | Announcements | Assignments | Exams | Lectures |
Tutorials | Office Hours | Marks | Forms | Links ]

---

© Copyright 2001. All Rights Reserved.