Question 1

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

Accepted Answer

Possible answers include: the assignment statement using $\leftarrow$, the if-then-else statement, the while statement, the repeat statement, and the definition and activation of procedures.

Question 2

Which of the sequential or binary search algorithms would find the name Roger in the list
John, Kelly, Lewis, Maurice, Nathan, Oliver, Pat, Quincy, Roger, Stan, Tom
more quickly?
_______________

Accepted Answer

Binary

Question 3

Identify a loop invariant associated with the point in the loop below at which a test for termination is performed.

Accepted Answer

Possible answers include: X > 0, X < 9, X is an even integer, and others

Question 4

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

Question 5

Which of the following lists would not be obtained at some point when applying the insertion sort algorithm to the list below? 
Sylvia
Nancy
Lois
Alice

Accepted Answer

A)  NancySylviaLoisAlice
B)  AliceLoisNancySylvia
C)  AliceSylviaNancyLois
D)  LoisNancySylviaAlice

Question 6

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

Accepted Answer

A)   X 
B)   X > 4
C)   X < 4

Question 7

Under the assumption that N takes on only integer values, which of the following is the termination condition in the following recursive procedure? procedure xxx (N)
If (N < 5) then (apply the procedure xxx to the value N + 1)
Else (print the value of N)

Accepted Answer

A)   N 
B)   N > 4
C)   N < 4

Question 8

Circle the portion of the program below in which control of the loop is initialized. Draw a rectangle around the portion in which the test for termination is performed. Underline the portion in which the state of the loop is moved toward the termination condition.

Accepted Answer

The answer of Circle the portion of the program below...

Question 9

Under the assumption that N takes on only integer values, which of the following is the termination condition in the following recursive procedure? procedure xxx (N)
If (N < 5) then (print the value of N)
Else (apply the procedure xxx to the value N - 1)

Accepted Answer

A)   N 
B)   N > 4
C)   N > 5

Question 10

Use a repeat 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 repeat loop structure to produce...

Question 11

Which of the following is a representation?

Accepted Answer

A)   Algorithm
B)   Program
C)   Process

Question 12

Use a repeat loop rather than a while loop to accomplish the same results as the following program segment. Assume that X will have only integer values. (You may also use an if statement if you like.)

Accepted Answer

The answer of Use a repeat loop rather than a...

Question 13

Which of the following is not a means of repeating a block of instructions?

Accepted Answer

A)   Pretest loop
B)   Posttest loop
C)   Recursion
D)   Assignment statement

Question 14

Preconditions, postconditions, and loop invariants are examples of which of the following?

Accepted Answer

A)   Pseudocode
B)   Iterative structures
C)   Assertions
D)   Recursion

Question 15

Identify a flaw in the control of the following loop.

Accepted Answer

The answer of Identify a flaw in the control of...

Question 16

Do the following instructions define an algorithm? Explain your answer.
Write down all the positive odd integers.
Select the integer in the middle of the list.
Print the even integer that is one less than the selected odd integer.

Accepted Answer

The answer of Do the following instructions define an algorithm?...

Question 17

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

Accepted Answer

A)   X > 5
B)   X 
C)   X  ≥\ge≥   5
D)   X  ≤\le≤  5

Question 18

Which of the sequential or binary search algorithms would find the name Kelly in the list
John, Kelly, Lewis, Maurice, Nathan, Oliver, Pat, Quincy, Roger, Stan, Tom
more quickly?
_______________

Accepted Answer

The answer of Which of the sequential or binary search...

Question 19

Which of the following is the base case in the recursive procedure below?

Accepted Answer

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

Question 20

Fill in the blank in the procedure below so that the procedure prints the integers from 0 up to the integer value it was given for N. That is, if the procedure is executed with the value of N being 3, it should print 0, 1, 2, 3.

Accepted Answer

The answer of Fill in the blank in the procedure...

Exam 4: Networking and the Internet

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

Which of the sequential or binary search algorithms would find the name Roger in the list John, Kelly, Lewis, Maurice, Nathan, Oliver, Pat, Quincy, Roger, Stan, Tom more quickly? _______________

Identify a loop invariant associated with the point in the loop below at which a test for termination is performed.

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?

Which of the following lists would not be obtained at some point when applying the insertion sort algorithm to the list below? Sylvia Nancy Lois Alice

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

Under the assumption that N takes on only integer values, which of the following is the termination condition in the following recursive procedure? procedure xxx (N) If (N < 5) then (apply the procedure xxx to the value N + 1) Else (print the value of N)