Question 1

All algorithms that perform the same task take the same amount of time to complete.

Accepted Answer

A) True 
 B)False  False

Question 2

The number of Python instructions executed in an algorithm will differ from the number of machine language instructions executed.

Accepted Answer

A) True 
 B)False  True

Question 3

Why is the efficiency of algorithms desirable?

Accepted Answer

A)  an inefficient algorithm may use too much time or space 
B)  efficient algorithms always cost less money 
C)  inefficient algorithms always use too much memory 
D)  efficient algorithms always use less memory 
A)  an inefficient algorithm may use too much time or space 
B)  efficient algorithms always cost less money 
C)  inefficient algorithms always use too much memory 
D)  efficient algorithms always use less memory A

Question 4

An algorithm that uses the exact same Python code run on two different machines should have the same performance data.

Accepted Answer

A) True 
 B)False

Question 5

On sorted data, you can use a binary search.

Accepted Answer

A) True 
 B)False

Question 6

How can the following algorithm be described?
Position = 0
While position < len(lyst):
If target == lyst[ position ]:
Return position
Position += 1
Return -1

Accepted Answer

A)  binary search 
B)  bubble sort 
C)  sequential search 
D)  selection sort 
A)  binary search 
B)  bubble sort 
C)  sequential search 
D)  selection sort

Question 7

What does the Python time() function return?

Accepted Answer

A)  The seconds elapsed since January 1, 1970 
B)  The number of instructions executed 
C)  The number of seconds the code has been running 
D)  The number of milliseconds to execute a line of code 
A)  The seconds elapsed since January 1, 1970 
B)  The number of instructions executed 
C)  The number of seconds the code has been running 
D)  The number of milliseconds to execute a line of code

Question 8

What term best describes the following code?
X = myList[ i ]
MyList[ i ] = myList[ j ]
MyList[ j ] = x

Accepted Answer

A)  sequential search 
B)  binary sort 
C)  selection algorithm 
D)  swap function 
A)  sequential search 
B)  binary sort 
C)  selection algorithm 
D)  swap function

Question 9

What is the worst-case complexity of a binary search?

Accepted Answer

A)  O( n 2) 
B)  O( n ) 
C)  O(log2 n ) 
D)  O2 
A)  O( n 2) 
B)  O( n ) 
C)  O(log2 n ) 
D)  O2

Question 10

The merge sort employs a recursive, divide-and-conquer strategy to break the O( n2 ) barrier.

Accepted Answer

A) True 
 B)False

Question 11

The amount of work of a logarithmic algorithm is proportional to the log2 of the problem size.

Accepted Answer

A) True 
 B)False

Question 12

Which of the following is a common way to measure the time cost of an algorithm?

Accepted Answer

A)  count lines of code 
B)  use a stopwatch 
C)  calculate memory usage 
D)  use the computer's clock 
A)  count lines of code 
B)  use a stopwatch 
C)  calculate memory usage 
D)  use the computer's clock

Question 13

In a bubble sort, each pass through the main loop selects a single item to be moved.

Accepted Answer

A) True 
 B)False

Question 14

In a selection sort, the outer loop executes n - 1 times.

Accepted Answer

A) True 
 B)False

Question 15

Python's in operator is implemented as a method named __contains__ in the list class.

Accepted Answer

A) True 
 B)False

Question 16

The result of fib(4) is 8.

Accepted Answer

A) True 
 B)False

Question 17

How can an algorithm be described in which the work it does grows as a function of the square of the problem size?

Accepted Answer

A)  exponential 
B)  logarithmic 
C)  quadratic 
D)  linear 
A)  exponential 
B)  logarithmic 
C)  quadratic 
D)  linear

Question 18

The in operator performs a binary search algorithm.

Accepted Answer

A) True 
 B)False

Question 19

The first two numbers in the Fibonacci sequence are 1s, and each number after that is the sum of the previous two numbers.

Accepted Answer

A) True 
 B)False

Question 20

What is the complexity of a selection sort?

Accepted Answer

A)  O( n 2) 
B)  O( n ) 
C)  O(log2 n ) 
D)  O2 
A)  O( n 2) 
B)  O( n ) 
C)  O(log2 n ) 
D)  O2

All algorithms that perform the same task take the same amount of time to complete.

The number of Python instructions executed in an algorithm will differ from the number of machine language instructions executed.

Why is the efficiency of algorithms desirable?

An algorithm that uses the exact same Python code run on two different machines should have the same performance data.

On sorted data, you can use a binary search.

How can the following algorithm be described? Position = 0 While position < len(lyst): If target == lyst[ position ]: Return position Position += 1 Return -1

What does the Python time() function return?

What term best describes the following code? X = myList[ i ] MyList[ i ] = myList[ j ] MyList[ j ] = x

What is the worst-case complexity of a binary search?

The merge sort employs a recursive, divide-and-conquer strategy to break the O( n² ) barrier.

The amount of work of a logarithmic algorithm is proportional to the log₂ of the problem size.

Which of the following is a common way to measure the time cost of an algorithm?

In a bubble sort, each pass through the main loop selects a single item to be moved.

In a selection sort, the outer loop executes n - 1 times.

Python's in operator is implemented as a method named contains in the list class.

The result of fib(4) is 8.

How can an algorithm be described in which the work it does grows as a function of the square of the problem size?

The in operator performs a binary search algorithm.

The first two numbers in the Fibonacci sequence are 1s, and each number after that is the sum of the previous two numbers.

What is the complexity of a selection sort?

Basic Python Programming

An Overview of Collections

Arrays and Linked Structures

Interfaces, Implementations, and Polymorphism

Inheritance and Abstract Classes

Stacks

Queues

Lists

Trees

Sets and Dictionaries

Graphs

Filters

Exam 3: Searching, Sorting, and Complexity Analysis

All algorithms that perform the same task take the same amount of time to complete.

The number of Python instructions executed in an algorithm will differ from the number of machine language instructions executed.

Why is the efficiency of algorithms desirable?

An algorithm that uses the exact same Python code run on two different machines should have the same performance data.

On sorted data, you can use a binary search.

How can the following algorithm be described? Position = 0 While position < len(lyst): If target == lyst[ position ]: Return position Position += 1 Return -1

What does the Python time() function return?

What term best describes the following code? X = myList[ i ] MyList[ i ] = myList[ j ] MyList[ j ] = x

What is the worst-case complexity of a binary search?

The merge sort employs a recursive, divide-and-conquer strategy to break the O( n2 ) barrier.

The amount of work of a logarithmic algorithm is proportional to the log2 of the problem size.

Which of the following is a common way to measure the time cost of an algorithm?

In a bubble sort, each pass through the main loop selects a single item to be moved.

In a selection sort, the outer loop executes n - 1 times.

Python's in operator is implemented as a method named __contains__ in the list class.

The result of fib(4) is 8.

How can an algorithm be described in which the work it does grows as a function of the square of the problem size?

The in operator performs a binary search algorithm.

The first two numbers in the Fibonacci sequence are 1s, and each number after that is the sum of the previous two numbers.

What is the complexity of a selection sort?

Basic Python Programming

An Overview of Collections

Arrays and Linked Structures

Interfaces, Implementations, and Polymorphism

Inheritance and Abstract Classes

Stacks

Queues

Lists

Trees

Sets and Dictionaries

Graphs

Filters

The merge sort employs a recursive, divide-and-conquer strategy to break the O( n² ) barrier.

The amount of work of a logarithmic algorithm is proportional to the log₂ of the problem size.

Python's in operator is implemented as a method named contains in the list class.