Computer Science 1000, Fall '19
Course Diary
Copyright 2019 by H.T. Wareham
All rights reserved
Week 1,
Week 2,
Week 3,
Week 4,
(Midterm Exam Notes),
Week 5,
Week 6,
Week 7,
Week 8,
Week 9,
Week 10,
Week 11,
Week 12,
(Final Exam Notes),
Week 13,
(end of diary)
Wednesday, September 4 (Lecture #1)
[Textbook, Sections 1.1-1.3 and 1.5]
- Went over course outline (PDF).
- Introduction (Slides)[All]
- Recommended Reading (Online News):
Friday, September 6 (Lecture #2)
[Textbook, Sections 9 and 10]
- Algorithms and Programming (Slides)[#1-12]
- Recommended Reading (Online News):
Monday, September 9 (Lecture #3)
[Python Supplement, Sections 1, 2, and 3.2]
- Algorithms and Programming (Slides)[#12-18]
Wednesday, September 11 (Lecture #4)
[Python Supplement, Sections 3.1-3.3]
- Algorithms and Programming (Slides)[#19-27]
Friday, September 13 (Lecture #5)
[Python Supplement, Sections 3.1-3.3]
- Algorithms and Programming (Slides)[#28-35]
Monday, September 16 (Lecture #6)
[Textbook, Sections 2.1-2.3]
- Algorithms and Programming (Slides)[#36-47]
Wednesday, September 18 (Lecture #7)
[Textbook, Sections 2.1-2.3 and 3.4.2]
- Algorithms and Programming (Slides)[#48-59]
Friday, September 20 (Lecture #8)
[Textbook, Sections 2.1-2.3; Python Supplement, Section 5]
- Algorithms and Programming (Slides)[#60-68]
Monday, September 23 (Lecture #9)
[Python Supplement, Section 5]
- Algorithms and Programming (Slides)[#69-90]
- Recommended Reading:
- Brooks Jr. (1995)
- Campbell-Kelly (2003)
- Campbell-Kelly et al (2014)
- Ullman (1997, 2017)
Wednesday, September 25 (Lecture #10)
[Textbook, Sections 4.2.1 and 4.2,3]
- Binary Numbers (Slides)[#1-16]
Friday, September 27
- Student Climate Strike; lecture cancelled
Friday, September 27
- Midterm Exam Notes
I've finished making up the midterm exam. The exam will be
closed-book and use of notes, communication, or electronic devices will not
be allowed (see midterm exam procedure for these and other
details). *** YOU MUST BRING YOUR MUN ID CARD TO THE EXAM IN
ORDER TO BE ALLOWED TO WRITE THE EXAM *** The exam will be 50 minutes long and has a total of 50
marks (this is not coincidental; I have tried to make the number
of marks for a question approximately equivalent to the number of
minutes it should take you to do it). The exam will cover material
in all course lectures up to and including Lecture # 12 (i.e.,
Chapters 1-4 of the Textbook). There will be 9 questions:
- 1 true / false question with 7 parts (14 marks total / 2 marks per part)
- 8 multiple-choice questions (36 marks total / either 4 or 8 marks per question)
The breakdown of question marks by topic is Algorithms (12 marks),
(Python) Programming (24 marks), Binary Numbers (10 marks),
and Digital Circuits (4 marks).
Students registered with the Blundon Centre are encouraged to
contact the Centre ASAP to make arrangements for writing this
exam using the Centre's facilities.
I hope the above helps, and I wish you all the best of luck with
this exam.
Monday, September 30 (Lecture #11)
[Textbook, Section 4.2.1 and 4.2.2]
- Binary Numbers (Slides)[#17-26]
Wednesday, October 2 (Lecture #12)
[Textbook, Sections 4.2.2, 4.3, and 4.4.1-4.4.2]
- Binary Numbers (Slides)[#27-32]
- Digital Circuits (Slides)[#1-12]
Friday, October 4 (Lecture #13)
Monday, October 7
Wednesday, October 9 (Lecture #14)
[Textbook, Sections 4.4-4.6]
- Went over midterm exam.
- Digital Circuits (Slides)[#13-27]
Friday, October 11 (Lecture #15)
[Textbook, Sections 5.1-5.2]
- Digital Circuits (Slides)[#28-34]
- Computer Organization (Slides)[#1-5]
- Recommended Reading (Online News):
- Recommended Viewing (Documentaries)
Monday, October 14
- Midterm break: No lectures
Wednesday, October 16 (Lecture #16)
[Textbook, Sections 5.2.2-5.2.4]
- Computer Organization (Slides)[#6-15]
Friday, October 18 (Lecture #17)
[Textbook, Sections 5.2.4, 5.3, and 5.4]
- Computer Organization (Slides)[#16-33]
- Recommended Reading:
- Campbell-Kelly et al (2014)
- Cringely (1996)
- Freiberger and Swaine (2000)
- Kidder (1981)
- Williams (1997)
- Recommended Reading (Online News):
- Recommended Viewing (Documentaries)
Monday, October 21 (Lecture #18)
[Textbook, Sections 6.1, 6.2, 6.3.1, 6.3.2, and 6.3.3]
- System Software (Slides)[#1-18]
- Recommended Reading (Online News):
Wednesday, October 23 (Lecture #19)
[Textbook, Sections 6.3 and 6.4]
- System Software (Slides)[#19-29]
- Computer Databases (Slides)[#1-4]
- Recommended Reading:
- Beyer (2009)
- Campbell-Kelly et al (2014)
- Cringely (1996)
- Freiberger and Swaine (2000)
- Recommended Viewing (Documentaries)
- Recommended Viewing (Movies)
Friday, October 25 (Lecture #20)
[Textbook, Section 14.3 and 14.4]
- Computer Databases (Slides)[#5-16]
- Recommended Reading (Online News):
Monday, October 28 (Lecture #21)
[Textbook, Sections 14.4]
- Computer Databases (Slides)[#16-24]
- Suggest Viewing (Online)
Wednesday, October 30 (Lecture #22)
[Textbook, Sections 7.1-7.3 and 7.6]
- Computer Networks (Slides)[#1-12]
- Suggested Viewing (Vimeo)
- Recommended Reading (Online News):
Friday, November 1 (Lecture #23)
[Textbook, Sections 7.1-7.3 and 7.6]
- Computer Networks (Slides)[#13-28]
Monday, November 4 (Lecture #24)
[Textbook, Sections 7.4-7.6]
- Computer Networks (Slides)[#29-33]
- Suggested Reading:
- Campbell-Kelly et al (2014), Chapter 11 and 12
- Ceruzzi (2003), Chapter 9
- Cringeley (1996), Chapter 16
- Fisher (2018), Chapter 11.
- Rheingold (2000)
- Segaller (1999)
- Vargas (2010)
- Suggested Viewing (Documentaries)
- Suggested Viewing (Online)
- Suggested Viewing (Movies)
Wednesday, November 6 (Lecture #25)
[Textbook, Sections 8.1-8.2]
- Computer Security (Slides)[#1-15]
- Recommended Reading (Online News):
Friday, November 8 (Lecture #26)
[Textbook, Section 8.3]
- Computer Security (Slides)[#16-29]
- Links of interest:
- Online Resources:
- Suggested Reading:
- Kaplan (2016)
- Levy (2001, 2010)
- Zetter (2014)
- Recommended Reading (Online)
- Suggested Viewing (Documentaries):
Monday, November 11
- Remembrance Day: No lectures
Wednesday, November 13 (Lecture #27)
[Section 3.3-3.5; Course Notes]
- Theoretical Computer Science (Slides)[#1-20]
Friday, November 15 (Lecture #28)
[Section 12; Course Notes]
- Theoretical Computer Science (Slides)[#21-46]
Monday, November 18 (Lecture #29)
[Textbook, Sections 15.1-15.3]
- Artificial Intelligence (Slides)[#1-17]
- Recommended Reading:
- Recommended Reading (Online News):
Wednesday, November 20 (Lecture #30)
[Course Notes]
- Artificial Intelligence (Slides)[#18-28]
- Recommended Reading:
- Sites of Interest:
Friday, November 22
- Final Exam Notes
I've finished making up the final exam.
This exam will be
closed-book and use of notes, communication, or electronic devices will not
be allowed (see midterm exam procedure for these and other
details). *** YOU MUST BRING YOUR MUN ID TO THE FINAL EXAM IN ORDER TO
BE ALLOWED TO WRITE THIS EXAM.*** The exam will be 120 minutes long and has a total of 100
marks (this is not coincidental; I have tried to make the number
of marks for a question approximately equivalent to the number of
minutes it should take you to do it). The exam will cover material
in all course lectures up to and including Lecture # 32.
There will be 15 questions:
- 12 multiple-choice questions (48 marks / 4 marks per question)
- 2 true / false questions with 13 parts total (26 marks / 2 marks per part)
- 1 fill-in-the-blank question with 13 parts (26 marks / 2 marks per part)
The breakdown of question marks by topic is:
- Algorithms and Programming (14 marks),
- Binary Numbers (4 marks)
- Digital Circuits (16 marks)
- Computer Organization (8 marks),
- System Software (8 marks),
- Computer Databases (6 marks)
- Computer Networks (10 marks)
- Computer Security (10 marks)
- Theoretical Computer Science (8 marks)
- Artificial Intelligence (16 marks),
There will also be two bonus questions (the first long-answer, the second
fill-in-the-blank with three parts) worth an extra 10 marks.
I hope the above helps, and I wish you all the best of luck with
this exam.
Friday, November 22 (Lecture #31)
[Textbook, Sections 15.5.3, 15.5.5, 15.5.6, and 15.6]
- Artificial Intelligence (Slides)[#29-56]
- Recommended Reading:
- Markoff (2015)
- McCorduck (2004)
- Turkle (1984, 1997, 2011, 2015)
- Vonnegut Jr. (1952)
- Recommended Reading (Online News):
- Sites of Interest:
Monday, November 25 (Lecture #32)
[Course Notes]
- Artificial Intelligence (Slides)[#57-60]
- Where We're Going: The Wild Blue Yonder (Slides)
- Recommended Reading:
- Recommended Reading (Online News):
- Suggested Viewing (TV)
- Suggested Viewing (Movies):
Wednesday, November 27 (Lecture #33)
Friday, November 29 (Lecture #34)
- Review for final exam (Cont'd).
- Computer Databases (Slides)
- Computer Networks (Slides)
- Computer Security (Slides)
- Theoretical Computer Science (Slides)
- Artificial Intelligence (Slides)
References
- Beyer, K.W. (2009) Grace Hopper and the Invention of the Information
Age. The MIT Press.
- Brooks Jr., F.P. (1995) The Mythical Man-Month: Essays on Software
Engineering (Second Edition). Addison-Wesley Professional.
- Campbell-Kelly, M. (2003) From Airline Reservations to Sonic the Hedgehog:
A History of the Software Industry. The MIT Press; Cambridge, MA.
- Campbell-Kelly, M., Aspray, W., Ensmenger, N., and Yost, J.R. (2014)
Computer: A History of the Information Machine (3rd Edition).
Westview Press.
- Ceruzzi, P.E. (2003) A History of Modern Computing (Second
Edition). The MIT Press.
- Cringely, R.X. (1996) Accidental Empires: How the Boys of Silicon
Valley Make Their Millions, Battle Foreign Competition, and
Still Can't Get a Date. HarperBusiness.
- Epstein, R. (2007) From Russia With Love: How I got fooled (and somewhat humiliated)
by a computer" Scientific American Mind, October, 16-17.
- Fisher, A. (2018) Valley of Genius: The Uncensored History of
Silicon Valley, as Told by the Hackers, Founders, and Freaks Who
Made it Boom. Twelve; New York, NY.
- Freiberger, P. and Swaine, M. (2000) Fire in the Valley: The Making
of the Personal Computer (Collectors Edition). McGraw-Hill.
- Kaplan, F. (2016) Dark Territory: The Secret History of Cyber War. Simon & Schuster.
- Kidder, T. (1981) The Soul of a New Machine. Little, Brown, and Company.
- Levy, S. (2001) Crypto: How the Code Rebels beat the Government -- Saving Privacy in the Digital Age.
Viking; New York.
- Levy, S. (2010) Hackers: Heroes of the Computer Revolution (Second Edition).
O'Reilly.; Cambridge, MA.
- Markoff, J. (2015) Machines of Loving Grace: The Quest for Common Ground Between
Humans and Robots. Ecco.
- McCorduck, P. (2004) Machines Who Think: A Personal Inquiry into the History and
Prospects of Artificial Intelligence (Revised Edition). A. K. Petters; Natick,
MA.
- Rheingold, H. (2000) The Virtual Community: Homesteading on the
Electronic Frontier (Revised Edition). The MIT Press.
- Rheingold, H. (2012) Net Smart: How to Thrive Online. The MIT Press.
- Schneider, G.M. and Gersting, J.L. (2018) Invitation to Computer Science
(8th edition). Cengage. [Course Textbook]
- Segaller, S. (1999) Nerds 2.0.1: A Brief History of the Internet.
TV Books.
- Turkle, S. (1984) The Second Self: Computers and the Human Spirit. The
MIT Press.
- Turkle, S. (1997) Life on the Screen: Identity in the Age of the Internet.
Simon & Schuster.
- Turkle, S. (2011) Alone Together: Why We Expect More from Technology and
Less from Each Other. Basic Books.
- Turkle, S. (2015) Reclaiming Conversation: The Power of Talk in a Digital Age.
Penguin Press.
- Ullman, E. (1997) Close to the Machine: Technophilia and Its Discontents.
Picador; New York.
- Ullman, E. (2017) Life in Code: A Personal History of Technology.
MCD; New York.
- Vargas, J.A. (2010) "The Face of Facebook." The New Yorker, 20.
(PDF)
- Vonnegut Jr., K. (1952) Player Piano. MacMillan.
- Williams, M.R. (1997) A History of Computing Technology
(2nd Edition). IEEE Press: Los Alamitos, CA.
- Zetter, K. (2016) Countdown to Zero Day: Stuxnet and the Launch of the World's First Digital Weapon.
Crown Publishersp; New York.
Created: July 30, 2019
Last Modified: November 22, 2019