Lectures

There are no lectures for the COMPSCI 105 SS course in 2008. The resources below are included as study resources.

Lectures notes and other handouts can be found below.
You should augment your lectures by reading the course textbook

Lecture materials

Lecture 1 - Introduction, Arrays

Lecture 2 - Multi-dimensional Arrays

• Game of life zip file (with source code)
• Game of life zip file (version shown in lectures)

Lecture 3 - Exceptions

Lecture 4 - Exceptions

Lecture 5 - File IO (Reading)

Lecture 6 - File IO (Writing)

Lecture 7 - Recursion

• Additional notes on recursion

Lecture 8 - Using Recursion

• Recursive Curves Application

Lecture 9 - Performance Analysis

• Additional notes on performance analysis

Lecture 10 - Sorting

• Additional notes on sorting
• Interactive BubbleSort demonstration
• Interactive InsertionSort demonstration
• Interactive SelectionSort demonstration

Lecture 11 - Sorting

• Interactive BubbleSort demonstration
• Interactive MergeSort demonstration

Lecture 12 - Sorting

• Interactive QuickSort demonstration

Lecture 13 - ADTs and Java interfaces

• Lecture 13 programs

Lecture 14 - Linked lists, the Node class

• Lecture 14 programs

Lecture 15 - Referenced-based List implementations

• Lecture 15 programs

Lecture 16 - Comparing List implementations, the Java Collections Framework

• Lecture 16 programs

Lecture 17 - ADT Stack and 3 implementations

• Lecture 17 programs

Lecture 18 - Stack arithmetic and ADT Queue

• Lecture 18 programs

Lecture 19 - Queues and Tables

• Lecture 19 programs

Lecture 20 - Binary Trees

• Lecture 20 programs

Lecture 21 - Binary Search Trees

• Lecture 21 programs

Lecture 22 - Balanced Trees

Lecture 23 - Priority Queues and Heaps

• Lecture 23 programs

Lecture 24 - Hash tables and exam outline