Exam (elaborations)
AP CSP UNIT 6 COLLEGE BOARD QUESTIONS AND VERIFIED ANSWERS
- Course
- Institution
AP CSP UNIT 6 COLLEGE BOARD QUESTIONS AND VERIFIED ANSWERS
[Show more]
Seller
Follow
Content preview
AP CSP UNIT 6 COLLEGE BOARDQUESTIONS AND VERIFIED ANSWERS
A uteam uof uprogrammers uis udesigning usoftware. uOne uportion uof uthe uproject
upresents ua uproblem ufor uwhich uthere uis unot uan uobvious usolution. uAfter usome
uresearch, uthe uteam udetermines uthat uthe uproblem uis uundecidable. uWhich uof
uthe ufollowing ubest uexplains uthe uconsequence uof uthe uproblem ubeing
uundecidable?
A) uThe uproblem ucan ube usolved ualgorithmically, ubut uit uwill urequire uan
uunreasonably ulong uamount uof utime.
B) uThe uproblem ucan ube usolved ualgorithmically, ubut uit uwill urequire uan
uunreasonably ularge uamount uof udata ustorage.
C) uThere uis uno upossible ualgorithm uthat ucan ube uused uto usolve uall uinstances
uof uthe uproblem.
D) uThere uare useveral udifferent upossible ualgorithms uthat ucan usolve uthe
uproblem, ubut uthere uis ucontroversy uabout uwhich uis uthe umost uefficient. u-
ucorrect uanswers-C
A ustudent uwants uto udetermine uwhether ua ucertain uproblem uis uundecidable.
uWhich uof uthe ufollowing uwill udemonstrate uthat uthe uproblem uis uundecidable?
A) uShow uthat ufor uone uinstance uof uthe uproblem, uan ualgorithm ucan ube uwritten
uthat uis ualways ucapable uof uproviding ua ucorrect uyes-or-no uanswer.
B) uShow uthat ufor uone uinstance uof uthe uproblem, uno ualgorithm ucan ube uwritten
uthat uis ucapable uof uproviding ua ucorrect uyes-or-no uanswer.
C) uShow uthat ufor uone uinstance uof uthe uproblem, ua uheuristic uis uneeded uto
uwrite uan ualgorithm uthat uis ucapable uof uproviding ua ucorrect uyes-or-no uanswer.
, D) uShow uthat ufor uone uinstance uof uthe uproblem, uan ualgorithm uthat uruns uin
uunreasonable utime ucan ube uwritten uthat uis ucapable uof uproviding ua ucorrect
uyes-or-no uanswer. u- ucorrect uanswers-B
Which uof uthe ufollowing ubest uexplains uhow ualgorithms uthat urun uon ua
ucomputer ucan ube uused uto usolve uproblems?
A) uAll uproblems ucan ube usolved uwith uan ualgorithm uthat uruns uin ua ureasonable
uamount uof utime.
B) uAll uproblems ucan ube usolved uwith uan ualgorithm, ubut usome ualgorithms
umight uneed ua uheuristic uto urun uin ua ureasonable uamount uof utime.
C) uAll uproblems ucan ube usolved uwith uan ualgorithm, ubut usome ualgorithms
umight urun uin uan uunreasonable uamount uof utime.
D) uSome uproblems ucannot ube usolved uby uan ualgorithm. u- ucorrect uanswers-D
Which uof uthe ufollowing uis ua ubenefit uof uusing ua usimulation uinstead uof uan
uexperiment uto umake ua uprediction? uSelect utwo uanswers.
A) uA usimulation uallows uinvestigation uof ua uphenomenon uwithout uthe ureal-world
ulimitations uon utime, usafety, uor ubudget.
B) uA usimulation ucan ube uused uto umodel ureal-world uevents uthat uare
uimpractical ufor uexperiments.
C) uA usimulation ualways uproduces uthe usame uoutput, uso uits uresults ucan ube
uverified.
D) uA usimulation uproduces uresults uthat uare umore uaccurate uthan uexperimental
uresults. u- ucorrect uanswers-A, uB
A ucity uplanner uis uusing usimulation usoftware uto ustudy ucrowd uflow uout uof ua
ularge uarena uafter uan uevent uhas uended. uThe uarena uis ulocated uin uan uurban
ucity. uWhich uof uthe ufollowing ubest udescribes ua ulimitation uof uusing ua
usimulation ufor uthis upurpose?
A) uThe umodel uused uby uthe usimulation usoftware ucannot ube umodified uonce
uthe usimulation uhas ubeen uused.
B) uThe umodel uused uby uthe usimulation usoftware uoften uomits udetails uso uthat
uit uis ueasier uto uimplement.
C) uRunning ua usimulation urequires umore utime uto ugenerate udata ufrom utrials
uthan uobserving uthe ucrowd uexiting uthe uarena uat uvarious uevents.
D) uRunning ua usimulation urequires ua ularge unumber uof uobservations uto ube
ucollected ubefore uit ucan ube uused uto uexplore ua uproblem. u- ucorrect uanswers-B
In uwhich uof uthe ufollowing uscenarios uwould ua usimulation ube uthe uLEAST
ubeneficial?
A) uAn uengineering ucompany uwants uto utest uwhether ua uchange uto ua ucar
udesign uwill unegatively uaffect ufuel uefficiency.
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller CATEJOHNS. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $11.49. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
79223 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now