Search
Create
Log in
Sign up
Log in
Sign up
Get ahead with a $300 test prep scholarship
| Enter to win by Tuesday 9/24
Learn more
AP Computer Science A - Calculations Set 2
STUDY
Flashcards
Learn
Write
Spell
Test
PLAY
Match
Gravity
Terms in this set (41)
("canon",substring(1,2)).equals("caP".substring(1,2))
TRUE
"catastrophe".indexOf("mat")
-1
"hammer".indexOf("a") == "far".indexOf("a")
TRUE
The number of times the following loop will be executed:
for(int j=10; j>1; j--) {
9
"246".compareTo("cat")>0
FALSE
5 + 3 < 17 / 2
false
The number of times doSomething() will be executed by the following code:
for(int j = 1; j <= 3; j+=2)
for(int k = 1; k <= 4; k++)
doSomething();
8
The number of comparisons required in the best case for a binary search of 32 sorted numbers.
1
The number of bits used to store an int variable.
32
13/2
6
Integer.MAX_VALUE
(2^31)-1
"cat".compareTo("cot") > 0
FALSE
for (int j=1; j<=1; j++) {
1
11-4/3+2
11-4/3+2 == 11-1+2, which equals 12
The number of comparisons required in the best case for a sequential search of 20 unsorted numbers.
1
The number of iterations of a binary search of 100 sorted numbers to determine that a given key is not in the list
7
"cat".compareTo("caY")>0
TRUE
for(int j=1; j<1; j++) How many iterations
0
51 base 8 as a binary number
101001 base 2
The number of comparisons required in the worst case for a sequential search of 20 unsorted numbers.
20
The number of times the following loop will be executed: for (int j = 1; j <= 10; j++) {...
10
1011 sub 2 as a decimal number
11
The number of times doSomething() will be executed by the following code:
for(int j = 5; j >= 1; j--)
for(int k = j; k >=1; k--)
doSomething();
15
(double)13/2
6.5
("cat".substring(-1)).compareTo("caP".substring(1)) < 0
StringIndexOutOfBoundsException
The largest integer that can be stored in 1 byte
2^7 - 1
The number of times the following loop will be executed
for (int j = 10; j>1; j/=3) {
2
(3 + 4) * 8 / 3 - 12
6
13/2+3
9
true || false
TRUE
The number of comparisons required in the worst case for a binary search of 30 sorted numbers.
5
The number of times the following look will be executed:
for (int j =1; j<=15; j*=2) {
4
11-4+3
11-4+3 == 7+3 == 10
The number of times the following loop will be executed:
for(int j=1; j<=3; j++)
for(int k=1; k<=2; k++){
6
2B as a binary numer
101011 base 2
Integer.MIN_VALUE
-2^31
The index of the last element in an array with 23 elements
22
127 base 8 as a decimal number
87
The number of comparisons required in the worst case for a binary search of 32 sorted numbers.
6
101 base 2 as a decimal number
5
2F base 16 as a decimal number
47
YOU MIGHT ALSO LIKE...
Numbers & Animals Vocabulary | Everyday Traditional Mandarin Chinese
Chineasy
$4.99
STUDY GUIDE
CH 7: Starting Out With C++ CHECKPOINT QUESTIONS
32 Terms
Kitori93
Ch 7 Checkpoint Questions
32 Terms
Stephanie_Raymond9
Quiz arrays ch7
47 Terms
Nwbeljava
OTHER SETS BY THIS CREATOR
CS Discoveries - Unit 4
14 Terms
Myra_Deister
TEACHER
AP Computer Science A - Calculations Set 1
40 Terms
Myra_Deister
TEACHER
Java Arrays
28 Terms
Myra_Deister
TEACHER
CSD - Unit 3 Vocab
15 Terms
Myra_Deister
TEACHER
THIS SET IS OFTEN IN FOLDERS WITH...
AP Computer Science A - Review 1
47 Terms
raymondaw
AP Comp Programming Quiz
40 Terms
mkim2014
AP Computer Science Free Response
19 Terms
daviscla000
computer science free response reminders
7 Terms
mpek1901
;