Question 1

Which of the following is not a way of representing algorithms?

Accepted Answer

A)   Stepwise refinement
B)   Pseudocode
C)   Flowchart
D)   Programming languageE) A) and C)
F) None of the above

Question 2

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

Accepted Answer

A)    Θ \varThetaΘ (lg n) 
B)    Θ \varThetaΘ (n) 
C)    Θ \varThetaΘ (n lg n) 
D)    Θ \varThetaΘ ( n2 )  E) B) and C)
F) A) and D)

Question 3

Use a while loop structure to produce a non-recursive program segment that prints the same sequence of numbers as the following recursive procedure.

Accepted Answer

The answer of Use a while loop structure to produce...

Question 4

In general, an algorithm in which of the following categories is considered more efficient?

Accepted Answer

A)   Θ \varThetaΘ (lg n) 
B)    Θ \varThetaΘ (n) 
C)    Θ \varThetaΘ (n lg n) 
D)    Θ \varThetaΘ ( n2 )  E) None of the above
F) B) and D)

Question 5

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

Accepted Answer

A)   Θ \varThetaΘ (lg n) 
B)   F Θ \varThetaΘ (n) 
C)    Θ \varThetaΘ (n lg n) 
D)    Θ \varThetaΘ ( n2 )  E) A) and C)
F) C) and D)

Question 6

The pseudocode used in this chapter included both an if-then statement and an if-then-else statement.
Show how the statement  can be simulated with a program segment using only if-then statements.

Accepted Answer

First pick a variable that does not alre...

Question 7

Which of the following does not print the same sequence of numbers as the others?

Accepted Answer

A)   X  ←\leftarrow←  5
B)   X  ←\leftarrow←  4
C)   X  ←\leftarrow←  5 D) A) and B)
E) A) and C)

Question 8

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 binary search algorithm?

Accepted Answer

A)   Lewis
B)   Pat
C)   TomD) A) and B)
E) A) and C)

Question 9

Rewrite the following routine using a pretest while statement.

Accepted Answer

One possib...

Question 10

Which of the following is an activity?

Accepted Answer

A)   Algorithm
B)   Program
C)   ProcessD) A) and B)
E) All of the above

Question 11

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 
B)   X > 4
C)   X > 5D) A) and B)
E) All of the above

Question 12

Which of the following is a loop invariant at the point at which the test for termination is performed in the following loop structure?  5 B)  X

Accepted Answer

A)   X > 5
B)   X 
C)   X  ≥\ge≥  5
D)   X  ≤\le≤  6 E) None of the above
F) A) and C)

Question 13

Which of the following set of instructions defines an algorithm in the formal, strict sense?

Accepted Answer

A)   
B)   
C)   D) A) and B)
E) A) and C)

Exam 4: Networking and the Internet

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)

Correct Answer
verified

Which of the following is an activity?

Correct Answer
verified

Which of the following does not print the same sequence of numbers as the others?

Correct Answer
verified

Which of the following set of instructions defines an algorithm in the formal, strict sense?

Correct Answer
verified

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 binary search algorithm?

Correct Answer
verified

Which of the following is not a way of representing algorithms?

Correct Answer
verified

In general, an algorithm in which of the following categories is considered more efficient?

Correct Answer
verified

Use a while loop structure to produce a non-recursive program segment that prints the same sequence of numbers as the following recursive procedure.

Correct Answer
verified

Rewrite the following routine using a pretest while statement.

Correct Answer
verified
One possib...
View Answer

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

Correct Answer
verified

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

Correct Answer
verified

Correct Answer
verified

The pseudocode used in this chapter included both an if-then statement and an if-then-else statement. Show how the statement can be simulated with a program segment using only if-then statements.

Correct Answer
verified
First pick a variable that does not alre...
View Answer

Exam 4: Networking and the Internet

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)

Correct AnswerverifiedShow Answer

Which of the following is an activity?

Correct AnswerverifiedShow Answer

Which of the following does not print the same sequence of numbers as the others?

Correct AnswerverifiedShow Answer

Which of the following set of instructions defines an algorithm in the formal, strict sense?

Correct AnswerverifiedShow Answer

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 binary search algorithm?

Correct AnswerverifiedShow Answer

Which of the following is not a way of representing algorithms?

Correct AnswerverifiedShow Answer

In general, an algorithm in which of the following categories is considered more efficient?

Correct AnswerverifiedShow Answer

Use a while loop structure to produce a non-recursive program segment that prints the same sequence of numbers as the following recursive procedure.

Correct AnswerverifiedShow Answer

Rewrite the following routine using a pretest while statement.

Correct AnswerverifiedOne possib...View AnswerShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Which of the following is a loop invariant at the point at which the test for termination is performed in the following loop structure?

Correct AnswerverifiedShow Answer

The pseudocode used in this chapter included both an if-then statement and an if-then-else statement. Show how the statement can be simulated with a program segment using only if-then statements.

Correct AnswerverifiedFirst pick a variable that does not alre...View AnswerShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
One possib...
View Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
First pick a variable that does not alre...
View Answer