Toggle navigation
CS106B
Lectures
1 Welcome
2 Functions
3 Strings
4 Vectors and Grid
5 Stacks and Queues
6 Sets and Maps
7 Recursive Thinking
8 Fractals
9 Recursive Trees
10 Exhaustive Search and Recursive Backtracking
11 Big-O, Asymptotic Analysis, Computational Complexity
12 Sorting
13 Memoization
14 Classes
15 Pointers
16 DynamicAllocation
17 Implementing Vector
18 Linked Lists
19 Trees
20 Binary Heaps
21 Binary Search Trees
22 Hashing
23 Graphs
24 Graphs II
25 Breadth First Search and Depth First Search
26 Dijkstra and A*
27 Minimum Spanning Trees
28 Neural Networks
29 Esoteric Data Structures
30 Last Class
Handouts
1 - General Information
2 - Course Placement
3 - Name Hash
4 - Fauxtoshop
5 - Honor Code
6 - Velociraptor Safety
7 - Bananagrams
8 - Midterm
9 - Search
10 - Final
Assignments
0 - Name Hash
1 - Fauxtoshop
2 - Serafini
3 - Meta Academy
4 - Boggle
5 - PQueue
6 - Huffman Encoding
7 - Trailblazer
Sections
Section 01
Section 01 Soln
Section 02
Section 02 Soln
Section 03
Section 03 Soln
Section 04
Section 04 Soln
Section 05
Section 05 Soln
Section 06
Section 06 Soln
Section 07
Section 07 Soln
Section 08
Section 08 Soln
Tools
Course Overview
Help Hours Calendar
QT Creator
Style Guide
Overview
Assignment 1: Fauxtoshop
Due: Friday, Oct 7th, 12P.M.
Resources
Handout
Starter Code
Sample Output
Example of a series of interactions with user:
transcript.txt
Choose color-wheel.gif, scatter, 10:
Output
(random; will not match exactly)
Choose stanford-oval.jpg, edge detection, threshold 30:
Output
Choose kitten.jpg, green screen, cat-green.jpg, threshold 60, (100,25):
Output
Gaussian Blur extra credit option: Choose pusheen.jpg, Gaussian Blur, radius 6:
Output
Tips
Check out the
style guide
for explicit details on style.
Submit using
paperless.stanford.edu
. You may submit as many times as you like, we will grade that most recent submission. We suggest you submit early to practice with the submission process.
YEAH Assignment introduction video: