Ap Computer Science a Review Test 3 Answers
Answers and Review for Multiple Pick Exercise on Algorithms & Programming
Image courtesy of Pixabay
⛔STOP ⛔ Before you look at the answers, make sure you gave this exercise quiz a attempt and so you tin can assess your understanding of the concepts covered in Large Thought three. Click hither for the practice questions: AP CS: Principles Big Idea three Multiple Choice Questions.
Facts about the test: The AP CS: Principles exam has lxx multiple selection questions and you volition be given two hours (120 minutes) to complete the section. That ways it should take you effectually 10 minutes to complete vi questions. The following questions were not written by College Lath and, although they cover information outlined in the AP Informatics Principles Course and Test Description , the formatting on the test may be different.
1. How are list elements accessed individually?
A. The list name with an integer index in brackets.
B. The list name is with the value the code needs to admission.
C. The "access" control with the listing proper noun and length.
D. A FOR REACH loop with the list to find an individual value.
Explanation: Each element in the list has an index position.. for instance songList[4]
Read this guide to review lists!
2. What do logical conditions evaluate to?
A. a constant
B. a string
C. a real number
D. a boolean
Explanation: logical weather condition results are boolean.
Read this guide about boolean expressions!
3. Consider a four-chip binary sequences to represent nonnegative integers. For case, 0101 represents the decimal value 5. Using this, add the decimal values 14 and xv and assign the result to the variable total. Which of the following best describes the result?
A. 29 volition be assigned to the variable total.
B. An overflow error because 4 bits is non large enough to represent 29.
C. An overflow error because 4 bits is non large plenty to represent either of the values 14 or 15.
D. A round-off error because 14 and 15 are represented as approximations due to the fixed number of $.25 used.
Explanation: The largest four-bit binary number is 1111, or decimal xv. Since 29 > xv, an overflow error will occur.
Watch this guide on Unit of measurement 3!
4. You stop at a convenience store to purchase your favorite free energy potable. The cash register displays the modify you are owed as $0.049999999999 instead of 5 cents. What happened?
A. The Brandish procedure in the cash annals software has an mistake.
B. The computer is displaying in a unlike currency.
C. A rounding mistake happened because decimal values (similar money) are stored imprecisely
D. The change is existence displayed in hexadecimal rather than decimal
Explanation: floating point (decimals) are stored imprecisely which tin cause rounding errors... should non be used for money transactions.
Read this guide most variables and assignments!
v. Y'all pull into a public parking garage that assigns parking spots by automatic matching. When looking at the ticket, the parking space number is displayed in binary, but the actual parking spots are labeled in decimal. Which spot (in decimal) is 10011011?
A. 155
B. 154
C. 157
D. 9F
Caption: 128+16+viii+ii+1=155
6. Which statement is NOT true?
A. Depression-level languages are easier to debug since they are have fewer options.
B. Higher-level languages are easier to debug because the language is closer to natural language.
C. Depression-level languages provide less abstraction
D. High level languages are easier to code since they are more like natural language.
Caption: Low level languages are closer to motorcar language, which is tougher for people to debug
Watch this review of Large Idea iii!
seven. Which of the following are true about the data that tin can be represented using binary sequences?
A. Binary sequences can be used to represent strings of characters.
B. Binary sequences tin be used to represent colors.
C. Binary sequences can be used to correspond audio recordings.
D. All of the above
Explanation: All digital data is represented at the lowest level as sequences of bits.
eight. Consider the following code segment (see beneath). Which variables have a value of 50 after the segment runs?
A. x
B. y
C. 10 and z
D. x, y, and z
Explanation: The first three statements assign values to the variables. The 4th argument assigns 50 to x. The fifth statement assigns 75 to y. The sixth argument assigns 50 to z.
Read this guide well-nigh variables and assignments!
9. For a binary search to give authentic results, what must be true of the information?
A. The information must exist unsorted before the search
B. The data must be sorted before the search
C. The data must not take duplicate or repeated values
D. The data must be fewer than a billion records
Explanation: Binary search depends on data being sorted
Read this guide well-nigh binary search!
x. What does iteration with information science loops mean?
A. Repeating a cake of lawmaking until a condition is met
B. Executing code once
C. Duplicating a department of code multiple times in a program
D. Identifying error conditions in a program
Explanation: Iteration ways "repeat", and so a loop volition echo until a condition is met causing it to cease
Read this guide most iteration!
11. Three numbers need to be put into order from smallest to greatest. Which of the following algorithms can be used to accomplish this?
A. If the showtime number is greater than the middle one, swap them. Then, if the middle number is greater than the last one, bandy them. Then, if the beginning number is greater than the concluding, swap them.
B. If the first number is greater than the middle one, swap them. Then, if the heart number is greater than the concluding, swap them.
C. If the first number is greater than the last, bandy them. Then, if the first number is greater than the eye number, swap them.
D. If the first number is greater than the middle, swap them. Then, if the heart number is greater than the final, swap them. Then, if the first number is greater than the middle, swap them.
Caption: After comparing the first and middle numbers and potentially swapping them, and then comparing the middle and last numbers and potentially swapping them, the largest number will exist in the third position. Adjacent, after comparing the get-go and heart numbers and potentially swapping them, the iii volition be ordered from least to greatest.
Read this guide nearly algorithms!
12. What order has the programming languages in most abstruse to least abstract guild?
A. cake-based language, text-based language, automobile language assembly linguistic communication
B. text-based linguistic communication, assembly language, cake-based language, machine language
C. block-based language, text-based language, assembly language, machine language
D. machine language associates language, block-based linguistic communication, text-based language,
Caption: block based is closest to natural language and and then most abstruse. Text based is easy to read & use. Machine & computer language are hardest for people to piece of work with.
Lookout this review of Big Idea 3!
13. Which of the following is the best meaning for heuristic in informatics?
A. A heuristic is a sequential set of specific steps used to solve a precise trouble
B. A heuristic is a shortcut that sacrifices accuracy and completeness.
C. A heuristic is the act of using a computer to find specific solutions to a problem that cannot exist solved past hand.
D. A heuristic is to the method used to make up one's mind whether there exists an consignment to a set of variables which satisfies specified constraints between pairs of variables
Caption: definition of heuristic
Read this guide on Algorithmic Efficiency!
xiv. What is the value of y after the following statements?
A. 0
B. 2
C. three
D. iv
Caption: Modernistic gives the balance when ii numbers are divided.
Lookout this review of Large Idea iii!
xv. Which of the post-obit will demonstrate that the problem is undecidable?
A. Prove that for i instance of the problem, an algorithm that runs in unreasonable time can be written that is capable of providing a correct yes-or-no answer.
B. Prove that for i instance of the problem, an algorithm that runs in unreasonable time can be written that is capable of providing a right yes-or-no answer.
C. Evidence that for one instance of the problem, an algorithm can be written that is always capable of providing a correct yes-or-no reply.
D. Show that for one instance of the problem, no algorithm can exist written that is capable of providing a correct yes-or-no answer.
Explanation: An undecidable problem is one for which no algorithm can be synthetic that is always capable of providing a correct yes-or-no answer. In that location is no algorithmic solution that can solve all instances of the problem.
Read this guide about Undecidable Problems!
What can we help you do now?
- 🔍Cheque out all of the resources for AP CS: P Large Idea iv
- 🦘Jump to AP CS: P Big Idea iv Multiple Choice Questions
-
🤝Connect with other students studying AP CS: P with Hours
Resources:
Source: https://library.fiveable.me/ap-comp-sci-p/big-idea-3/mc-answers-review/study-guide/eGMT7FvkwvXRCQqJw3uu
0 Response to "Ap Computer Science a Review Test 3 Answers"
Post a Comment