Question 1

What is the definition of order of magnitude n?

Accepted Answer

Anything that varies as a cons

Question 2

Selection sort is a(n) ____ algorithm in all cases.

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 3

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 4

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

Accepted Answer

1. On what computer will we run the algo

Question 5

Discuss at length how binary search operates.

Accepted Answer

To understand how binary search operates

Question 6

What is the logarithm of n to the base 2?

Accepted Answer

The number of times

Question 7

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 8

A(n) ____________________ is a path through a graph that begins and ends at the same node and goes through all other nodes exactly once.

Accepted Answer

The answer of A(n) ____________________ is a path through a...

Question 9

Q(lg n), Q(n) and Q(n²) are ____ in the amount of work they do as n increases.

Accepted Answer

A)  restricted 
B)  useful 
C)  polynomially bounded 
D)  exponential 
A)  restricted 
B)  useful 
C)  polynomially bounded 
D)  exponential

Question 10

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

What is the definition of order of magnitude n?

Selection sort is a(n) ____ algorithm in all cases.

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

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

Discuss at length how binary search operates.

What is the logarithm of n to the base 2?

The worst case in binary search occurs ____.

A(n) ____________________ is a path through a graph that begins and ends at the same node and goes through all other nodes exactly once.

Q(lg n), Q(n) and Q(n²) are ____ in the amount of work they do as n increases.

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

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

What is the definition of order of magnitude n?

Selection sort is a(n) ____ algorithm in all cases.

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

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

Discuss at length how binary search operates.

What is the logarithm of n to the base 2?

The worst case in binary search occurs ____.

A(n) ____________________ is a path through a graph that begins and ends at the same node and goes through all other nodes exactly once.

Q(lg n), Q(n) and Q(n²) are ____ in the amount of work they do as n increases.

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

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