Question 1

The binary search algorithm is an example of an algorithm in which of the following classes?

Accepted Answer

A)  $\Theta \left( \log _ { 2 } n \right)$ 
B)  $\Theta ( n )$ 
C)  $\Theta \left( n \log _ { 2 } n \right)$ 
D)  $\Theta \left( n ^ { 2 } \right)$ 
A)  $\Theta \left( \log _ { 2 } n \right)$ 
B)  $\Theta ( n )$ 
C)  $\Theta \left( n \log _ { 2 } n \right)$ 
D)  $\Theta \left( n ^ { 2 } \right)$

Question 2

What sequence of numbers would be printed if the function named xxx as described below were executed with the value of N being 2?
def xxx (N):
print(N)
if (N < 3):
yyy(4)
print(N)
def yyy(N):
print(N)
xxx(5)
print(N)
_____________________

Accepted Answer

The answer of What sequence of numbers would be printed...

Question 3

Suppose the binary search algorithm was being used to search for the entry Tom in the list
 Nathan,Oliver,Pat,Quincy,Rodger,Stan,Tom
 A.What would be the first entry in the list to be considered? _____________
 B.What would be the second entry in the list to be considered? _____________

Accepted Answer

The answer of Suppose the binary search algorithm was being...

Question 4

List three of the primitives in the pseudocode developed in this chapter.
____________________
____________________
____________________

Accepted Answer

Possible answers include: the

Question 5

When searching within the list Lewis,Maurice,Nathan,Oliver,Pat,Quincy,Roger,Stan,Tom
Which of the following entries will be found most quickly using the sequential search algorithm?

Accepted Answer

A)  Lewis 
B)  Pat 
C)  Tom 
A)  Lewis 
B)  Pat 
C)  Tom

Question 6

Under the assumption that X takes on only integer values,which of the following is the termination condition for the following loop?
Repeat:
. . .
Until (X < 5)

Accepted Answer

A)  X  4 
C)  X > 5 
A)  X  4 
C)  X > 5

Question 7

The insertion sort algorithm is an example of an algorithm in which of the following classes?

Accepted Answer

A)  $\Theta \left( \log _ { 2 } n \right)$ 
B)  $\Theta ( n )$ 
C)  $\Theta \left( n \log _ { 2 } n \right)$ 
D)  $\Theta \left( n ^ { 2 } \right)$ 
A)  $\Theta \left( \log _ { 2 } n \right)$ 
B)  $\Theta ( n )$ 
C)  $\Theta \left( n \log _ { 2 } n \right)$ 
D)  $\Theta \left( n ^ { 2 } \right)$

Question 8

Suppose the statement "X is an integer and X  3 )
\end{array}\)

Accepted Answer

The answer of Suppose the statement "X is an integer...

Question 9

Answer the following questions in terms of the function xxx below.
 def xxx(N):
 if (N < 7):
 print(N)
 else:
 N = n + 3 
 print(N)
 A.What value would be printed if the following function were executed with the value of N 
being 4?
 ____________
 B.What value would be printed if the following function were executed with the value of N 
being 9?
 ____________

Accepted Answer

The answer of Answer the following questions in terms of...

Question 10

When searching for the entry X within the list
R,S,T,U,V,W,Z
how many entries will be considered before discovering that the entry is not present? (Note that the list is in alphabetical order.)
____________

Accepted Answer

The answer of When searching for the entry X within...

Question 11

Which of the following is the base case in the recursive function below? def xxx(N):
If (N == 0):
Print(N)
Else:
Xxx(N - 1)

Accepted Answer

A) N > 0 B) N = 0 C) N < 0 A) N > 0 B) N = 0 C) N < 0

Question 12

What sequence of numbers would be printed if the following function were executed with the value of N being 0?
def xxx(N):
print(N)
if (N < 2):
xxx(N + 1)
else:
print(N)
print(N)
__________________

Accepted Answer

The answer of What sequence of numbers would be printed...

Question 13

At most,how many entries in a list of 5000 names will be interrogated when using the sequential search algorithm?
___________

Accepted Answer

The answer of At most,how many entries in a list...

The binary search algorithm is an example of an algorithm in which of the following classes?

