COMP 15: Data Structures (Summer 2014)

About [+]

Announcements

Course Information [+]

Homework 5: Self-Balancing Class Roster [-]

Due July 29 at 11:59 PM. This assignment has you modify your BST from last homework to be self-balancing.

Homework 4: Tree-Based Class Roster [+]

Homework 3: Summarizer 2 (2 Fast 2 Summarize) [+]

Homework 2: Simple Linked-List Summarizer [+]

Homework 1: Getting Started [+]

Lab 8: Exceptions [+]

Lab 7: Eliminating Recursion [+]

Lab 6: Const Correctness [+]

Lab 5: Hello, Operator [+]

Lab 4: Overloading, Overriding, and Operators [+]

Lab 3: Memory Management [+]

Lab 2: Pointers* & References [+]

Lab 1: Taming the Remote Machine [+]

Syllabus

Syllabus subject to change. The notes are living documents and may be revised over time.

  Month     Week     Date     Topic     Chapter     Notes     Source  
May 1 21st Admin, Overview 1.1-1.2 .pdf dir
2 26th No class - Memorial Day
28th Arrays 1.2, 2.1 .pdf dir
June 3 2nd Arrays, Asymptotics, Linked Lists 1.5, 2.1, 3.1 .pdf dir
4th Circular Arrays, Doubly Linked Lists 2.3, 2.4, 3.2 .pdf dir
4 9th Big-O, Insertion-sort, Merge-sort 1.3-1.5, 11.1 .pdf dir
11th More Sorting 11.1 .pdf dir
5 16th Bounded-Universe Sorting 11.2 .pdf dir
18th Trees 6.1, 6.2 .pdf dir
6 23rd More Trees 6.1, 6.2 .pdf dir
25th Tries 13.1 .pdf dir
7 30th Hash Tables 5.1, 5.3 .pdf
July 2nd 5.2 .pdf dir
8 7th Midterm #1 on Weeks 1-6 Tornado
9th Git, C++ STL, Iterators
9 14th Midterm #1 on Weeks 1-6 + Vim
16th Rescheduled Monday lab
10 21st Heaps 10.1 .pdf
23rd More Heaps, Heapsort 10.1, 11.1.3 .pdf dir
11 28th Graphs 12.1-12.2 .pdf
30th 12.3-12.4
August 12 4th Review for final exam
6th Midterm #2 on (mostly) weeks 7-11

Resources [+]


Page last updated: