Computer Science 110
Foundations of Computing through Digital Media

Denison



Week Day Topic Reading
Assignment
Out
Assignment
Due
1
1/18
to
1/22
M Introduction and Class Overview Syllabus    
W Variables, numeric expressions, types Ch. 1    
R Lab 1: IDE, Turingscraft Ch. 2 Lab 1  
F Assignment, expressions, definite loops      
2
1/25
to
1/29
M No Class -- MLK Observance Downey Ch 1-3. Prelab 2  
W User Input and Output, Computing with Numbers Ch. 3   Turingscraft 1
R Lab 2: The Basics   Lab 2 Lab 1; Prelab 2
F Functions - Definition and Invocation Ch. 5    
3
2/1
to
2/5
M More functions; Begin objects and Graphics   Prelab 3 Turingscraft 2
W Test 1      
R Lab 3: Etch-a-sketch   Lab 3 Lab 2; Prelab 3
F Boolean Expressions and Conditionals Ch. 7 (exc. 7.4) Loop Practice on Turingscraft
 
4
2/8
to
2/12
M Booleans and conditionals continued Sec. 8.4 Prelab 4
 
W Test 1 Redux
    Turingscraft 3 on Loops (Tuesday midnight)
R Lab 4: Boolean Logic
  Lab 4 Lab 3; Prelab 4
F The if and if-else statements Ch. 7    
5
2/15
to
2/19
M Representing and adding integers as binary      
W Adding binary numbers as Boolean Function; Chained-if      
R Lab 5: Series and Sequences   Lab 5  
F Review; string intro Ch. 4   Turingscraft 4 on Boolean expressions and conditional
6
2/22
to
2/26
M Test 2      
W String Operations      
R Lab 6: UFO Tofu   Lab 6 Lab 5
F Strings; Intro Lists      
7
3/1
to
3/5
M Lists and Mutability      
W Circles (from test); List Manipulation and aliasing Handout   Turingscraft 5
R Lab 7: Secret Messages   Lab 7 Lab 6
F More List Manipulation; Reading from a file      
8
3/8
to
3/12
M Strings as objects; chr(), ord(), split()      
W while loops; file processing Ch. 8, sec 1-3    
R Practice with whiles, files, lists, and strings     Lab 7
F Test 3      
Spring Break, March 13 to March 21
9
3/22
to
3/26
M Test Review and Prelab08   Prelab 8  
W Fruitful Functions Think3; Think6    
R Lab 8: The Game of Life   Lab 8 Prelab 8
F Function invocation semantics and stacks; Test 2nd chance Ch. 6    
10
3/29
to
4/2
M Functions and aliasing; debugging      
W Functions returning diff types; debugging      
R Lab 9: Mindbending with Recursion   Lab 9 Lab 8
F Problem solving with Recursion Handout    
11
4/5
to
4/9
M More recursion Sec. 13.2    
W isPalindrome pairs programming      
R Lab 10: Recursion and Performance   Lab 10 Lab 9
F Searching I Sec 13.1    
12
4/12
to
4/16
M Searching II      
W Test 4      
R Additional Lab day for Lab 10/Project Proposals      
F Binary Search in Python; Sorting Intro Sec. 13.1   Lab 10, Final Project Proposal
13
4/19
to
4/23
M Sorting II      
W        
R        
F        
14
4/26
to
4/30
M        
W        
R Course Evals (till 10:50)      
F        
5/3 M Final Project Demonstrations      



 All rights reserved, Thomas C. Bressoud and Denison University
For problems or questions regarding this web contact bressoud@denison.edu.