CS 112

Syllabus

Piazza

Day Date Topic Reading Due Work Due
1 M Jan 18 Introduction to the course Syllabus
W Jan 20 Algorithms and Abstraction 1 - 1.2
Th Jan 21 Algorithmic efficiency 1.3 Ex. 1.2.2,3,5
F Jan 22 Data abstraction 1.4 - 1.6 1.3.1,2,3,4

2 M Jan 25 No class - MLK Day observed
W Jan 27 Elementary computation 2 - 2.3,ASCII 1.4.1, 3, 5, 8, 9, 10
Th Jan 28 Thinking about functions 2.4 2.2.1-2,8 & 2.3.4-8
F Jan 29 Visualizing abstraction 3-3.2 2.4.1-3, 7, 8, 12, 13
quiz1 quiz1solutions

3 M Feb 1 Functional abstraction 3.3 3.1.1,2,3; 3.2.1-5
W Feb 3 Style / Functions 3.4-3.5 3.3.1,5,7,8,9
Th Feb 4 Scope / Namespaces 3.6 3.4.1,2; 3.5.3,4,8,9
F Feb 5 Iteration and population models 4-4.2 3.6.2-3
quiz2 quiz2solutions

4 M Feb 8 Discrete models and accumulators 4-4.2 4.1.1,2,7,13,18
W Feb 10 Accumulators 4.1.21, 23, 29, 37
quiz3 quiz3solutions
Th Feb 11 Search / Pagerank MacCormick Ch. 1-3 4.2.3, 4
F Feb 12 Exam 1

5 M Feb 15 Conditional iteration (while loops) 4.3
W Feb 17 Continuous models 4.4,4.6 4.3.1-3,5
Th Feb 18 Random walks 5-5.1 4.4.2,5
F Feb 19 Monte Carlo simulation 5.1.1,2
quiz4 quiz4solutions

6 M Feb 22 Simulating probability distributions 5.3 Project 4.3 (p.177)
report guidelines
W Feb 24 Back to Booleans 5.4-5 5.3.1-2
Th Feb 25 Analyzing text 6-6.1 5.4.1,3-6
F Feb 26 Text documents 6.2 6.1.3-5
Paper1

7 M Feb 29 Encoding strings 6.3 Project 5.1 (p.234)
W Mar 2 Analyzing text 6.5
feedback
6.3.1,2,5,6
quiz5 quiz5solutions
Th Mar 3 Linear-time algorithms 6.4 6.5.1,3
F Mar 4 Summarizing data 8-8.1 6.4.1,2

8 M Mar 7 Creating and modifyiing lists 8.2 Project 6.10 (p. 313)
W Mar 9 More lists 8.1.3,11,14
quiz6 quiz6solutions
Th Mar 10 Error-correcting codes MacCormick, Ch. 5 8.2.5,6,14
F Mar 11 Exam 2

9 M to F Mar 14 to 18 Spring break

10 M Mar 21 Warmup / Problem-solving
W Mar 23 Frequencies/Data files
csv
8.3,8.4
Th Mar 24 Linear Regression 8.6 8.3.1,2,5
F Mar 25 Two-dimensional data 9-9.2 8.6.1,2

11 M Mar 28 Images image.py 9.3 Project 8.4 (p. 428)
W Mar 30 Fractals 10-10.1 9.1.1-3, 9.2.5,7
Paper2
quiz7 quiz7solutions
Th Mar 31 Recursion and Iteration 10.2 10.1.1-3
F Apr 1 More recursion 10.2.1,2,4
Final project topic due

12 M Apr 4 Recursive linear search 10.4 10.2.7,9,10
quiz8 quiz8solutions
W Apr 6 Divide and conquer 10.5 Project 9.1 (p. 471)
Th Apr 7 Binary search 11-11.1 10.5.2,7
quiz8 quiz8solutions
F Apr 8 Selection sort 11.2

13 M Apr 11 Insertion sort 11.3
W Apr 13 Merge sort 11.4 Final project checkpoint
quiz9 quiz9solutions
Th Apr 14 Data Compression MacCormick, Ch. 7
F Apr 15 Networks 12-12.1 Project 10.2 (p. 531)

14 M Apr 18 Network algorithms 12.2
W Apr 20 Networks / Abstract Data Types
Th Apr 21 Exam review
F Apr 22 Exam 3

15 M Apr 25 Final project work day
W Apr 27 Presentations Final project due
Th Apr 28 Presentations
F Apr 29 Presentations / Evaluations Project 12.1 (p. 612)

16 M May 2 Course wrapup Paper3
Final Exam, Wednesday, May 4, 9-11am



© 2016