CS 106B: Programming Abstractions

Lectures - (jump to today's lecture)

This calendar displays what we have covered each day and may also contain rough estimates of what we will cover in the future. Information listed about future dates is speculative and may change over time, except for exam dates.

Week	Mon	Wed	Fri
1	4-01 (M+J) course overview; intro to C++ ( preview) read Ch. 1-2; C++ handout CodeStepByStep: HelloWorld, StanfordVsCal C++ docs: cout, cin Stanford C++ lib: simpio.h 00-introduction.pdf 01-intro-to-cpp.pdf	4-03 (Marty) C++ functions ( preview); strings ( preview) read Ch. 2-3; Proc.Decomp handout CodeStepByStep: parameterMysteryBCA, quadratic, BMI, stringMysteryAB, nameDiamond C++ docs: cmath, string Stanford C++ lib: gmath.h, simpio.h, strlib.h 02-functions-strings.pdf all-code-lecture02.zip functions.cpp	4-05 (Kate) more strings; file I/O streams ( preview); Homework 1 assigned read Ch. 3-4 CodeStepByStep: stringMystery, streamErrors, vowelStats, averageValueInFile, hoursWorked C++ docs: string, cctype, ifstream, iomanip, sstream Stanford C++ lib: strlib.h, filelib.h, simpio.h 03-strings-streams.pdf all-code-lecture03.zip files.cpp
2	4-08 (Julie) Vector ( preview); ADTs read Ch. 5 CodeStepByStep: vectorMysteryRemove, vectorMysteryInsert, countInRange, removeAll, addStars, intersect, histogram Wikipedia: data structure, collection, ADT Stanford C++ lib: Vector, LinkedList, Grid 04-vector-grid-ll-adts.pdf all-code-lecture04-starter.zip	4-10 (Julie) stacks and queues ( preview) read Ch. 5 CodeStepByStep: stackMystery1, removeMin, queueMystery1, stutter, mirror Wikipedia: stack, queue Stanford C++ lib: Stack, Queue, Deque 05-stacks-queues.pdf all-code-lecture05.zip	4-12 (Julie) sets and maps ( preview); Homework 2 assigned read 5.4 - 5.6 CodeStepByStep: setMystery, wordCount, isHappyNumber, mapMystery Wikipedia: set, map Stanford C++ lib: Set, HashSet, Lexicon, Map, HashMap 06-sets-maps.pdf all-code-lecture06.zip
3	4-15 (Marty) recursion ( preview) read Ch. 7 CodeStepByStep: mystery648, mystery348, factorial, isPalindrome Wikipedia: recursion Videos: Stuart #1, #2, #3 (Java) 07-recursion.pdf all-code-lecture07.zip hanoi.cpp recursionprobs.cpp	4-17 (Marty) more recursion; recursive data read Ch. 7, Ch. 8 CodeStepByStep: power, isPalindrome, printBinary Stanford C++ lib: filelib.h 08-recursion2.pdf all-code-lecture08.zip recursionprobs2.cpp	4-19 (Marty) recursive data; fractals ( preview); Homework 3 assigned read Ch. 7; 8.4 CodeStepByStep: reverseLines, crawl, evenDigits Wikipedia: fractal Stanford C++ lib: gwindow.h Videos: Julie on recursion, fractals 09-recursion3-fractals.pdf all-code-lecture09.zip fractals.cpp recursionprobs3.cpp
4	4-22 (Julie) recursive backtracking ( preview) read Ch. 9 lecture notes CodeStepByStep: printAllBinary, printAllDecimal, permute, combin Wikipedia: backtracking 10-12-backtracking-all.pdf all-code-lecture10.zip	4-24 (Julie) recursive backtracking read Ch. 9 lecture notes CodeStepByStep: subsets all-code-lecture11.zip	4-26 (Julie) recursive backtracking; Homework 4 assigned read Ch. 9 lecture notes CodeStepByStep: solveQueens all-code-lecture12.zip
5	4-29 (Marty) classes and objects ( preview) read Ch. 9; Ch. 6 CodeStepByStep: Circle, Date Wikipedia: class, object, OOP 13-classes.pdf all-code-lecture13.zip ball.cpp ball.h ballmain.cpp bankaccount.cpp bankaccount.h wellsfargo-client.cpp	5-01 (Marty) more classes and objects ( preview); arrays and Stack implementation ( preview) read 11.1, 11.3, 12.1, 12.3-4 Wikipedia: op.overload (#2) 14-implement-an-adt.pdf all-code-lecture14.zip arraystack.cpp arraystack.h stack-client.cpp	5-03 (Marty) priority queues and heaps ( preview) Homework 5 assigned read 10.1 - 10.2 15-priority-queue-heap.pdf all-code-lecture15-starter.zip
6	5-06 (Julie) algorithm analysis and Big-Oh ( preview) read 10.2 16-17-bigOh-sort-all.pdf all-code-lecture16.zip	5-08 (Julie) sorting ( preview) MIDTERM EXAM is Thu 5/09 at 7pm! read Ch. 10 CodeStepByStep: selection1, insertion1, merge1 Wikipedia: selection sort, insertion, merge, quick all-code-lecture17.zip	5-10 memory and pointers (Julie) ( preview) read Ch. 11.2, 12.1, 12.5 CodeStepByStep: v1v2p1p2, mystery1 Wikipedia: pointer all-code-lecture18.zip
7	5-13 (Marty) linked nodes ( preview) read 11.2, 11.4; 12.1 - 12.3 CodeStepByStep: nodes-12-123, nodes-12-312, print, addFront, addBack, contains, min links: See++ 19-linked-lists.pdf all-code-lecture19.zip linkedlist-client.cpp ListNode.h	5-15 (Marty) linked lists ( preview) read 12.2 - 12.3; 14.3 CodeStepByStep: mystery1, toString, insert, removeFront, removeBack, countDuplicates Wikipedia: linked list 20-linked-lists-2.pdf all-code-lecture20.zip linkedlist-client.cpp	5-17 (Marty) linked lists ( preview); Homework 6 assigned read 12.2 - 12.3; 14.3 CodeStepByStep: mystery1, toString, insert, removeFront, removeBack, countDuplicates Wikipedia: linked list 21-linked-lists-3.pdf all-code-lecture21-starter.zip
8	5-20 (Julie) binary trees ( preview) read 16.1 CodeStepByStep: print, size, contains, height Wikipedia: binary tree links: BST Visualizer Videos: Stuart (Java) 22-24-trees-all.pdf all-code-lecture22-starter.zip tree-main.cpp	5-22 (Julie) binary search trees (BSTs) ( preview) read 16.2 - 16.4 CodeStepByStep: bst add nodes 1, bst add nodes 3, bstContains, bstGetMin, bstAdd, bstRemove, isBST Wikipedia: BST, AVL, links: AVL rotation visualizer all-code-lecture23-starter.zip MyTreeSet.cpp	5-24 (Julie) advanced trees, encoding trees, Huffman ( preview); Homework 7 assigned read 16.5 Wikipedia: compression, Huffman 24-huffman.pdf
9	5-27 Memorial Day Holiday (no class)	5-29 (Kate) graphs; DFS, BFS ( preview) read Ch. 18 CodeStepByStep: properties1 Wikipedia: graph, DFS, BFS Stanford C++ lib: BasicGraph Animations: DFS, BFS 25-graphs.pdf	5-31 hashing ( preview) Welcome to guest lecturer Michael Chang! read 15.2 - 15.3 Wikipedia: hashing 26-hashing.pdf all-code-lecture26.zip
10	6-03 (Julie) Lexicon case study, directed acyclic word graph (dawg) The world's fastest Scrabble program Wikipedia: trie, dawg 27-Lexicon.pdf	6-05 End-quarter celebration In place of our last lecture, we will have a casual hangout and AMA (ask me anything) with the course staff. Please join us! Please fill out our RSVP form so we can estimate how much snacks to bring!	6-07 FINAL EXAM is Fri 6/07 at 8:30 - 11:30am!

Show/hide:

files/slides

CodeStepByStep/docs links

This document and its content are copyright © Marty Stepp and Julie Zelenski, 2019. All rights reserved. Any redistribution, reproduction, transmission, or storage of part or all of the contents in any form is prohibited without the authors' expressed written permission.

CS 106B: Programming Abstractions, Spring 2019

Lectures - (jump to today's lecture)

Honor Code Reminder: