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

Friday’s Class, Problem Set 8 Options

Posted by David Evans on 10 Nov 2011 in Announcements, Problem Sets | 1 comment

I don’t plan to go into any more depth on the interpreter in Friday’s class, but if there are any aspects of it that are unclear at this point, please let me know and I will cover them on Friday. Otherwise, you should have a clear understanding now of everything in the interpreter, and feel confident that you will be able to modify it as needed for Problem Set 7.

There are three options for Problem Set 8:

  • Plan J: Learn to program in Java, extend a Java implementation of an interpreter for a Charme-like language to support static type checking. This is the option that must be selected for students who take cs2110 in the Spring. Everyone is welcome to do this option, but if you indicated any interest in BA Computer Science as a first or second major on your course registration survey (Problem Set 0), you are expected to select and complete this option. If you indicated interest in the CS major but prefer to do a different option, you must send me a good explanation of why you prefer the other option.
  • Plan C: Conveying Computing. For this option, you will create an artifact that explains something relevant to computer science to a target audience. You can define your target audience but should specify what it is. Examples of target audiences include “typical third graders”, “your parents”, “UVa students majoring in history”, “Martians”, “introductory cs students”. Your artifact can be anything you want that can be posted on the Internet. Examples of possible artifacts include improving a Wikipedia page, a story, a comic, a video, a song (with lyrics), or an interpretive dance. If your artifact cannot be posted on the Internet (for example, if you bake a cake, build a quantum computer, or develop a time machine) you should still post a description of your artifact (including a picture if helpful). For some inspiration on this, you may want to look at what students in the cs3102: Theory of Computation course did for a similar assignment: Conveying Complexity Highlights.
  • Plan W: build a dynamic web application or Android application. We won’t be able to provide much help with this, but if you want to do this you may find it helpful to look at assignments from previous cs1120 courses where this was the only option for Problem Set 8: HoosHungry.com?, Make a Dynamic Web Application.

For all of the options you make work alone. For Plan J, you may collaborate with other students, but everyone will need to write and turn in their own code to ensure you are all well prepared to take cs2110. For the other options, you may partner with as many students as you want, but the impressiveness of your artifact or application should scale at least as (sqrt N) of the number of students in your team (i.e., if your team has 4 students, you would be expected to do something at least twice as impressive as what a single-student team could do).

You need to declare which plan you are doing by submitting the PS8 Commitment Form by 5:00pm on Monday, 14 November.

Print Friendly Print Get a PDF version of this webpage PDF

One Response to “Friday’s Class, Problem Set 8 Options”

  1. Deirdre Regan says:
    14 November 2011 at 7:21 pm

    I thought I might share this in case anybody doing Plan W would like some inspiration from THE cutest kid ever!

    http://www.good.is/post/this-sixth-grade-developer-is-teaching-students-how-to-make-apps?utm_campaign=daily_good2&utm_medium=email_daily_good2&utm_source=popular_post_link&utm_content=Searching%20for%20Water%20in%20an%20Untapped%20Source%3A%20the%20Air


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

  • MICO Challenge in Membership Inference
  • Voice of America interview on ChatGPT
  • Uh-oh, there's a new way to poison code models
  • Trojan Puzzle attack trains AI assistants into suggesting malicious code

RSS Hacker News

  • Epic’s new motion-capture animation tech has to be seen to be believed
  • Hindenburg Research Outs Block Inc as Fraud
  • Mathematicians discover shape that can tile a wall and never repeat
  • F-150 Lightning Recall Due to SK Cells
  • Nvidia Tackles Chipmaking Process, Claims 40X Speed Up with CuLitho

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