CS 24: Problem Solving with Computers-II, Winter 19
lecture date | notes | ready? | description | slides before | slides after |
---|---|---|---|---|---|
2019-01-07 | lect01 | true | Course overview, intro to Git | Annotated pdf | |
2019-01-09 | lect02 | true | C++ classes and abstract data types | Annotated pdf | |
2019-01-14 | lect03 | true | The Big Four (lab01) | Annotated pdf | |
2019-01-16 | lect04 | true | Operator overloading | Annotated pdf | |
2019-01-23 | lect05 | true | Linked-lists (lab02) | Annotated pdf | |
2019-01-28 | lect06 | true | Rule of Three, Recursion (review), intro to pa02 | Annotated pdf | |
2019-01-30 | lect07 | true | Binary Search Trees, GDB | Annotated pdf | |
2019-02-06 | lect08 | true | Binary Search Trees (contd) | Annotated pdf | |
2019-02-11 | lect09 | true | Big-Oh: Analyzing the efficiency of algorithms | Annotated pdf | |
2019-02-13 | lect10 | true | Analyzing the running time of BST operations | Annotated pdf | |
2019-02-20 | lect11 | true | Stacks (lab05), C++ STL | Annotated pdf | |
2019-02-27 | lect12 | true | C++ templates | ||
2019-03-04 | lect13 | true | Queues and Priority Queues (Heaps) | Annotated pdf | |
2019-03-06 | lect14 | true | Under the hood of heaps and priority queues | Annotated pdf | |
2019-03-11 | lect15 | true | Comparasion classes and applications of heaps | ||
2019-03-13 | lect16 | true | Final Review and Wrap up |
num | ready? | description | assigned | due |
---|---|---|---|---|
h01 | true | Chapter 1.1, 2.1-2.2 | Wed 01/09 02:00PM | Mon 01/14 12:00PM |
h02 | true | Chapter 2.3-2.5 | Wed 01/16 02:00PM | Mon 01/28 09:00AM |
h03 | true | Chapter 3, section 3.1, Chapter 4, 4.1 - 4.5 | Wed 01/23 02:00PM | Mon 01/28 09:00AM |
h04 | true | Chapter 5, section 5.1 -5.4 | Wed 01/30 02:00PM | Mon 02/04 09:00AM |
h05 | true | Chapter 9: Recursion | Wed 02/06 02:00PM | Mon 02/11 09:00AM |
h06 | true | Chapter 1: Runing Time Analysis | Wed 02/13 02:00PM | Mon 02/25 09:00AM |
h07 | true | Chapter 10: Trees | Wed 02/20 02:00PM | Mon 02/25 09:00AM |
h08 | true | Chapter 6, sections 6.1-6.6 | Wed 02/27 02:00PM | Mon 03/04 09:00AM |
h09 | true | Heaps: Chapter 11.1 and 11.2 | Wed 03/06 02:00PM | Mon 03/11 09:00AM |
num | ready? | description | assigned | due |
---|---|---|---|---|
lab00 | true | Getting started | Mon 01/07 09:00AM | Thu 01/10 11:59PM |
lab01 | true | Define implement and apply a C++ class | Thu 01/10 09:00AM | Thu 01/17 11:59PM |
lab02 | true | Implementing a linked list | Thu 01/24 09:00AM | Thu 01/31 11:59PM |
lab03 | true | Using g++, make and gdb | Mon 02/04 09:00AM | Thu 02/14 11:59PM |
lab04 | true | Binary Search Tree | Mon 02/11 09:00AM | Thu 02/21 11:59PM |
lab05 | true | Evaluating expressions with stacks | Thu 02/28 09:00AM | Thu 03/07 11:59PM |
lab06 | true | Implementing a heap | Thu 03/07 09:00AM | Thu 03/14 11:59PM |
num | ready? | description | assigned | due |
---|---|---|---|---|
pa01 | true | Statistician as a C++ Abstract Data Type (ADT) | Fri 01/18 09:00AM | Fri 01/25 11:59PM |
pa02-checkpoint | true | Linked-list implementation of a card game | Mon 01/28 09:00AM | Wed 02/06 11:59PM |
pa02 | true | Linked-list implementation of a card game | Mon 01/28 09:00AM | Fri 02/15 11:59PM |
pa03-checkpoint | true | Card game using Binary Search Trees | Fri 02/22 09:00AM | Sun 03/03 11:59PM |
pa03 | true | Card game using Binary Search Trees | Fri 02/22 09:00AM | Wed 03/13 11:59PM |