Week | Date | Lecture/Lab Topic | Reading (to do before meeting) | Lecture Notes |
1 | 8/22 | No lab | ||
8/24 | Intro to class, syllabus; Intro to Computer Science; Intro to Law | CS111LawLecture1Complete.pdf | ||
8/26 | Active Learning, Intro to Python, Encryption, Privacy & the Government | How to Think Like a Computer Scientist, Chapter 1, General Introduction | ||
2 | 8/29 | First Lab! | How to Think Like a Computer Scientist, Chapter 2.1, 2.4 (Variables), 6.1 (Functions) | |
8/30 | Turning over crypto keys; variables, functions | CS111LawLecture3.pdf | ||
9/1 | Finish Variables; start Strings | Encryption_and_the_5th_Amendment.pdf, HTTLACS, Chapter 9.1-9.6 | CS111LawLecture4.pdf | |
3 | 9/5 | No Lab: Labor Day | ||
9/6 | Finish strings | HTTLACS Chapter 2.2, 2.5, 9.7, 9.9 | CS111LawLecture5.pdf | |
9/8 | Crypto keys when 3rd parties control the key; control structures | HTTLACS Chapter 4.4-4.5 (Skip the video in 4.4, which refers heavily to some drawing with turtles that we won't do), 7.1-7.5. | CS111LawLecture6.pdf | |
4 | 9/12 | First for loop: Shift a string | ||
9/13 | Web Crawlers & Open Access; More about functions and program design | HTTLACS Chapter 6.2-6.3, 6.5 (the first bit before it starts talking about drawing), 6.7-6.7; Open_Access.pdf | CS111LawLecture7.pdf | |
9/15 | Open Access (cont.), Repeating with While | HTTLACS , 8.1, 8.3, 8.5-8.7; pay especial attention to 8.3. | CS111LawLecture8.pdf | |
5 | 9/19 | Lab: Starting the web crawler: finding links in a page | ||
9/20 | Web crawler and while continued, else, intro to lists and range function | How to Think Like a Computer Scientist , Chapter 7.4 (review), Chapter 4.7 (ignore anything about turtles), Chapter 10.1-10.7, introducing lists. | CS111LawLecture9CS.pdf | |
9/22 | Review | Bring questions! How to Think Like a Computer Scientist, Chapter 10.14, and only really pay attention to append; we'll cover other methods later. |
CS11LawLec10-Exam1Review.pdf | |
6 | 9/26 | Review | ||
9/27 | EXAM I | |||
9/30 | CS111LawLecture11.pdf | |||
7 | 10/3 | Lab: Work with lists | How To Think Like a Computer Scientist Chapter 7.6-7.7 and 8.2 (nested if, elif, and more for) | |
10/4 | Files and the Supreme Court Database | How To Think Like a Computer Scientist Chapter 11.1-11.5. | CS111Law_Lecture12.pdf | |
10/6 | Supreme Court, Files (cont.), Modules | Modules: How To Think Like a Computer Scientist, Chapter 5.1-5.2. (Their main example for modules is the turtle module, which we won't use, but that's okay.) Supreme Court: Ruth Bader Ginsburg's Advice for Living, Justice Ginsburg, The New York Times, October 2, 2016 |
||
8 | 10/10 | Working with files | ||
10/11 | Supreme Court, Supreme Court Database | |||
10/13 | Pandas, Encodings, Modules | Modules: How To Think Like a Computer Scientist, Chapter 5.1-5.2 (modules). (Their main example for modules is the turtle module, which we won't use, but that's okay.) | CS111LawLecture15.pdf | |
9 | 10/17 | Working with zip files, the anaconda prompt in the lab | ||
10/18 | Modules (concluded), yet more Supreme Court, Lists (and on towards web crawler) |
How to Think Like a Computer Scientist Chapter 10.8, 10.10, 10.14, and 10.18. | CS111LawLectuere16CS.pdf | |
10/19 | CS111LawLecture17.pdf | |||
10 | 10/24 | |||
10/25 | CS111LawLecture18.pdf | |||
10/27 | Attend Distinguished Lecture! | Attend Harvey Mudd College President Maria Klawe's Distinguished Lecture "Getting more women into tech careers and why it matters", 605 SCE |
||
---|---|---|---|---|
11 | 10/31 | Boo! Lab quiz; review for exam | ||
11/1 | Review | Bring questions! | CS111LawLecture19.pdf | |
11/3 | EXAM II | |||
12 | 11/7 | Time to work on web Crawler | ||
11/8 | Web crawler questions answered; Start copyright | Vote before coming to class today!Read Easley & Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly Connected World , pages 1–9, and if you have time pages 23-32 (second bit can wait until before Thursday's class) |
CS111LawLecture20.pdf | |
11/10 | Network analysis, copyright continued | Easley & Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly Connected World , pages 23-32 (first portion Chapter 2). | CS111LawLecture21.pdf | |
13 | 11/14 | Analyzing a Twitter follower network | Recommended, not required: Facebook Questioning its own influence on 2016 Election | |
11/15 | Copyright & Network Analysis Continued, Dictionaries | How To Think Like a Computer Scientist, Chapter 12.1, Dictionaries | CS111LawLecture22.pdf | |
11/17 | Function return values, Dictionaries, social network analysis: privacy issues | CS111LawLecture23.pdf | ||
14 | 11/21 | Finish network analysis; start predictive policing heatmaps, using dictionaries to gather data | How To Think Like a Computer Scientist , Chapter 12.2-12.3 (more about dictionaries) | |
11/22 | Social network privacy issues continued; nested lists, matrices, drawing heat maps. | How To Think Like a Computer Scientist Chapter 10.23, nested lists | CS111LawLecture24Complete.pptx.pdf | |
11/24 | Happy Thanksgiving! | |||
15 | 11/28 | Lab quiz but no new lab assignment; time for Q&A and working on the final big homework assignment due Friday. | ||
11/29 | Predictive policing pros and cons, assistance and hints for predictive policing heatmap assignment due Friday | Matthew Hudson, Even Bugs Will Be Bugged: Exploring the next frontiers in surveillance The Atlantic, November 2016. | CS111Lecture25PartingThoughts.pptx.pdf | |
12/1 | Review for Final Exam | CS111LawLecture26Review.pptx.pdf |
Copyright 2016 The Board of Trustees of the University of Illinois.webmaster@cs.uic.edu |
WISEST Helping Women Faculty Advance Funded by NSF | ![]() | ![]() |