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 W Oct 02 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 F Oct 04 Lec #2 Introduction to Programming R&S: Programming Basics  
2 M Oct 07 Lec #3 Conditionals, basic lists, for loops R&S: Control Flow  
2 W Oct 09 Lec #4 Lists, strings R&S: Lists, Tuples & Strings  
2 F Oct 11 Lec #5 Functions R&S: Introduction to Functions  
2 Sat Oct 12       PA #1: Simulating SIR (solo)
3 M Oct 14 Lec #6 More functions R&S: Introduction to Functions  
3 W Oct 16 Lec #7 Page rank example    
3 F Oct 18 Lec #8 Dictionaries R&S: Dictionaries PA #2: Schelling (pairs allowed)
4 M Oct 21 Lec #9 Files R&S: Working with Files  
4 W Oct 23 Lec #10 Data Types R&S: Implementing a data structure: stacks and queues  
4 F Oct 25 Lec #11 Classes R&S: Classes and Objects PA #3: Twitter (solo)
5 M Oct 28 Lec #12 More Classes    
5 M Oct 28   EXAM (7:30-9:30pm) EXAM (7:30-9:30pm) EXAM (7:30-9:30pm)
5 W Oct 30 Lec #13 More Classes    
5 F Nov 01 Lec #14 M/D/1 Queues    
6 M Nov 04 Lec #15 Numpy    
6 W Nov 06 Lec #16 Numpy R&S: Numpy  
6 F Nov 08 Lec #17 Pandas   PA #4: Polling places (pairs allowed)
7 M Nov 11 Lec #18 Pandas R&S: Pandas  
7 W Nov 13 Lec #19 Pandas    
7 F Nov 15 Lec #20 Functional Programming   PA #5: Linear Regression (solo)
8 M Nov 18 Lec #21 Functional Programming    
8 W Nov 20 Lec #22 Recursion R&S: Recursion  
8 F Nov 22 Lec #23 Recursion   PA #6: Traffic Stop Data (pairs allowed)
9 M Nov 25 Lec #24 Recursive Data Structures R&S: Trees  
9 W Nov 27 Lec #25 Text Processing    
9 F Nov 29   Holiday    
10 M Dec 02 Lec #26 TBD    
10 W Dec 04 Lec #27 Wrap-up   PA #7: Treemaps (solo)