Question 1

O(n log n) running times are better than O(n^2) running times.

Accepted Answer

A) True 
 B)False

Question 2

Selection sort starts at the beginning of the list and compares pairs of data items as it moves down to the end.

Accepted Answer

A) True 
 B)False

Question 3

Of the numerous sorting algorithms, what algorithm employs a recursive, divide-and-conquer strategy that breaks a list in two at the middle point and recursively sorts the lists?

Accepted Answer

A)   quicksort
B)   insertion sort
C)   bubble sort
D)   merge sortE) C) and D)
F) A) and C)

Question 4

When analyzing an algorithm, one must be careful to determine that any instructions do not hide a loop that depends on a variable problem size.

Accepted Answer

A) True 
 B)False

Question 5

What statement accurately describes the strategy utilized by the selection sort algorithm?

Accepted Answer

A)   The selection sort algorithm repeatedly swaps elements that are out of order in a list until they are completely sorted.
B)   The selection sort algorithm repeatedly swaps the smallest element in an unsorted portion of a list with an element at the start of the unsorted portion.
C)   The selection sort algorithm repeatedly inserts the i-th element into its proper place in the first i items in the list.
D)   The selection sort algorithm partitions a list around a pivot item and sorts the resulting sublists.E) None of the above
F) A) and B)

Question 6

The insertion, bubble, and selection sort algorithms are all examples of algorithms that have what big-O notation run times?

Accepted Answer

A)   O(n log n) 
B)   O(n^n) 
C)   O(n**2) 
D)   O(n**3) E) All of the above
F) A) and B)

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

What statement regarding the development of fast algorithms is accurate?

Accepted Answer

A)   As a rule, any reduction in the order of magnitude of complexity is preferable to a tweak in code that reduces the constant of proportionality.
B)   As a rule, any reduction in the constant of proportionality is preferable to a tweak that reduces the order of magnitude in complexity.
C)   As a rule, any reduction in the lines of code required to make an algorithm function is desirable to that of faster run times.
D)   As a rule, any reduction in the use of memory required by an algorithm is preferred over a tweak that improves run times.E) A) and B)
F) A) and C)

Question 9

Of the techniques that can be used to determine the efficiency of an algorithm, which is based on a calculated average of average run time?

Accepted Answer

A)   benchmarking
B)   instruction counting
C)   set analyzing
D)   process profilingE) All of the above
F) None of the above

Question 10

What function can you use to record the start and end times of a block of code, and then use the difference between the resulting values to determine the elapsed time in seconds?

Accepted Answer

A)   time.ctime() 
B)   time.time() 
C)   time.count() 
D)   time.epoch() E) B) and C)
F) A) and B)

Question 11

Binary search is less efficient than linear search.

Accepted Answer

A) True 
 B)False

Exam 11: Searching Sorting and Complexity Analysis

Of the numerous sorting algorithms, what algorithm employs a recursive, divide-and-conquer strategy that breaks a list in two at the middle point and recursively sorts the lists?

Correct Answer
verified

O(n log n) running times are better than O(n^2) running times.

Correct Answer
verified

When analyzing an algorithm, one must be careful to determine that any instructions do not hide a loop that depends on a variable problem size.

Correct Answer
verified

The insertion, bubble, and selection sort algorithms are all examples of algorithms that have what big-O notation run times?

Correct Answer
verified

What statement regarding the development of fast algorithms is accurate?

Correct Answer
verified

Of the techniques that can be used to determine the efficiency of an algorithm, which is based on a calculated average of average run time?

Correct Answer
verified

What statement accurately describes the strategy utilized by the selection sort algorithm?

Correct Answer
verified

What function can you use to record the start and end times of a block of code, and then use the difference between the resulting values to determine the elapsed time in seconds?

Correct Answer
verified

Selection sort starts at the beginning of the list and compares pairs of data items as it moves down to the end.

Correct Answer
verified

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

Correct Answer
verified

Binary search is less efficient than linear search.

Correct Answer
verified

Exam 11: Searching Sorting and Complexity Analysis

Of the numerous sorting algorithms, what algorithm employs a recursive, divide-and-conquer strategy that breaks a list in two at the middle point and recursively sorts the lists?

Correct AnswerverifiedShow Answer

O(n log n) running times are better than O(n^2) running times.

Correct AnswerverifiedShow Answer

When analyzing an algorithm, one must be careful to determine that any instructions do not hide a loop that depends on a variable problem size.

Correct AnswerverifiedShow Answer

The insertion, bubble, and selection sort algorithms are all examples of algorithms that have what big-O notation run times?

Correct AnswerverifiedShow Answer

What statement regarding the development of fast algorithms is accurate?

Correct AnswerverifiedShow Answer

Of the techniques that can be used to determine the efficiency of an algorithm, which is based on a calculated average of average run time?

Correct AnswerverifiedShow Answer

What statement accurately describes the strategy utilized by the selection sort algorithm?

Correct AnswerverifiedShow Answer

What function can you use to record the start and end times of a block of code, and then use the difference between the resulting values to determine the elapsed time in seconds?

Correct AnswerverifiedShow Answer

Selection sort starts at the beginning of the list and compares pairs of data items as it moves down to the end.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Binary search is less efficient than linear search.

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

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

Correct Answer
verified

Correct Answer
verified