| |
Date |
Lecture Topics |
Reading |
Assignments |
Week
#1 |
Feb 24, Wednesday
|
Course overview
C/C++ Review
C review
CPP review
|
Class Web Page
Chapter 1
|
|
Week
#2 |
Mar 2, Wednesday
|
C review continued (structs, pointers)
|
|
|
Week
#3 |
Mar 9, Wednesday
|
Recursion
C review (structs, arrays, pointers)
Linked lists (motivation, the "insert" function
Lecture slides
The code we have written in class
|
|
|
Week
#4 |
Mar 16, Wednesday
|
Linked lists
Single and doubly connected linked lists.
Lecture slides
The Linked List code we have written in class on March 16
|
|
Assignment #1
Due: March 29, 23:55
|
Week
#5 |
Mar 23, Wednesday
|
Algorithm analysis
Lecture slides
The Linked List code we have written in class on March 23
|
Chapter 2
|
|
Week
#6 |
Mar 30, Wednesday
|
Searching and sorting
Lecture slides
The sorting code we have written in class on March 30
The code to generate n random points.
|
|
|
Week
#7 |
Apr 6, Wednesday
|
Midterm exam
|
|
|
Week
#8 |
Apr 13, Wednesday
|
Stacks
Lecture slides
|
|
Assignment #2
Due: April 26, 23:55
|
Week
#9 |
Apr 20, Wednesday
|
Queues
Lecture slides
Linked list based implementation of queues
|
|
|
Week
#10 |
Apr 27, Wednesday
|
Binary trees
Lecture slides
The binary tree code we have written in class on April 27
|
|
Assignment #3
Due: May 17, 23:55
inputs.zip
|
Week
#11 |
May 4, Wednesday
|
Heaps (Priority queues)
Lecture slides
Array based implementation of a heap we have written in class on May 4
|
A utility function we have written for Assignment #3
|
|
Week
#12 |
May 11, Wednesday
|
Hash Tables
Lecture slides
|
|
|
Week
#13 |
May 18, Wednesday
|
Graphs
Lecture slides
|
|
|
Week
#14 |
May 25, Wednesday
|
Graphs
Lecture slides
Code to create a random graph (as edge list)
Code to read a graph as an edge list and construct an adjancency matrix of the graph.
Code for breadth first and depth first traversal of graphs.
|
|
|
