CS 2321 Introduction to Data Structures

Week

Monday

Tuesday

Wednesday

Friday

1

Syllabus

Java Review 

§1 §2

Array Lists
Doubly Linked Lists
Linked Lists
Stacks
Queues
§3 §6

List ADT

§7

2

Martin Luther King Day

Junit and

Assignment1 discussion

Meet in Lab

Asymptotic Analysis 1/2

§4

3

Asymptotic Analysis 2/2

Recursion
§5

Assignment 1

Sorting (Bubble, Insertion and Selection)

§3.1.2 §7.6

Priority Queues
§9.1 §9.2 §9.4

4

Heap
§9.3§9.4

Assignment 2

CS Office before 5pm - No Resubmits

In place Heap Sort

Adaptable PQ
§9.5

Heap Ag Pseudo Code

Winter Carnival Recess

5

Greedy Method

§13

Review of W1-W4

In Class Exam

6

Merge Sort

§12

Assignment 3

Quick Sort

§12

Sort Complexity
Visual Guide to Sorts

Sorting Video

§11.3.1

7

Radix Sort
§11.3.2

Assignment 4 

CS Office before 5pm - No Resubmits

Maps
§10.1

Hash Table
§10.2

8

Binary Search Tree
§11.1

AVL Tree
§11.3

Spring Break

9

AVL Tree (cont)
AVL Tree Pseudo Code
§11.3

Assignment 5

(2,4) Trees
(2,4) Trees animation
§11.5

(2,4) Trees (Cont)
§11.5

10

B-Trees
§15.3

_{Review of W5-W9}

In Class Exam

11

Graph
§14.1 §14.2

Assignment 6

Depth First Search
§14.3

Breadth First Search
§14.3

12

Directed Graph
§14.5

Assignment 7

Dijkstra's Algorithm
§13.5

Graph Algorith Review
Assignment B discussion §13.5-13.6

13

Minimum Spanning Tree
§13.6

Graph Application  

§13.6.1

Dynamic Programming
§12.2

14

Dynamic Programming (cont)
§12.2

Assignment B

Final Exam Review 1
Review of W10-W14

Final Exam Review 2
W1-W4
W5-W9

Final Exam: TBD