Final Exam

The final exam will be a 3-hour paper-and-pencil exam, with no computers or devices allowed. The exam will be cumulative, with emphasis on the last third of the course (lists, nested loops, dictionaries, objects, algorithms and complexity). You are encouraged to prepare two sheets of study notes (double-sided, 8.5"x11") that you may use during the exam. The exam will be administered self-scheduled in Twilight Hall 110. Days are Wed 5/13 through Mon 5/18 at the following hours (see the chart of self-scheduled exams at the top of the full exam schedule): Wed-Fri 5/13-15 at 9am-noon, 2-5pm, and 7-10pm; Sat 5/16 at 9am-noon and 2-5pm; Mon 5/18 at 9am-noon and 2-5pm. If you qualify for extra time, make arrangements with Jodi Litchfield in the ADA office and plan to take your exam there. You are encouraged to work through the Sample Final Questions and consult the provided sample solutions. Last night of tutoring will be Monday May 11. Professor Briggs will have office hours Monday 5/11 6:30-7:30pm and Wednesday 5/13 10am - 1pm.


This is a living schedule and subject to change TP - Think Python, C4A - CS for All

Date Topic Reading Notes Assignment
M 2/9 Intro to CS and the course   Slides, Survey  
W 2/11 Intro to Python TP 1-2 Slides, Spyder HW1 out
M 2/16 Strings and Functions TP 3.1-3.5, C4A 2.1-2.3, 2.5 Examples  
W 2/18 Writing functions TP 3.6-3.13, 6.1 Slides, Examples HW1 due, HW2 out
F 2/20 Lab Functions (HW2)      
M 2/23 Conditionals TP 5, C4A 2.6 Slides, Examples  
W 2/25 Recursion TP 6, C4A 2.7 Examples HW2 due, HW3 out
F 2/27 Lab Turtles (HW3)      
M 3/2 More recursion C4A 2.7-2.9 Slides, Examples, app  
W 3/4 Midterm review   Examples HW3 due, HW4 out
R 3/5 7:00p Midterm 1      
F 3/6 Lab Trees and Sierpinski (HW4)      
M 3/9 Binary arithmetic C4A 4.1-4.2 Slides  
W 3/11 Representing numbers C4A 4.2 Slides HW4 due, HW5 out
F 3/13 Lab Binary and recursion (HW5)      
M 3/16 Logic and Circuits C4A 4.3 Slides  
W 3/18 Architecture C4A 4.3-4.4 Slides HW5 due, HW6 out
F 3/20 Lab Circuits (Logisim, HW6)      
3/23-3/27 Spring break      
M 3/30 Architecture C4A 4.4 Slides  
W 4/1 Assembly C4A 4.5 Examples HW6 due, HW7 out
F 4/3 Lab HMMM (HW7)      
M 4/6 Iteration TP 7, C4A 5.3 Slides, Examples  
W 4/8 More iteration TP 9 (loops, not files) Examples HW7 due
F 4/10 No Lab Spring Symposium     Study questions (Solutions)
M 4/13 Lists TP 10 Examples and Transcript  
W 4/15 Midterm review   Examples HW8 out
R 4/16 7:00p Midterm 2      
F 4/17 Lab Loops (HW8)   Examples  
M 4/20 Data structures TP 11-12 Examples and Transcript  
W 4/22 More data structures TP 13, C4A 5.4-5.5 Examples HW8 due, HW9 out
F 4/24 Lab Using dictionaries (HW9)      
M 4/27 Objects TP 15-16 Examples and transcript  
W 4/29 More objects TP 17 Examples HW9 due, HW10 out
F 5/1 Lab Begin HW10      
M 5/4 Complexity C4A 7.2.1, NYTimes Slides, Examples  
W 5/6 More Complexity C4A 7.2.1 Notes and Examples  
F 5/8 Lab Continue HW10     Study questions (Solutions)
M 5/11 Review (9:05 in lab, 10:10 and 11:15 in MBH 104)     HW10 due
5/12-5/13 Reading Days      
5/13-5/18 Final Exam self-scheduled
See note above


Python Quick Reference
This is a reference for looking up the Python topics we have discussed in class.
Python Documentation
Official Python 3.4 Documentation.
This is a good place to work on your Python chops.
Installing Spyder
A quick guide on installing Python with the course libraries installed.
The logic simulator we will be using for the class.
HMMM Assembler
The files required to run the HMMM assembler and simulator. Direction can be found in the included README file. This is not required if you are using the Mac Spyder installation.