Question 1

Sequential search is an order-n algorithm in the average case.

Accepted Answer

A) True 
 B)False  True

Question 2

Given the data cleanup problem described in the text, write the pseudocode for the converging-pointers algorithm for data cleanup.

Accepted Answer

1. Get values for n and the n data items
2. Set the value of legit to n
3. Set the value of left to 1
4. Set the value of right to n
5. While left is less than right do Steps 6 through 10 
6. If the item at position left is not 0 then increase left by 1 
7. Else (the item at position left is 0) do Steps 8 through 10 
8. Reduce legit by 1 
9. Copy the item at position right into position left 
10. Reduce right by 1 
11. If the item at position left is 0, then reduce legit by 1 
12. Stop

Question 3

____ are useful for rating one machine against another and for rating how sensitive a particular algorithm is with respect to variations in input on one particular machine.

Accepted Answer

A)  Time trials 
B)  Benchmarks 
C)  Comparison times 
D)  Intensive tests 
A)  Time trials 
B)  Benchmarks 
C)  Comparison times 
D)  Intensive tests B

Question 4

Given a sorted list, the sequential search algorithm is more efficient than the binary search.

Accepted Answer

A) True 
 B)False

Question 5

If an Q(n²) algorithm and an Q(n) algorithm exist for the same task, then for large enough n, the Q(n²) algorithm does more work and takes longer to execute, regardless of the constant factors for peripheral work.

Accepted Answer

A) True 
 B)False

Question 6

Sequential search is a(n) ____ algorithm in the worst case.

Accepted Answer

A)  Q(1) 
B)  Q(n) 
C)  Q(2n) 
D)  Q(n2) 
A)  Q(1) 
B)  Q(n) 
C)  Q(2n) 
D)  Q(n2)

Question 7

Discuss at length both the best and worst case of the pattern-matching algorithm.

Accepted Answer

Both the best case and the worst case of

Question 8

____________________ is the term to describe an algorithm's careful use of resources.

Accepted Answer

The answer of ____________________ is the term to describe an...

Question 9

Problems for which no known polynomial solution algorithm exists are sometimes approached via ____ algorithms.

Accepted Answer

A)  alternative 
B)  intractable 
C)  polynomial 
D)  approximation 
A)  alternative 
B)  intractable 
C)  polynomial 
D)  approximation

Question 10

In the sequential search algorithm, the worst case occurs when the value being searched for is the ____ value in the list.

Accepted Answer

A)  first 
B)  second 
C)  middle 
D)  last 
A)  first 
B)  second 
C)  middle 
D)  last

Question 11

____ is the algorithmic equivalence of style.

Accepted Answer

A)  Efficiency 
B)  Elegance 
C)  Aesthetics 
D)  Complexity 
A)  Efficiency 
B)  Elegance 
C)  Aesthetics 
D)  Complexity

Question 12

Binary search uses significantly more space than sequential search.

Accepted Answer

A) True 
 B)False

Question 13

Explain the sentence: The selection sort algorithm not only does comparisons; it also does exchanges.

Accepted Answer

Even if the largest number in the unsort

Question 14

First and foremost, we expect elegance from our algorithms. _________________________

Accepted Answer

A) True 
 B)False

Question 15

In the sequential search algorithm, the worst case occurs when the value being searched for is the first value in the list. _________________________

Accepted Answer

A) True 
 B)False

Question 16

The properties that make better algorithms are very similar to the properties we look for when purchasing a car.

Accepted Answer

A) True 
 B)False

Question 17

If an algorithm is more time efficient and less space efficient, what is this called?

Accepted Answer

This choice is called the time

Question 18

Part of the job of program ____ is to make clear any assumptions or restrictions about the input size the program was designed to handle.

Accepted Answer

A)  design 
B)  implementation 
C)  documentation 
D)  maintenance 
A)  design 
B)  implementation 
C)  documentation 
D)  maintenance

Question 19

The shuffle-left algorithm is not space-efficient. _________________________

Accepted Answer

A) True 
 B)False

Question 20

The number of comparisons done by the selection sort algorithm does not grow at the same rate as the problem size n, instead it grows at approximately the ____________________ of that rate.

Accepted Answer

The answer of The number of comparisons done by the...

Sequential search is an order-n algorithm in the average case.

Given the data cleanup problem described in the text, write the pseudocode for the converging-pointers algorithm for data cleanup.

