Logo
  • Home
  • Classes
  • Conveying Computing
  • Exams
  • Fractal Gallery
  • Guides
  • Problem Sets
  • Syllabus

Class 41: The Cake of Computing

Posted by David Evans on 5 Dec 2011 in Announcements, Book, Classes, Exams | 1 comment

Notes: [PDF]
Final Exam: [PDF] [Word Template]

Reid's Mutability Cake

Reid's Mutability Cake

Cutting the Mutability Cake

Cutting the Mutability Cake

Turing Machine with Cake Balls

Turing Machine with Cake Balls by Megan Dunne and Jamie Miller

There is no Halting Problem with Cake Balls!

Ada's Grammar Game

Ada's Grammar Game by Sarah Cole, Odette Kassar, Hannah Beattie, and Irma Corado

Explaining Ada's Grammar Game

Explaining Ada's Grammar Game

Leslie Valiant's AI Cake by Emily McClure and Margaret Neterval

Leslie Valiant's AI Cake by Emily McClure and Margaret Neterval

A Wonderful Computing Christmas

A Wonderful Computing Christmas by Julia Dangtran, Deidre Regan, Samah Hassan, and Deeksha Kola

Janie Willner, Chi Zhang, Jordan Chandler: Storybook

Storybook by Janie Willner, Chi Zhang, Jordan Chandler

Blowing out the Candles

Blowing out the Candles

Thanks to everyone for a great semester!

Class 40: GuardRails, Big Data, and Secure Computation

Posted by David Evans on 3 Dec 2011 in Announcements, Classes | Comments Off

There is still some more time available for presentations in class Monday, so the deadline for requesting to do a presentation is extended until 1pm Sunday (or when no more time is available). It is not required to do a presentation, but I do hope that teams that have produced something interesting will want to share it with the rest of the class.

Notes: [PDF]

Jonathan Burket, GuardRails: A (Nearly) Painless Solution to Web Application Security [PPTX] [GuardRails Website]

Virginia Smith, Big Data, Bees, and Buildings [Prezi Presentation]

Peter Chapman, Secure Computation on Mobile Devices [PPTX] [MightBeEvil.com]

Class 38: The Internet

Posted by David Evans on 28 Nov 2011 in Classes | Comments Off

Class 38: Slides [PPTX], Notes [PDF]

J.C.R. Licklider and Robert W. Taylor, The Computer as a Communication Device, 1968.

Tim Berners-Lee: Answers for Young People

Class 37: Computability in Theory and Practice

Posted by David Evans on 21 Nov 2011 in Classes, Exams | 2 comments
Class 37: Slides [PPTX]

Exam 2 is available now: [PDF]. Exam 2 is due at the beginning of class on Wednesday, 30 November.

If you prefer to type your answers for Exam 2 (which can include cut-and-pasting from your editor), you may use this Word template: [DOCX]. If you use the template, make sure you do not lose your formatting (including indenting) when you past into the boxes, and do not break the pagination of the exam. Please print the exam using single-sided printing.

Here’s the video on the philosophy of computability from today’s class:

Class 36: Halting Problem

Posted by David Evans on 16 Nov 2011 in Classes | 2 comments

Class 36: Slides [PPTX], Notes [PDF]

Here’s the movie from class today:



Mario – Determinism vs. Nondeterminism [video]
by Navid Hosseini, John Koelling, Trung Tran, and Ben Powell

The other movie we didn’t watch:


A Downfall Parody: P = NP [Video]
by Arthur Gordon, Allison Gurlitz, Stephen Lam, Eugene Moy

More conveying complexity submissions are here, including games, comic books, and stories.

Class 35: Self-Reference

Posted by David Evans on 14 Nov 2011 in Classes | Comments Off

Class 35: Slides [PPTX]

« Older Entries


Fall 2011

Register
Login

Help Schedule

(all in Davis Commons, except Dave's office hours in Rice 507)
Sundays, 1-6pm (Valerie/Joseph/Kristina)
Mondays, noon-1:30pm (Kristina)
Mondays, 1:15-2:00pm (Dave, Rice 507)
Tuesdays, 11am-noon (Dave, Rice 507)
Tuesdays, 5-8pm (Valerie/Jonathan)
Wednesdays, 5-6:30pm (Jiamin)
Thursdays, 9:45-11am (Dave, Rice 507)
Thursdays, 1-2:30pm (Joseph)
Thursdays, 4:30-7:30pm (Jonathan/Jiamin)
Fridays, noon-1:30pm (Peter)

Recent Posts

  • Course Wrap-Up
  • Class 41: The Cake of Computing
  • PS8 Submissions
  • Class 40: GuardRails, Big Data, and Secure Computation
  • Exam 2 Solutions

Recent Comments

  • David Evans on Problem Sets
  • jacob777 on Problem Sets
  • Prof. K.R. Chowdhary on Class 41: The Cake of Computing
  • Anon on Exams
  • Anon on Exams

Index

  • Classes
    • Class 1: Computing
    • Class 2: Language
    • Class 3: Rules of Evaluation
    • Class 4: Constructing Procedures
    • Class 5: Procedures Practice
    • Class 6: Programming with Data
    • Class 7: Programming with Lists
    • Class 8: Recursive List Procedures
    • Class 9: Consistent Hashing
  • Conveying Computing
  • Exams
  • Fractal Gallery
  • Guides
    • DrRacket Guide
    • Schemer’s Guide to Python
  • Problem Sets
    • Problem Set 0: Course Registration, Racket
    • Problem Set 1: Making Mosaics
      • PS1 Comments
    • Problem Set 2: Sequence Alignment
      • PS2 Comments
    • Problem Set 3: Limning L-System Fractals
      • PS3 – Comments
    • Problem Set 4: Constructing Colossi
      • PS4 – Comments
    • Problem Set 5: Wahoo! Auctions
      • PS5 Comments
    • Problem Set 6: Adventures in Charlottansville
      • PS6 Comments
    • Problem Set 7: Charming Snakes with Mesmerizing Memoizers
      • PS7 Comments
      • PS7 Responses
    • Problem Set 8 (Part 2): Typed Aazda
    • Problem Set 8: From Aazda to aaZda (Part 1)
      • PS8 Part 1 Comments
  • Syllabus
    • Course Pledge
  • Using These Materials

RSS BA Computer Science

RSS Jefferson’s Wheel

  • SoK: Let the Privacy Games Begin! A Unified Treatment of Data Inference Privacy in Machine Learning
  • CVPR 2023: Manipulating Transfer Learning for Property Inference
  • MICO Challenge in Membership Inference
  • Voice of America interview on ChatGPT

RSS Hacker News

  • Sandstorm: Open-source platform for self-hosting web apps
  • Moderation strike
  • Tell HN: My Reddit account was banned after adding my subs to the protest
  • Generative AI learning path
  • Mystery math whiz and novelist advance permutation problem

RSS Babbage

  • And it’s goodnight from us
  • Why 10, not 9, is better than 8
  • Future, imperfect and tense
  • The paperless dilemma
  • How to judge a ’bot; why it’s covered
cs1120 | RSS | Comments RSS | Book | Using These Materials | Login | Admin | Powered by Wordpress