CS 24: Problem Solving with Computers-II, F19
Information
Lecture Notes and Slides
lecture date |
notes |
ready? |
description |
slides |
2019-09-26 |
lect01 |
true |
Course overview, intro to C++ classes |
pdf |
2019-10-01 |
lect02 |
true |
C++ classes and abstract data types |
pdf |
2019-10-03 |
lect03 |
true |
The Big Four |
pdf |
2019-10-08 |
lect04 |
true |
Linked Lists, Operator overloading, Unit tests |
pdf |
2019-10-10 |
lect05 |
true |
Linked-lists (contd) |
pdf |
2019-10-15 |
lect06 |
true |
GDB, intro to pa01, Recursion |
pdf |
2019-10-17 |
lect07 |
true |
Recursion, Binary Search Trees |
pdf |
2019-10-22 |
lect08 |
true |
Binary Search Trees |
pdf |
2019-10-29 |
lect09 |
true |
Big-Oh: Analyzing the efficiency of algorithms |
pdf |
2019-10-31 |
lect10 |
true |
Analyzing the running time of BST operations |
pdf |
2019-11-05 |
lect11 |
true |
More BST running time, Stacks (lab05), C++ STL |
pdf |
2019-11-07 |
lect12 |
true |
Stacks, C++ templates |
pdf |
2019-11-12 |
lect13 |
true |
C++ templates, Queues |
pdf |
2019-11-19 |
lect14 |
true |
Heaps |
pdf |
2019-11-21 |
lect15 |
true |
Comparison classes and iterators |
pdf |
2019-11-26 |
lect16 |
true |
Wrap up |
pdf |
2019-12-03 |
lect17 |
true |
Final Review and Wrap up |
pdf |
2019-12-05 |
lect18 |
true |
Final Review and Wrap up |
pdf |
Homework
num |
ready? |
description |
assigned |
due |
h01 |
true |
Chapter 1.1, 2.1-2.2 |
Thu 09/26 12:00AM |
Wed 10/02 11:59PM |
h02 |
true |
Chapter 2.3-2.5 |
Wed 10/02 12:00AM |
Wed 10/09 11:59PM |
h03 |
true |
Chapter 3, section 3.1, Chapter 4, 4.1 - 4.5 |
Wed 10/09 12:00AM |
Wed 10/16 11:59PM |
h04 |
true |
Chapter 5, section 5.1 -5.4 |
Wed 10/16 12:00AM |
Wed 10/23 11:59PM |
h05 |
true |
Chapter 9: Recursion |
Wed 10/23 12:00AM |
Fri 11/01 11:59PM |
h06 |
true |
Chapter 1: Runing Time Analysis |
Fri 11/01 12:00AM |
Fri 11/08 11:59PM |
h07 |
true |
Chapter 10: Trees |
Fri 11/08 12:00AM |
Mon 11/18 11:59PM |
h08 |
true |
Chapter 6.1 - 6.6: Templates |
Mon 11/18 12:00AM |
Mon 11/25 11:59PM |
h09 |
true |
Heaps: Chapter 11.1 and 11.2 |
Mon 11/25 12:00AM |
Mon 12/02 11:59PM |
Lab
num |
ready? |
description |
assigned |
due |
extra_credit_lab |
true |
Statistician as a C++ Abstract Data Type (ADT) |
Thu 11/07 12:00AM |
Thu 12/05 11:59PM |
lab00 |
true |
Getting started |
Thu 10/03 12:00AM |
Mon 10/07 11:59PM |
lab01 |
true |
Define implement and apply a C++ class |
Thu 10/03 12:00AM |
Thu 10/10 11:59PM |
lab02 |
true |
Implementing a linked list |
Thu 10/10 12:00AM |
Thu 10/17 11:59PM |
lab03 |
true |
Using g++, make and gdb |
Thu 10/17 12:00AM |
Tue 10/29 11:59PM |
lab04 |
true |
Binary Search Tree |
Tue 10/29 12:00AM |
Thu 11/07 11:59PM |
lab05 |
true |
Evaluating expressions with stacks |
Thu 11/07 12:00AM |
Tue 11/19 11:59PM |
lab06 |
true |
Implementing a heap |
Tue 11/19 12:00AM |
Tue 12/03 11:59PM |
Programming Assignments
num |
ready? |
description |
assigned |
due |
pa01 |
true |
Linked-list implementation of a card game |
Fri 10/18 12:00AM |
Mon 11/04 11:59PM |
pa02 |
true |
BST on movie dataset |
Thu 11/14 12:00AM |
Thu 12/05 11:59PM |
Exams
num |
ready? |
description |
exam date |
e01 |
true |
Midterm Exam-I |
Thu 10/24 05:00PM |
e02 |
true |
Midterm Exam-II |
Thu 11/14 05:00PM |
e03 |
true |
Final Exam 7:30pm–10:30pm |
Wed 12/11 07:30PM |
Most of the materials I’m using this quarter were made by Diba Mirza. Anything good about this class can be attributed to her, and all bad things are totally my fault :)