Course by assignment

CS250: Data Structures using C++,   Fall 2018

Assignment Type Assignment Week
Lecture Class introduction 1
Lecture Soure Control 1
Lecture Debugging Tools 1
Lecture Unit Tests 2
Lecture Recursion 2
Lecture Standard Template Library 3
Lecture Wrapping a Static Array 3
Lecture Linked Lists 4
Lecture Exceptions 5
Lecture Growth Rates and O(n) Notation 6
Lecture Stacks and Queues 7
Lecture Stacks and Queues 8
Lecture Searching and Sorting Algorithms 9
Lecture Trees 10
Lecture Binary Search Trees 11
Lecture Dictionaries 12
Lecture Iterators 13
Lecture Heaps 15
Lecture Balanced Search Trees 15
Assignment Type Assignment Week
Exercise Lab 1: Git and Source Control 1
Exercise Lab 2: Debugging 1
Exercise Lab 3: Testing 2
Exercise Lab 4: Recursion 2
Exercise Lab 5: STL Vector 3
Exercise Lab 6: STL List 4
Exercise Lab 7: Exception Handling 5
Exercise Lab 8: Algorithm Efficiency 6
Exercise Lab 9: STL Stacks 7
Exercise Lab 10: STL Queues 7
Exercise Lab 11: Intro to Trees 10
Exercise Lab 13: Intro to Dictionaries 12
Exercise Lab 14: Iterators 13
Exercise Lab 15: Intro to Heaps 15
Exercise Lab 16: Intro to Balanced Search Trees 15
Assignment Type Assignment Week
Homework Read Chapter 1: Data Abstraction 1
Homework Chapter 1 Notes 1
Homework Git and Source Control Notes 1
Homework Debugging Tools Notes 1
Homework Read Chapter 2: Recursion 2
Homework Chapter 2 Notes 2
Homework Testing Notes 2
Homework Read Chapter 3: Array-based Implementations 3
Homework Chapter 3 Notes 3
Homework Read Chapter 4: Link-based Implementation 4
Homework Chapter 4 Notes 4
Homework Read Interlude 3: Exceptions 5
Homework Interlude 3 Notes 5
Homework Read Chapter 10: Algorithm Efficiency 6
Homework Read Chapter 11: Sorting Algorithms 6
Homework Chapter 10 Notes 6
Homework Read Chapter 6: Stacks 7
Homework Read Chapter 7: Stacks Implementation 7
Homework Read Chapter 13: Queues 8
Homework Read Chapter 14: Queue Implementation 8
Homework Chapter 14 Notes 8
Homework Read Chapter 11: Sorting Algorithms 9
Homework Chapter 10 Notes 9
Homework Read Chapter 15: Trees 10
Homework Chapter 15 Notes 10
Homework Read Interlude 7: Iterators 12
Homework Interlude 7 Notes 12
Homework Read Chapter 18 13
Homework Chapter 18 Notes 13
Homework Read Chapter 17: Heaps 15
Homework Read Chapter 19: Balanced Search Trees 15
Homework Chapter 17 Notes 15
Homework Chapter 19 Notes 15
Assignment Type Assignment Week
Quiz Chapter 1 Quiz 1
Quiz Git 1
Quiz Chapter 2 Quiz 2
Quiz Chapter 3 Quiz 3
Quiz Chapter 4 Quiz 4
Quiz Interlude 3 Quiz 5
Quiz Chapter 10 Quiz 6
Quiz Chapter 6 Quiz 7
Quiz Chapter 13 Quiz 8
Quiz Chapter 11 Quiz 9
Quiz Chapter 15 Quiz 10
Quiz Chapter 16 Quiz 10
Quiz Chapter 18 Quiz 13
Quiz Chapter 17 Quiz 15
Quiz Chapter 19 Quiz 15
Assignment Type Assignment Week
Project Project 1: Vector 3
Project Project 2: Linked List 4
Project Project 3/4: Stacks and Queues 8
Project Project 4: Sorting Algorithms 9
Project Project 5: Binary Search Tree 11
Project Project 6: Dictionaries 13
Assignment Type Assignment Week
Exam Exam 1 review 5
Exam Exam 1 6
Exam Exam 2 Review 10
Exam Exam 2 11
Exam Final exam review 16
Exam Take final exam early (optional) 16
Exam Final Exam: Thursday, Dec 13th, 2:00 - 3:50 pm 17