Question 1

The worst case in binary search occurs ____.

Accepted Answer

A)  when the object to be searched is in the middle of the list 
B)  when the object to be searched is at the end of the list 
C)  when the object to be searched is at the beginning of the list 
D)  when the object to be searched is not in the list 
A)  when the object to be searched is in the middle of the list 
B)  when the object to be searched is at the end of the list 
C)  when the object to be searched is at the beginning of the list 
D)  when the object to be searched is not in the list

Question 2

With sequential search, the bigger the list of items, the more work that must be done to search it._________________________

Accepted Answer

A) True 
 B)False

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

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

Accepted Answer

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

Question 5

The sequential search and selection sort algorithms are different methods to get the same thing done.

Accepted Answer

A) True 
 B)False

Question 6

The converging-pointers algorithm is Θ(n) in the ____________________ case.

Accepted Answer

The answer of The converging-pointers algorithm is Θ(n) in the...

Question 7

The shuffle-left algorithm is a(n) ____ algorithm in the worst case.

Accepted Answer

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

Question 8

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 9

The time an algorithm takes on a particular machine is the best way for comparing two algorithms that do the same task.

Accepted Answer

A) True 
 B)False

Question 10

No one has yet found a solution algorithm that works in polynomial time, but neither has anyone proved that such an algorithm does not exist.

Accepted Answer

A) True 
 B)False

Question 11

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 12

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

Accepted Answer

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

Question 13

____________________ problems are solvable, but the solution algorithms all require so much work as to be virtually useless.

Accepted Answer

The answer of ____________________ problems are solvable, but the solution...

Question 14

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

Accepted Answer

A) True 
 B)False

Question 15

What is the definition of order of magnitude n?

Accepted Answer

Anything that varies as a cons

Question 16

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 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

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 19

Discuss at length the measurement of the time and space consumed by an algorithm in order to determine its efficiency.

Accepted Answer

To determine whether an algorithm is eff

Question 20

The ____ case of an algorithm requires the least work.

Accepted Answer

A)  best 
B)  worst 
C)  smallest 
D)  largest 
A)  best 
B)  worst 
C)  smallest 
D)  largest

The worst case in binary search occurs ____.

With sequential search, the bigger the list of items, the more work that must be done to search it._________________________

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

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

The sequential search and selection sort algorithms are different methods to get the same thing done.

The converging-pointers algorithm is Θ(n) in the ____________________ case.

The shuffle-left algorithm is a(n) ____ algorithm in the worst case.

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

The time an algorithm takes on a particular machine is the best way for comparing two algorithms that do the same task.

No one has yet found a solution algorithm that works in polynomial time, but neither has anyone proved that such an algorithm does not exist.

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

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

____________________ problems are solvable, but the solution algorithms all require so much work as to be virtually useless.

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

What is the definition of order of magnitude n?

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

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

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

Discuss at length the measurement of the time and space consumed by an algorithm in order to determine its efficiency.

The ____ case of an algorithm requires the least work.

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 and Cloud Computing

Information Security

Introduction to High-Level Language Programming

The Tower of Babel

Compilers and Language Translation

Models of Computation

Simulation and Modeling

Electronic Commerce, Databases, and Personal Privacy

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

The worst case in binary search occurs ____.

With sequential search, the bigger the list of items, the more work that must be done to search it._________________________

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

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

The sequential search and selection sort algorithms are different methods to get the same thing done.

The converging-pointers algorithm is Θ(n) in the ____________________ case.

The shuffle-left algorithm is a(n) ____ algorithm in the worst case.

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

The time an algorithm takes on a particular machine is the best way for comparing two algorithms that do the same task.

No one has yet found a solution algorithm that works in polynomial time, but neither has anyone proved that such an algorithm does not exist.

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

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

____________________ problems are solvable, but the solution algorithms all require so much work as to be virtually useless.

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

What is the definition of order of magnitude n?

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

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

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

Discuss at length the measurement of the time and space consumed by an algorithm in order to determine its efficiency.

The ____ case of an algorithm requires the least work.

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 and Cloud Computing

Information Security

Introduction to High-Level Language Programming

The Tower of Babel

Compilers and Language Translation

Models of Computation

Simulation and Modeling

Electronic Commerce, Databases, and Personal Privacy

Artificial Intelligence

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

Making Decisions About Computers, Information, and Society

Filters