FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 11: Searching Sorting and Complexity Analysis

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 21

Multiple Choice

Review LaterAdd Note

Review Later

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

A) The bubble sort algorithm repeatedly swaps elements that are out of order in a list until they are completely sorted.
B) The bubble 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 bubble sort algorithm repeatedly inserts the i-th element into its proper place in the first i items in the list.
D) The bubble sort algorithm partitions a list around a pivot item and sorts the resulting sublists.

E) None of the above
F) B) and C)

Correct Answer

verified

Show Answer

Question 22

True/False

Review LaterAdd Note

Review Later

Bubble sort's worst-case behavior for exchanges is greater than linear.

A) True
B) False

Correct Answer

verified

Show Answer

Question 23

Multiple Choice

Review LaterAdd Note

Python's in operator is implemented as a method by what name in the list class?

Whenever the amount of work of an algorithm is expressed as a polynomial, we focus on one term as dominant.

Algorithms describe processes that run on real computers with finite resources.

The time() function of the time module can be used to track the running time of a program.

The constant of proportionality involves the terms and coefficients that are usually ignored during big-O analysis.

What is NOT one of the three Python functions that are associated with the merge sort algorithm?

The first two numbers in the Fibonacci sequence are 1 and 2.

Some algorithms require more memory as the problem size gets larger.

What are the two major problems with the benchmark technique of measuring algorithm efficiency?

The process of determining the running time and memory cost of an algorithm by reading the code and creating a mathematical formula expressing this cost is known by what term?

When you count instructions to estimate the efficiency of an algorithm, you count the instructions in the executable machine language program.

Sequential search is also called polynomial search.

What programming technique involves saving intermediate values when they are computed so they can be reused when they are needed again?

In general, we worry more about average and best-case performances than about worst-case performances.

A binary search is necessary for data that are not arranged in any particular order.

An algorithm coded in Python usually runs slightly faster than the same algorithm coded in C.

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

Algorithms with linear behavior do less work than algorithms with quadratic behavior for most problem sizes n.