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

Problem Sets

  • Problem Set 0: Racket Hack It (Due Sunday, 28 August) - course registration, getting started with Scheme and DrRacket
  • Problem Set 1: Making Mosaics (Due: Monday, 5 September) - Divide-and-Conquer Problem Solving, Introduction to Procedures [Comments]
  • Problem Set 2: Sequence Alignment (Due: Wednesday, 14 September) - Programming with Data [Comments]
  • Problem Set 3: L-System Fractals (Due: Friday, 23 September) - Lists, List Recursion [Comments]
  • Problem Set 4: Constructing Colossi (Due: Monday, 3 October) - Lists and Procedures Review; Machines [Comments]
  • Problem Set 5: Wahoo! Auctions (Due: Friday, 21 October) - Programming with State; Running Time Analysis [Comments]
  • Problem Set 6: Adventures in Charlottansville (Due: Monday, 7 October) - Programming with Objects; Python [Comments]
  • Problem Set 7: Charming Snakes with Mesmerizing Memoizers (Due: Wednesday, 16 November) - Implementing Languages [Comments] [Responses]
  • Problem Set 8. Java option:
    • Problem Set 8 (Part 1): Aazda (Due: Monday, 21 November) [Comments]
    • Problem Set 8J (Part 2): Typed Aazda (Due: Monday, 5 December)
All assignments are due at the beginning of class on the scheduled day, unless otherwise noted.
Print Friendly Print Get a PDF version of this webpage PDF

4 Responses to “Problem Sets”

  1. Michael Carmone says:
    20 September 2011 at 11:12 pm

    Mr. Evans, I think we have a problem. I tried Googling some data on L-systems and one of the first things that showed up on the front page were comments from a previous Problem Set 3, I just thought I should put it out there. I don’t know from which year this is from or if it’s okay to use the information is contains.

    Log in to Reply
    • David Evans says:
      20 September 2011 at 11:19 pm

      Please read the course pledge (you should have already read and signed), as well as the collaboration policy at the beginning of PS3. It should be very clear from all of these, that it would both defeat the purpose of doing the problem set, and violate the honor policy for the class, to misuse these materials. I rely on students following the honor policy to make assignments worthwhile and fair, so I do not consider it a problem that it is easy for students who behave dishonorably to find solutions to past problem sets, which are often similar to the problem sets you are doing this year. This would only be a problem if there are students misusing these materials, which would be a violation of the honor policy, not to mention a waste of your time and mine, and unfair to your fellow classmates.

      Log in to Reply
  2. jacob777 says:
    28 October 2012 at 7:27 pm

    Mr Evans, do you have all of the answers to your computing book? I am going through ti right now and it seems that all the answers are not there. I started learning from you at Udacity, it would be great if I could obtain these to check my work, thank you!

    Log in to Reply
    • David Evans says:
      28 October 2012 at 7:50 pm

      Hi Jacob – there are answers to some (but not all) of the questions in the “Exercises and Solutions” documents for the early chapters here: http://www.computingbook.org/. Sorry I haven’t finished writing solutions for all the problems, but perhaps you can write some good solutions to contribute!

      Log in to Reply

Leave a Reply Cancel reply

You must be logged in to post a comment.


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

  • Dissecting Distribution Inference
  • Cray Distinguished Speaker: On Leaky Models and Unintended Inferences
  • Attribute Inference attacks are really Imputation
  • Congratulations, Dr. Jayaraman!

RSS Hacker News

  • Russhian Roulette: 1/6 chance of posting your SSH private key on pastebin
  • Diff Models – A New Way to Edit Code
  • Detect ChatGPT Generated Content
  • Kotlin Data Classes 101: Understanding Syntax, Usage and Inheritance
  • 30k lines of SwiftUI in production later

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