Question 1

A program switch can be used as a loop control variable.

Accepted Answer

A) True 
 B)False

Question 2

The condition IF A = 5 AND B > 10 will be true if

Accepted Answer

A) A = 5 is true 
B) B > 10 is true 
C) both A = 5 and B > 10 are true 
D) all of the above 
A) A = 5 is true 
B) B > 10 is true 
C) both A = 5 and B > 10 are true 
D) all of the above

Question 3

What is the value of X after the instructions corresponding to the following pseudocode are executed?
$$\begin{array} { l } 
X = 6 \
Y = 7
\end{array}$$
$\operatorname { IF } \operatorname { INT } ( 5.5 ) = \mathrm { X }$ OR $\operatorname { INT } ( 6.9 ) = \mathrm { Y }$ THEN
$$\mathrm { X } = \mathrm { X } + \mathrm { Y }$$
ELSE
$$Y = Y + 1$$
ENDIF

Accepted Answer

A) 6 
B) 7 
C) 8 
D) 13 
A) 6 
B) 7 
C) 8 
D) 13

Question 4

A sequential search is more efficient than a binary search.

Accepted Answer

A) True 
 B)False

Question 5

What is the maximum number of comparisons that would be needed to determine whether or not a match is found in a sequential search of 64 elements?

Accepted Answer

A) 6 
B) 7 
C) 63 
D) 64 
A) 6 
B) 7 
C) 63 
D) 64

Question 6

The binary search technique is particularly valuable when a table contains only a few entries.

Accepted Answer

A) True 
 B)False

Question 7

What is the value of X after the instructions corresponding to the following pseudocode are executed?
$$\begin{array} { l } 
\mathrm { X } = 5 \
\mathrm { Y } = 7 \
\text { IF } \operatorname { INT } ( 5.4 ) = \mathrm { X } \mathrm { OR } \mathrm { INT } ( 7.0 ) = \mathrm { Y } \text { THEN } \
\mathrm { X } = \mathrm { X } + \mathrm { Y } \
\text { ELSE } \
\mathrm { Y } = \mathrm { Y } + 1 \
\end{array}$$
ENDIF

Accepted Answer

A) 5 
B) 7 
C) 8 
D) 12 
A) 5 
B) 7 
C) 8 
D) 12

Question 8

What is the maximum number of comparisons that would be needed to determine whether or not a match is found in a binary search of 64 elements?

Accepted Answer

A) 6 
B) 7 
C) 63 
D) 64 
A) 6 
B) 7 
C) 63 
D) 64

Question 9

In a binary search when the lower bound is found to be greater than the upper bound,we know that the value being searched for has been found.

Accepted Answer

A) True 
 B)False

Question 10

A program switch must always contain one of two values - 0 or 1.

Accepted Answer

A) True 
 B)False

A program switch can be used as a loop control variable.

The condition IF A = 5 AND B > 10 will be true if

A sequential search is more efficient than a binary search.

What is the maximum number of comparisons that would be needed to determine whether or not a match is found in a sequential search of 64 elements?

The binary search technique is particularly valuable when a table contains only a few entries.

What is the value of X after the instructions corresponding to the following pseudocode are executed? =5 =7 IF INT (5.4)=(7.0)= THEN =+ ELSE =+1 ENDIF

What is the maximum number of comparisons that would be needed to determine whether or not a match is found in a binary search of 64 elements?

In a binary search when the lower bound is found to be greater than the upper bound,we know that the value being searched for has been found.

A program switch must always contain one of two values - 0 or 1.

Introduction to Structured Design

Simple Sequence Control Structure

Ifthenelse Control Structure

Dowhile Control Structurecounter-Controlled Loops

Dowhile Control Structuretrailer Record Logic

Modularization

Case Control Structure

Dountil Control Structure

Introduction to Arrays

Introduction to Object-Oriented Design

Inheritance

Other Class and Object Relationships

Master File Update Processing

Control-Break Processing

Filters

Exam 13: Array Applications

A program switch can be used as a loop control variable.

The condition IF A = 5 AND B > 10 will be true if

A sequential search is more efficient than a binary search.

What is the maximum number of comparisons that would be needed to determine whether or not a match is found in a sequential search of 64 elements?

The binary search technique is particularly valuable when a table contains only a few entries.

What is the value of X after the instructions corresponding to the following pseudocode are executed? =5 =7 IF INT (5.4)=(7.0)= THEN =+ ELSE =+1 ENDIF

What is the maximum number of comparisons that would be needed to determine whether or not a match is found in a binary search of 64 elements?

In a binary search when the lower bound is found to be greater than the upper bound,we know that the value being searched for has been found.

A program switch must always contain one of two values - 0 or 1.

Introduction to Structured Design

Simple Sequence Control Structure

Ifthenelse Control Structure

Dowhile Control Structurecounter-Controlled Loops

Dowhile Control Structuretrailer Record Logic

Modularization

Case Control Structure

Dountil Control Structure

Introduction to Arrays

Introduction to Object-Oriented Design

Inheritance

Other Class and Object Relationships

Master File Update Processing

Control-Break Processing

Filters