CalendarΒΆ

Note

You can find an HTML version of the current draft of Rogers and Sotomator (R&S) here and a pdf version here. You will need to authenticate yourself with your CNetID and password to gain access to these pages.

Week Day Date Type Topic Readings Due
1 M Oct 1 Lec #1 Course Introduction R&S: Computational Thinking, Computational Thinking by J.Wing, (Optional) How the Matching Algorithm Works & (Optional) National Resident Match Program  
1 W Oct 3 Lec #2 Introduction to Programming R&S: Programming Basics  
1 F Oct 5 Lec #3 Conditionals, basic lists, for loops R&S: Control Flow  
2 M Oct 8 Lec #4 Lists, strings R&S: Lists, Tuples & Strings  
2 W Oct 10 Lec #5 Functions R&S: Introduction to Functions  
2 F Oct 12 Lec #6 More functions R&S: Introduction to Functions PA #1: Simulating SIR (solo)
3 M Oct 15 Lec #7 Page rank example    
3 W Oct 17 Lec #8 Dictionaries R&S: Dictionaries  
3 F Oct 19 Lec #9 Files R&S: Working with Files PA #2: Schelling (pairs allowed)
4 M Oct 22 Lec #10 Data Types R&S: Implementing a data structure: stacks and queues  
4 W Oct 24 Lec #11 Classes R&S: Classes and Objects  
4 F Oct 26 Lec #12 More Classes   PA #3: Twitter (solo)
5 M Oct 29 Lec #13 More Classes    
5 M Oct 29 EXAM EXAM (7:00-9:00pm) EXAM (7:00-9:00pm) EXAM (7:00-9:00pm)
5 W Oct 31 Lec #14 M/D/1 Queues    
5 F Nov 2 Lec #15 M/D/1 Queues    
6 M Nov 5 Lec #16 Numpy R&S: Numpy  
6 W Nov 7 Lec #17 Numpy    
6 F Nov 9 Lec #18 Pandas R&S: Pandas PA #4: Polling places (pairs allowed)
7 M Nov 12 Lec #19 Pandas    
7 W Nov 14 Lec #20 Pandas    
7 F Nov 16 Lec #21 Functional Programming   PA #5: Linear Regression (solo)
8 M Nov 19 Lec #22 Functional Programming    
8 W Nov 21 Lec #23 Text Processing    
8 F Nov 23   Holiday    
9 M Nov 26 Lec #24 Recursion R&S: Recursion  
9 W Nov 28 Lec #25 Recursion   PA #6: Traffic Stop Data (pairs allowed)
9 F Nov 30 Lec #26 Recursive Data Structures R&S: Trees  
10 M Dec 3 Lec #27 TBD    
10 W Dec 5 Lec #28 Wrap-up   PA #7: Treemaps (solo)