TSKafli5

1. 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?

Tom

Pat

Lewis

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

Posttest loop

Pretest loop

Recursion

Assignment statement

3. 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?

Pat

Tom

Lewis

4. Which of the following is an activity?

Process

Program

Algorithm

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

O(lg n)

O(n)

O(n lg n)

O(n^2)

6. Which of the following set of instructions defines an algorithm in the formal, strict sense? x <-- x +1. The other 2 create an infinite loop. The definition of algorithm states that it has to terminate. a. X <-- 3; while (X < 5) do (X <-- X – 1) b. X <-- 3; while (X < 5) do (X <-- X) c. X <-- 3; while (X < 5) do (X <-- X + 1)

A

B

C

x

Explanation

x

7. 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 (....)

X < 5

X > 4

X < 4

8. Which of the following is a representation?

Process

Algorithm

Program

9. Which of the following is a loop invariant at the point at which the test for termination is performed in the following loop structure? X <-- 3; repeat (X <-- X + 2) until (X > 5)

X < 8

X =< 6

X >= 5

X > 5

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

Psuedocode

Flowchart

Stepwise refinement

Programming language

11. Which of the following does not print the same sequence of numbers as the others? a. X <-- 5while (X<6) do (print the value of X;X<-X+1while (X < 6) do (print the value of X; X <-- X + 1) b. X <-- 5 repeat (print the value of X;X <-- X+1 until (X>6)repeat (print the value of X; X <-- X + 1)until (X > 6) c. X <-- 4 while (X<5) do (X <-- X +1; print the value of X) while (X < 5) do ( X <-- X + 1; print the value of X )

A

B

C

a .X b. X 6) rétt svar!
c. X

Explanation

a .X b. X 6) rétt svar!
c. X

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

Recursion

Pseudocode

Assertions

Iterative structures

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

O(n^2)

O(lg n)

O(n)

O(n lg n)

14. Which of the following is a loop invariant at the point at which the test for termination is performed in the following loop structure? X <-- 3; while (X < 5) do (X <-- X + 2)

X >= 5

X < 5

X > 5

X =< 5

15. Tengdu við það sem á við mofo.

assignment statement

Algorithm

pseudocode

if-then-else statement

Stepwise refinement

Loop invariant

Submit

Tskafli5

1. 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?

2.

What first name or nickname would you like us to use?

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

3. 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?

4. Which of the following is an activity?

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

7. 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 (....)

8. Which of the following is a representation?

9. Which of the following is a loop invariant at the point at which the test for termination is performed in the following loop structure? X <-- 3; repeat (X <-- X + 2) until (X > 5)

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

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

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

14. Which of the following is a loop invariant at the point at which the test for termination is performed in the following loop structure? X <-- 3; while (X < 5) do (X <-- X + 2)

15. Tengdu við það sem á við mofo.