COMPSCI 10 Final: cs10-fa2011-final-Garcia-soln

36 views8 pages
8 Jan 2019
School
Professor
University of California, Berkeley – College of Engineering
Department of Electrical Engineering and Computer Sciences
Fall 2011 Instructor: Dan Garcia 2011-12-13
Last Name
ANSWERS
First Name
Student ID Number
cs10- Login First Letter
a b c d e f g h i j k l m
cs10- Login Last Letter
a b c d e f g h i j k l m
n o p q r s t u v w x y z
The name of your LAB TA (please circle)
Aijia Glenn Luke Navin Rabbit Samir
Name of the person to your Left
Name of the person to your Right
All my work is my own. I had no prior knowledge of the exam
contents nor will I share the contents with others in CS10 who have not
taken it yet. (please sign)
Instructions
Don’t Panic!
This booklet contains 6 pages including this cover page. Put all answers on these pages; don’t hand in
any stray pieces of paper.
Please turn off all pagers, cell phones and beepers. Remove all hats and headphones.
You have 170 minutes to complete this exam. The final is closed book, no computers, no PDAs, no cell
phones, no calculators, but you are allowed three double-sided sets of notes. There may be partial
credit for incomplete answers; write as much of the solution as you can. When we provide a blank,
please fit your answer within the space provided.
Question
1
2
3
4
5
6
7
8
9
10
12
13
14
15
Online
Total
Points
2
2
2
2
2
2
2
2
2
2
10
10
10
10
15
80
Score
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 8 pages and 3 million more documents.

Already have an account? Log in
Short-answer Questions (2 pts each, we drop lowest score)
Question 1: Briefly name one practical application for IBM’s Watson technology. (aside from mobile phones)
Question-answering seemed to be a good fit. In the last decade, question-
answering systems have become increasingly important for firms dealing with
mountains of documents. Legal firms, for example, need to quickly sift through
case law to find a useful precedent or citation; help-desk workers often have to
negotiate enormous databases of product information to find an answer for an
agitated customer on the line.
Question 2: Argue both perspectives of the game theory debate using only one sentence each.
A weak solve is better than a strong solve because
A strong solve is better than a weak solve because
If all you care about is the theoretic
value, it’s much faster
You know the value of EVERY position, so
your AI can be perfect, and/or you can
kibbitz/comment on human-human play.
Question 3: What are the ugly, difficult details of programing a hundred-thousand-node compute cluster that
the elegant MapReduce abstraction hides from the user?
Handling machine failures, load balancing, dispatching and collecting
Question 4:Cloud computing is great, but it’ll never work with Big Data, since the cost and/or time of
transporting large datasets to/from the cloud is too great.” Circle True or False and explain in one sentence.
False you can either fedex hard disks or use their “pay as you go” fast network
Question 5: How is Pandoraable to satisfy the demand of its 100+ Million users with so few media servers?
Three ideas: (1) only 1/10th are active daily (2) Data locality i.e., a small
number of songs are played a large number of times, and (3) the data requirements
are actually quite small since it’s streaming (128 Kib/s) not storage.
Question 6: What’s the hardest thing Twitter has to do (from an engineering point of view)?
Make it all work (i.e., tweets from all senders to all receivers) in seconds.
Question 7: Prof Yelick said computing is addressing two global challenges. One was “our changing world:
understanding climate change, alternative energy sources, mitigation techniques, etc.What was the other?
Health and medicine understanding the human body, development of treatments,
and disease prevention
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 8 pages and 3 million more documents.

Already have an account? Log in
Question 8: You need to find an efficient polynomial-time algorithm (exact) solution to a tough problem, but
you’re not succeeding. However, you do prove your problem is NP-complete. How does that help?
You have proved that your problem is just as hard as many, many other problems
which have no poly-time solution yet AND if anyone solves any of those, you get
yours solved too!
Question 9: How could quantum computers help with the subset problem? That’s 2n combinations to test!
Quantum computers can solve the problem in 2n/2 time, a huge difference!
It marked the first time courts said people were responsible where their bits
went (in this case, out of state to a location with a different obscenity
standard)
Question 10: In 1994, a couple in Milipitas (in CA near here!) were convicted because their bulletin board,
dubbed “The Nastiest Place on Earth”, contained obscene material. Why was this an important ruling?
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 8 pages and 3 million more documents.

Already have an account? Log in

Document Summary

University of california, berkeley college of engineering. The name of your lab ta (please circle) I had no prior knowledge of the exam contents nor will i share the contents with others in cs10 who have not taken it yet. (please sign) This booklet contains 6 pages including this cover page. Put all answers on these pages; don"t hand in any stray pieces of paper. Please turn off all pagers, cell phones and beepers. You have 170 minutes to complete this exam. The final is closed book, no computers, no pdas, no cell phones, no calculators, but you are allowed three double-sided sets of notes. There may be partial credit for incomplete answers; write as much of the solution as you can. When we provide a blank, please fit your answer within the space provided. Question 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 online total.