1. AP Computer Science DYRT Quiz 15.01-0 5
Take out a piece of paper and PEN.
The quiz starts TWO minutes after the tardy bell rings.
You will have 30 seconds per question.

2. Title the quiz as shown below The quiz starts in ONE minute.
Name
Period
Date
Quiz 1. 2. 3. 4. 5. 6. 7. 8. 9
10.
EC.

3. Question 01 Which of these is a fundamental design rule?
Write your program is a clear consistent style.
Use meaningful, self-documenting identifiers.
Create modules for recognizable tasks.
Place common purpose module in a class.
All of the above

4. Question 02 What are the three areas of design compromise?
speed - reliability - memory
reliability - memory - readability
memory - speed - reliability
speed - memory - readability

5. Question 03 There can be no compromise in the area of speed. memory.
readability.
reliability.

6. Question 04 Program specifications can be simplified to
statements placed inside the main method.
input - output.
input - process - output.
providing required algorithms.

7. Question 05 Top-down approach means general to specific.
specific to general.
concentrate on the program start only.
create an algorithm without concern about program source code.

8. Question 06 A class encapsulates numerical and string data.
the data and actions that process the data.
get methods and set methods.
constructors and methods.

9. Question 07 When writing solutions for free response class
design questions, you should declare
attributes public and methods public.
attributes private and methods private.
attributes public and methods private.
attributes private and methods public.

10. Question 08 What is true about constructor declarations?
Constructors are usually public.
Constructors are usually private.
Constructors must be public.
Constructor must be private.

11. Question 09 Method design involves considering pre-conditions.
considering post-conditions.
devising an algorithm.
all of the above.

12. Question 10 Euclid's solution for the GCF is a good example of
class design.
efficient Java code implementation.
a language-independent efficient algorithm.
program source code for any computer.

13. Extra Credit What is computed by the mystery method?
public int mystery (int n1, int n2) {
int temp = 0; int rem = 0; do
rem = n1 % n2;
if (rem == 0)
temp = n2;
else
n1 = n2; n2 = rem; }
} while (rem != 0);
return temp;
(A) The mean of n1 and n2
(B) The remainder of n1 and n2
(C) The GCF of n1 and n2
(D) The LCM of n1 and n2