CP164 : Recorded Lectures

• Introduction
• Abstract Data Types

• Introduction to CP164
• Grades and Plagiarism
• Abstract Data Types
• The Priority Queue

• Classes
• The Student Class
• Class Methods

• Classes
• The Student Constructor
• The Student String

• The Student Class
• The Food Class
• Assignment 1
• Lab 1: Classes

• Student Comparison
• The Food Class
• Assignment 1
• Lab 1: Classes

• Data Structures
• The Stack ADT
• The Stack: Solving a Maze
• The Stack: Balanced Brackets
• Assignment 2

• Data Structures
• The Stack ADT
• The Stack: Solving a Maze
• The Stack: Balanced Brackets
• Assignment 2

• The Array-Based Stack Implementation
• The Stack: The Mirror Problem

• The Array-Based Stack Implementation
• The Stack: The Mirror Problem

• The Queue ADT
• The Queue: Solving a Maze
• The Queue: Simulations
• The Array-Based Queue Implementation
• Lab 2: Stacks

• The Queue ADT
• The Queue: Solving a Maze
• The Queue: Simulations
• The Array-Based Queue Implementation
• Lab 2: Stacks

• The Circular Array-Based Queue
• The Priority Queue ADT
• Assignment 3

• The Circular Array-Based Queue
• The Priority Queue ADT
• Assignment 3

• The Priority Queue: Applying Prim's Algorithm
• The Array-Based Priority Queue Implementation

• The Priority Queue: Applying Prim's Algorithm
• The Array-Based Priority Queue Implementation

• Lab 3: Queues

• Lab 3: Queues

• The List / Sorted_List ADTs
• The Array-Based List Implementation
• The Array-Based Sorted_List Implementation
• Assignment 4

• The List / Sorted_List ADTs
• The Array-Based List Implementation
• The Array-Based Sorted_List Implementation
• Assignment 4

• Algorithm Analysis

• Algorithm Analysis

• Lab 4: Lists

• Lab 4: Lists

• Assignment 5

• Snippets - Introduction
• Snippets - Hidden Loops 1
• Snippets - Hidden Loops 2
• Snippets - Bad else
• Assignment 5

Reading Week

• Types of Recursion

• Snippets - Are We There Yet?
• Fruitful Recursion
• In-Place Recursion
• Tree Recursion

• Lab 5: Recursion

• Midterm: Done in MyLearningSpace
• Recursion Demonstrations
• Lab 5: Recursion

• Linked Data Structures
• The Linked Stack Implementation

• Linked Data Structures

• Moving Nodes
• The Linked Queue Implementation
• Traversing a Linked List
• Array vs Linked Comparisons

• Moving Nodes
• The Linked Queue Implementation
• Traversing a Linked List
• Array vs Linked Comparisons

• Traversing a Linked List
• Lab 6: Lists (Cont'd)

• Linked Priority Queue Insertion
• Lab 6: Lists (Cont'd)

• Linked Recursion
• Assignment 6

• Linked Recursion
• Assignment 6

• Interlude - Writing Methods

• Interlude - Writing Methods

• Linked Thinking
• Lab 7: Recursion (Cont'd)

• Linked Thinking
• Lab 7: Recursion (Cont'd)

• Assignment 7

• Assignment 7

• Binary Search Trees
• Binary Search Tree Insertion

• Binary Search Trees
• Binary Search Tree Insertion

• Lab 8: Binary Search Trees

• Lab 8: Binary Search Trees

• Binary Search Tree Deletion
• Binary Search Tree Traversal
• Assignment 8

• Binary Search Tree Deletion
• Binary Search Tree Traversal
• Assignment 8

• Interlude: Passing Functions

• Interlude: Passing Functions

• Hashing
• Lab 9: Hash Sets

• Hashing
• Lab 9: Hash Sets

• Assignment 9

• Assignment 9

• Sorting
• Sorting (Cont'd)
• Sorting III

• Sorting
• Sorting (Cont'd)
• Sorting III

• Lab 10: Sorting

• Lab 10: Sorting

• Assignment 10

• Assignment 10