Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

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

Accepted Answer

A) True 
 B)False

Question 3

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

Accepted Answer

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

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

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

Accepted Answer

A) True 
 B)False

Question 6

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

Accepted Answer

A) True 
 B)False

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

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

Accepted Answer

A)  __in__ 
B)  __contains__ 
C)  __present__ 
D)  __within__ 
A)  __in__ 
B)  __contains__ 
C)  __present__ 
D)  __within__

Question 9

Sequential search is also called polynomial search.

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

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

Accepted Answer

A) True 
 B)False

Question 12

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

Accepted Answer

A)  mergeSort 
B)  mergeSortHelper 
C)  merge 
D)  mergeSplit 
A)  mergeSort 
B)  mergeSortHelper 
C)  merge 
D)  mergeSplit

Question 13

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?

Accepted Answer

A)  pattern analysis 
B)  complexity analysis 
C)  cost analysis 
D)  micro analysis 
A)  pattern analysis 
B)  complexity analysis 
C)  cost analysis 
D)  micro analysis

Question 14

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

Accepted Answer

A)  Different hardware platforms have different processing speeds, meaning the running times will differ. 
B)  A benchmark test does not account for differences in the size of data sets. 
C)  The test cannot be performed without modifying the code for which the benchmark will be performed on. 
D)  It can be impractical to determine the running time for algorithms with very large data sets. 
A)  Different hardware platforms have different processing speeds, meaning the running times will differ. 
B)  A benchmark test does not account for differences in the size of data sets. 
C)  The test cannot be performed without modifying the code for which the benchmark will be performed on. 
D)  It can be impractical to determine the running time for algorithms with very large data sets.

Question 15

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

Accepted Answer

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

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

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

Accepted Answer

A)  memoization 
B)  prioritization 
C)  amortization 
D)  memorization 
A)  memoization 
B)  prioritization 
C)  amortization 
D)  memorization

Question 18

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

Accepted Answer

A) True 
 B)False

Question 19

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

Accepted Answer

A) True 
 B)False

Question 20

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

Accepted Answer

A) True 
 B)False

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.

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

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

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

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

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

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

Sequential search is also called polynomial search.

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

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

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

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?

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

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

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

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

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

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

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

Introduction

Software Development Data Types and Expressions

Loops and Selection Statements

Strings and Text Files

Lists and Dictionaries

Design With Functions

Simple Graphics and Image Processing

Graphical User Interrfaces

Design With Classes

Multithreading Networks and Client Server Programming

Filters

Exam 11: Searching Sorting and Complexity Analysis

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.

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

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

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

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

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

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

Sequential search is also called polynomial search.

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

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

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

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?

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

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

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

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

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

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

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

Introduction

Software Development Data Types and Expressions

Loops and Selection Statements

Strings and Text Files

Lists and Dictionaries

Design With Functions

Simple Graphics and Image Processing

Graphical User Interrfaces

Design With Classes

Multithreading Networks and Client Server Programming

Filters