CS 245 – Advanced Programming and Data Structures
Information
- Syllabus
- Enrollment: 22
Lectures
- CS 245 Lecture 28 - Heap Demo and Closeout
- CS 245 Lecture 27 - Heap Implementation
- CS 245 Lecture 26 - Heaps and Priority Queues
- CS 245 Lecture 25 - Binary Search Tree Add, Traverse
- CS 245 Lecture 24 - Binary Search Trees
- CS 245 Lecture 23 - Binary Search Trees
- CS 245 Lecture 22 - Hashtables
- CS 245 Lecture 21 - The Problem of Lookup
- CS 245 Lecture 20 - More Stack
- CS 245 Lecture 19 - Stack Algorithms
- CS 245 Lecture 18 - Dummy Nodes and Iterators
- CS 245 Lecture 17 - LinkedList and Iterator
- CS 245 Lecture 15 - Linked String
- CS 245 Lecture 14 - Linked Snake
- CS 245 Lecture 13 - Snake
- CS 245 Lecture 12 - Generic Sorted List
- CS 245 Lecture 11 - Set and Generics
- CS 245 Lecture 10 - Abstract Classes
- CS 245 Lecture 9 - Complexity
- CS 245 Lecture 8 - Brute Force and Spellchecking
- CS 245 Lecture 7 - Custom Drawing
- CS 245 Lecture 6 - Inheritance
- CS 245 Lecture 5 - Calculator continued
- CS 245 Lecture 4 - Calculator
- CS 245 Lecture 3 - Interfaces
- CS 245 Lecture 2 - Graphical User Interfaces
- CS 245 Lecture 1 - Hi and JUnit
Labs
- CS 245 Lab 13 - Binary Search Trees
- CS 245 Lab 12 - Threaded Image Processing
- CS 245 Lab 11 - Maze Traversal
- CS 245 Lab 10 - Performance Comparison
- CS 245 Lab 7 - Exam Preemption
- CS 245 Lab 6 - Generics
- CS 245 Lab 5 - Recursion Continued
- CS 245 Lab 4 - Recursion
- CS 245 Lab 3 - Interfaces
- CS 245 Lab 2 - GUI Programming
- CS 245 Lab 1 - JUnit
Homework
- CS 245 Homework 3 - due before December 14
- CS 245 Preassignment 3 - due before November 28
- CS 245 Homework 2 - due before November 18
- CS 245 Preassignment 2 - due before October 31
- CS 245 Homework 1 Part 2 – due before October 11
- CS 245 Homework 1 Part 1 - due before October 4
- CS 245 Preassignment 1 - due before September 24