What sequence of numbers would be printed if the function named xxx as described below were executed with the value of N being 2? def xxx (N): print(N) if (N < 3): yyy(4) print(N) def yyy(N): print(N) xxx(5) print(N) _____________________

Suppose the binary search algorithm was being used to search for the entry Tom in the list Nathan,Oliver,Pat,Quincy,Rodger,Stan,Tom A.What would be the first entry in the list to be considered? _ B.What would be the second entry in the list to be considered? _

List three of the primitives in the pseudocode developed in this chapter.

When searching within the list Lewis,Maurice,Nathan,Oliver,Pat,Quincy,Roger,Stan,Tom Which of the following entries will be found most quickly using the sequential search algorithm?

Under the assumption that X takes on only integer values,which of the following is the termination condition for the following loop? Repeat: . . . Until (X < 5)

The insertion sort algorithm is an example of an algorithm in which of the following classes?

Suppose the statement "X is an integer and X < 5" is a loop invariant at the point at which the test for termination is performed in the loop outlined below.What can be concluded about the value of X immediately after the loop is terminated? repeat: . . . until (>3)

When searching for the entry X within the list R,S,T,U,V,W,Z how many entries will be considered before discovering that the entry is not present? (Note that the list is in alphabetical order.) ____________

Which of the following is the base case in the recursive function below? def xxx(N): If (N == 0): Print(N) Else: Xxx(N - 1)

What sequence of numbers would be printed if the following function were executed with the value of N being 0? def xxx(N): print(N) if (N < 2): xxx(N + 1) else: print(N) print(N) __________________

At most,how many entries in a list of 5000 names will be interrogated when using the sequential search algorithm? ___________

Data Representation

Data Representation

Operating Systems

Networks and the Internet

Programming Languages

Software Engineering

Data Abstractions

Database Systems

Computer Graphics

Artificial Intelligence

Theory of Computation

Filters

Exam 5: Algorithms

The binary search algorithm is an example of an algorithm in which of the following classes?

What sequence of numbers would be printed if the function named xxx as described below were executed with the value of N being 2? def xxx (N): print(N) if (N < 3): yyy(4) print(N) def yyy(N): print(N) xxx(5) print(N) _____________________

Suppose the binary search algorithm was being used to search for the entry Tom in the list Nathan,Oliver,Pat,Quincy,Rodger,Stan,Tom A.What would be the first entry in the list to be considered? _____________ B.What would be the second entry in the list to be considered? _____________

List three of the primitives in the pseudocode developed in this chapter. ____________________ ____________________ ____________________

When searching within the list Lewis,Maurice,Nathan,Oliver,Pat,Quincy,Roger,Stan,Tom Which of the following entries will be found most quickly using the sequential search algorithm?

Under the assumption that X takes on only integer values,which of the following is the termination condition for the following loop? Repeat: . . . Until (X < 5)

The insertion sort algorithm is an example of an algorithm in which of the following classes?

Suppose the statement "X is an integer and X < 5" is a loop invariant at the point at which the test for termination is performed in the loop outlined below.What can be concluded about the value of X immediately after the loop is terminated? repeat: . . . until (>3)

When searching for the entry X within the list R,S,T,U,V,W,Z how many entries will be considered before discovering that the entry is not present? (Note that the list is in alphabetical order.) ____________

Which of the following is the base case in the recursive function below? def xxx(N): If (N == 0): Print(N) Else: Xxx(N - 1)

What sequence of numbers would be printed if the following function were executed with the value of N being 0? def xxx(N): print(N) if (N < 2): xxx(N + 1) else: print(N) print(N) __________________

At most,how many entries in a list of 5000 names will be interrogated when using the sequential search algorithm? ___________

Data Representation

Data Representation

Operating Systems

Networks and the Internet

Programming Languages

Software Engineering

Data Abstractions

Database Systems

Computer Graphics

Artificial Intelligence

Theory of Computation

Filters

Suppose the binary search algorithm was being used to search for the entry Tom in the list Nathan,Oliver,Pat,Quincy,Rodger,Stan,Tom A.What would be the first entry in the list to be considered? _ B.What would be the second entry in the list to be considered? _

List three of the primitives in the pseudocode developed in this chapter.