15-110 Spring 2011
Lecture Notes

• Case Study: Analog Stopwatch
• Case Study: Tic-Tac-Toe / Connect4
  

• Case Study: Snake

• Getting Started with Events and Animations

• Midterm1 Solutions
  
• Getting Started with Graphics

• Debugging
• Review of hw4 (makeSubtable)

• Recursion (Part 1)

• File IO Practice
• Code Tracing Practice
• Reasoning-About-Code Practice

• File IO
• Monte Carlo Methods
• Style

• Automated Plagiarism Detection Video (AVI  or  MP4)
• Optional Practice (More Problem-Solving with Lists, Loops, and Conditionals)
• Optional Video:  Creation of the Computer (from Cracking Enigma to Shooting the Moon to the Dawn of the PC Era)

• 2d Lists
• 2d Lists Practice (Problem-Solving)

• 1d Lists Practice (Problem-Solving)

• 1d Lists
  

• Conditionals and Loops Practice (Problem-Solving)
  

• Week 2 Redux
1. Addendum:  String containment ("find" and "in")
2. Lecture 2.1
3. Lecture 2.2
   
• Conditionals
  
• Loops
  

• Writing Functions
  
• Writing Functions:  Annotated Examples  (Self-Study)
  
• Writing Functions:  Practice (Problem-Solving)
  

• Getting Started with Python
  
• Console I/O
  
• Data and Expressions
  

• Abstraction
1. Boolean Logic
• Algorithms
1. Searching and Sorting Basics
2. Linear Search
3. Binary Search
4. Selection Sort
5. Merge Sort
6. Satisfiability and Knights and Knaves
• Analysis
1. Correctness
2. Efficiency
• Human Computation (Time permitting)
1. Searching + Sorting
2. Knights and Knaves
   

• Preliminaries
•  Introductions + Course Staff Photos
• Course syllabus (Course Policies)
• Course calendar and Major Events (Midterms, Term Project, Final)
• Course Topic Map (The 5 A's of Computing)
• Data Abstraction Hierarchy
• Context 1:  Computational Thinking
  

carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem