Question 1

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 profiling 
A)  benchmarking 
B)  instruction counting 
C)  set analyzing 
D)  process profiling

Question 2

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

Question 3

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 4

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 sort 
A)  quicksort 
B)  insertion sort 
C)  bubble sort 
D)  merge sort

Question 5

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 6

Binary search is less efficient than linear search.

Accepted Answer

A) True 
 B)False

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

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) 
A)  O(n log n) 
B)  O(n^n) 
C)  O(n**2) 
D)  O(n**3)

Question 9

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() 
A)  time.ctime() 
B)  time.time() 
C)  time.count() 
D)  time.epoch()

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

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

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?

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

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.

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?

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

Binary search is less efficient than linear search.

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

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

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?

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

What statement regarding the development of fast algorithms is accurate?

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

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?

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

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.

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?

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

Binary search is less efficient than linear search.

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

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

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?

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

What statement regarding the development of fast algorithms is accurate?

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

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