CSCI 2010U: Principles of Computer Science

University of Ontario Institute of Technology

Lectures

• Lecture 1: Introduction to Java I
• Lecture 2: Introduction to Java II
• Lecture 3: Data and Expressions
• Lectures 4 & 5: Basic Java Programming
• Lecture 6: Arrays
• Lecture 7: Generics
• Lecture 8: Inheritance
• Lecture 9: Packages
• Lecture 10, 11 & 12: Linked List
• Lecture 13-14: Sorting Linked List
• Lecture 15: Sorting Algorithms
• Lecture 16: Search Algorithms
• Lectures 17-18: Binary Tree
• Lecture 19: AVL Tree
• Lecture 20: Hash Table


[Note: lecture slides will be added the night before each class. The source code for exercises covered in class will be added by the next day.]

LECTURE 1: Introduction to Java I

Overview of course content, structure and marking scheme. Java programming is introduced.

Slides: [PDF]

Readings:

• Java Foundations, Chapter 1

LECTURE 2: Introduction to Java II

Java programming introduction is continued. We learn how to compile and run our first program from the command-line and in the Eclipse IDE. We will also informally cover basic object-oriented concepts and language features of Java. These concepts and features will be covered more formally in Lecture 3.

Slides: [PDF]

Exercises:

• FirstProgram.java, Triangle.java - our first example of a Java program. In this example, FirstProgram contains our main method which creates Triangle objects.

References/Links:

• Compiling & Running a Java Program
• Eclipse IDE - download the Eclipse IDE for Java Developers

LECTURE 3: Data and Expressions

Java programming introduction is continued. We will formally review data and expressions in the Java programming language.

Slides: [PDF]

Exercises:

• ArithmeticExample.java - This example covers how arithmetic operators (like division) work when different data types are involved (like int and float). This example also demonstrates the difference in using the increments (++) operator as a prefix and postfix.
• ScannerExample.java - This example shows how we can use the Scanner class to easily read in data from the command-line.

Readings:

• Java Foundations, Chapter 2

References/Links:

• Java's Scanner class documentation

LECTURES 4 & 5: Basic Java Programming

This lecture focuses on programming with classes and objects in Java. Topics covered include - object creation and object references, the String class and its methods, garbage collection in Java, the Java standard class library, the Random and Math classes, formatting output, basic decision making with if and switch statements, review of while, do, and for loops.

Slides: [PDF]

Exercises:

• StringExample.java - An example of the string class that demonstrates the difference between mutable and immutable objects.

Readings:

• Java Foundations, Chapters 3-5

References/Links:

• Learning the Java Language (Oracle's Java Tutorials) - these can also be downloaded as ebooks!
• Java's String class documentation

LECTURE 6: Arrays

In-depth presentation of arrays in Java.

Slides: [PDF]

Exercises:

• ArrayIteratorExample.java
• ArrayObjectsExample.java
• MultiDimensionArrayExample.java

Readings:

• Java Foundations, Chapter 7

LECTURE 7: Generics

Generic classes, interfaces, methods and types.

Slides: [PDF]

Exercises:

• Pair.java, PairExample.java - example of Pair class with generics for a single data type.
• Pair2.java, Pair2Example.java - example of Pair2 class with generics for multiple data types.

LECTURE 8: inheritance

Overview of Java's object-oriented features including inheritance and polymorphism.

Slides: [PDF]

Exercises:

• Oct2.java - in-class exercise that assessed students understanding of inheritance and the use of super(). (This in-class activity actually occured in Lecture 9 but was related to this lecture)

LECTURE 9: Packages

Java packages examples and visibility.

Slides: [PDF]

Exercises:

• PackageExample.zip - example involving 5 classes and 3 packages.

LECTURE 10 & 11: Linked List

Covers how to implement a standard linked list and a doubly linked list.

Slides: [PDF]

Exercises:

• Demo.java, LinkedList.java, LinkedListElement.java - doubly linked list example.
• Demo.java, LinkedList.java, LinkedListElement.java - extended doubly linked list example that now includes delete element and insert after element methods.

LECTURE 13 & 14: Sorting Linked List

Continues the coverage of linked lists by looking at out-of-place and in-place sorting.

Slides: [PDF]

Exercises:

• City.java, Demo.java, LinkedList.java, LinkedListElement.java - extended doubly linked list example to include out-of-place sorting (by city name).

 

LECTURE 15: Sorting Algorithms

Merge sort and quick sort algorithms.

Slides: [PDF]

Exercises:

• MergeSort.java

LECTURE 16: Search Algorithms

Searching sorted and unsorted data.

Slides: [PDF]

Exercises:

• BinarySearch.java

LECTURE 17-18: Binary Tree

Introduction to tree data structures and a hands-on overview of programming a binary tree class.

Slides: [PDF]

Exercises:

• BinaryTree.java, BTNode.java, Demo.java - the binary tree example from Lecture 17 that includes an insertSorted() and a toString() method. The insertSorted() method contains a bug. Can you find it? (solution: the bug is fixed in the binary tree example source code from Lecture 18).
• BinaryTree.java, BTNode.java, Demo.java - the binary tree example from Lecture 18 that includes a printInOrder() and a find() method.

LECTURE 19: AVL Tree

Introduction to balanced binary trees (AVL trees).

Slides: [PDF]

Exercises:

• ...

LECTURE 20: Hash Table

Introduction to hash tables including inserting data, searching for data and resolving collisions.

Slides: [PDF]

Exercises:

• ...