____ are useful for rating one machine against another and for rating how sensitive a particular algorithm is with respect to variations in input on one particular machine.

Given a sorted list, the sequential search algorithm is more efficient than the binary search.

If an Q(n²) algorithm and an Q(n) algorithm exist for the same task, then for large enough n, the Q(n²) algorithm does more work and takes longer to execute, regardless of the constant factors for peripheral work.

Sequential search is a(n) ____ algorithm in the worst case.

Discuss at length both the best and worst case of the pattern-matching algorithm.

____________________ is the term to describe an algorithm's careful use of resources.

Problems for which no known polynomial solution algorithm exists are sometimes approached via ____ algorithms.

In the sequential search algorithm, the worst case occurs when the value being searched for is the ____ value in the list.

____ is the algorithmic equivalence of style.

Binary search uses significantly more space than sequential search.

Explain the sentence: The selection sort algorithm not only does comparisons; it also does exchanges.

First and foremost, we expect elegance from our algorithms. _________________________

In the sequential search algorithm, the worst case occurs when the value being searched for is the first value in the list. _________________________

The properties that make better algorithms are very similar to the properties we look for when purchasing a car.

If an algorithm is more time efficient and less space efficient, what is this called?

Part of the job of program ____ is to make clear any assumptions or restrictions about the input size the program was designed to handle.

The shuffle-left algorithm is not space-efficient. _________________________

The number of comparisons done by the selection sort algorithm does not grow at the same rate as the problem size n, instead it grows at approximately the ____________________ of that rate.

An Introduction to Computer Science

Algorithm Discovery and Design

The Building Blocks: Binary Numbers, Boolean Logic, and Gates

Computer Systems Organization

An Introduction to System Software and Virtual Machines

Computer Networks, The Internet, and the World Wide Web

Information Security

Introduction to High-Level Language Programming

The Tower of Babel

Compilers and Language Translation

Models of Computation

Simulation and Modeling

Electronic Commerce and Databases

Artificial Intelligence

Computer Graphics and Entertainment: Movies, Games, and Virtual Communities

Making Decisions About Computers, Information, and Society

Filters

Exam 3: The Efficiency of Algorithms

Sequential search is an order-n algorithm in the average case.

Given the data cleanup problem described in the text, write the pseudocode for the converging-pointers algorithm for data cleanup.

____ are useful for rating one machine against another and for rating how sensitive a particular algorithm is with respect to variations in input on one particular machine.

Given a sorted list, the sequential search algorithm is more efficient than the binary search.

If an Q(n²) algorithm and an Q(n) algorithm exist for the same task, then for large enough n, the Q(n²) algorithm does more work and takes longer to execute, regardless of the constant factors for peripheral work.

Sequential search is a(n) ____ algorithm in the worst case.

Discuss at length both the best and worst case of the pattern-matching algorithm.

____________________ is the term to describe an algorithm's careful use of resources.

Problems for which no known polynomial solution algorithm exists are sometimes approached via ____ algorithms.

In the sequential search algorithm, the worst case occurs when the value being searched for is the ____ value in the list.

____ is the algorithmic equivalence of style.

Binary search uses significantly more space than sequential search.

Explain the sentence: The selection sort algorithm not only does comparisons; it also does exchanges.

First and foremost, we expect elegance from our algorithms. _________________________

In the sequential search algorithm, the worst case occurs when the value being searched for is the first value in the list. _________________________

The properties that make better algorithms are very similar to the properties we look for when purchasing a car.

If an algorithm is more time efficient and less space efficient, what is this called?

Part of the job of program ____ is to make clear any assumptions or restrictions about the input size the program was designed to handle.

The shuffle-left algorithm is not space-efficient. _________________________

The number of comparisons done by the selection sort algorithm does not grow at the same rate as the problem size n, instead it grows at approximately the ____________________ of that rate.

An Introduction to Computer Science

Algorithm Discovery and Design

The Building Blocks: Binary Numbers, Boolean Logic, and Gates

Computer Systems Organization

An Introduction to System Software and Virtual Machines

Computer Networks, The Internet, and the World Wide Web

Information Security

Introduction to High-Level Language Programming

The Tower of Babel

Compilers and Language Translation

Models of Computation

Simulation and Modeling

Electronic Commerce and Databases

Artificial Intelligence

Computer Graphics and Entertainment: Movies, Games, and Virtual Communities

Making Decisions About Computers, Information, and Society

Filters