CS367: Introduction to Data Structures
SYLLABUS - Summer 2016

Note: this syllabus is tentative and subject to change - make sure to check it regularly.

Assignments are due at 8pm unless otherwise indicated. Homeworks are due on Friday unless otherwise indicated. Projects are due on Sunday unless otherwise indicated.

Week  
1 (6/13) -->
Topics: Introduction, Interfaces, Objects, Generics, Lists
Readings: Introduction, Lists
Homework: HW 1 due Sunday (6/19)
Project: Project 1 assigned
2 (6/20) 
Topics: Linked Lists, Exceptions
Readings: Exceptions, Linked Lists
Homework: HW 2 due Friday (6/24)
Project: Project 1 due Sunday (6/26)
3 (6/27) 
Topics: Complexity, Stacks and Queues, Tree Introduction, Priority Queues
Readings: Complexity, Stacks and Queues, Trees, Priority Queues, Recursion
Homework: HW 3 due Friday (7/1)
Project: Project 2 assigned
4 (7/5) 
Topics: Recursion, Searching, Trees, Binary Search Trees
Readings: Trees, Searching, Binary Search Trees
Homework: HW 4 due Friday (7/8)
Project: Project 2 due Sunday (7/10)
5 (7/11) 
Topics: Binary Search Trees, Red Black Trees
Readings: Red Black Trees
Homework: Homework 5 due Saturday (7/16)
Project: Project 3 assigned
Midterm Exam Tuesday July 12th 5-7pm
6 (7/18) 
Topics: Sorting, Graphs
Readings: Sorting, Graphs
Homework: HW 6 due Friday (7/22)
Project: Project 3 due Sunday (7/24)
7 (7/25) 
Topics: Graphs, Hashing, Sorting
Readings: Hashing
Homework: HW 7 due Friday (7/29)
Project: Project 4 assigned
8 (8/1) 
Topics: Sorting
Readings:
Homework: HW 8 due Wednesday (8/3)
Project: Project 4 due Sunday (8/7)
Final Exam Friday 8/5 10am-noon
Last Updated: 5/5/2016     ©2016 Beck Hasti