These documents and videos provide information, help, and advice on CP164 topics.
These lectures are organized by topic, not by week - check the lab and assignment schedules as to when you should understand these topics.
Lecture attendance is not mandatory. Go through the notes and videos and bring your questions to lecture time.
Notes | Recorded Lectures |
---|---|
Introduction to the Introduction | |
Getting Started
|
Introduction Classes and Objects The Student
Constructor
The Student
String
The Student Comparisons
The Food
Class
The Movie
Class
Abstract Data Types |
The Stack
|
Data
Structures The Stack ADT The Stack Maze The Stack Balanced Brackets The Stack Mirror The Stack Array Implementation |
The Queue
|
The Queue ADT The Queue Maze Queue Simulations The Array-Based Queue The Circular Queue |
The Priority Queue
|
The
Priority Queue ADT The Array-Based Priority Queue |
The List
|
List ADT The Array-Based List |
The Sorted List
|
The
Array-Based Sorted List |
Recursion
|
Fruitful
Recursion In-Place Recursion Tree Recursion Recursion Demonstration |
Algorithm Analysis
|
Algorithm Analysis |
Linked Data Structures
|
Linked Data
Structures Moving Nodes |
The Linked Queue
|
The Linked Queue Linked Traversal |
The Linked Priority Queue
|
Linked
Thinking |
Linked Lists and Sorted Lists
|
Array
vs Linked Comparisons |
Binary Search Trees
|
The BST BST Insertion BST Deletion BST Traversal |
Hashing
|
Hashing |
Sorting
|
Sorting I Sorting II Sorting III |