Skip to main content

more options

Lecture is held on Tuesdays and Thursdays from 11:15-12:05 in Upson 315. Lectures are mandatory. It is important that you attend, because we will cover items in lecture that we will not cover elsewhere in the course.

Lecture notes

Lecture notes will be posted here after each class. They can be downloaded in PDF or PPT format. If you find any of these links missing, or cannot open any of the files, please send email to the course staff.

Lecture Date Contents

0 8/23 Matlab Introduction
PDF
1 8/23 Robots: Cute but Dumb PPT PDF
2 8/28 Over and over and over PPT PDF
3 8/30 The hunt for red pixels PPT PDF
4 9/4 Red pixel centers PPT PDF
5 9/6 Big O PPT
PDF
6 9/11 Quicksort PPT
PDF
7
9/13 Blobs, Mobs... Graphs?
PPT
PDF
8
9/18 Graphical Graphs
PPT
PDF
9
9/21 Graphs and Cafeteria Trays?
PPT
PDF
10
9/25 Breadth versus depth
PPT
PDF
11
9/27 Linked Lists
PPT
PDF
12
10/2 Memory Allocation
PPT
PDF
13
10/4 Garbage Convex Hulls
PPT
PDF
14
10/16 Convex Hull, Lying robots
PPT
PDF
15
10/18 Least squares
PPT
PDF
16
10/23 Binary search
PPT
PDF
17
10/25 Golden section search, total least squares
PPT
PDF
18
10/30 Interpolation = Fuzzy Cat
PPT
PDF
19
11/6 Coke vs Pepsi Taste Test
PPT
PDF
20
11/8 Preprocessing
PPT
PDF
21
11/13 Voronoi Diagrams
PPT
PDF
22
11/15 Greedy Clustering
PPT
PDF
 

If you have any questions that you would like answered over email, please direct them to cs100r-staff-l@lists.cs