Question 1

After the ith iteration of an ascending order selection sort,the smallest i items of the array will be sorted in increasing order in the first i elements of the array.

Accepted Answer

A) True 
 B)False  True

Question 2

Searching data involves determining whether a search key is present in the data and,if so,finding its location.

Accepted Answer

A) True 
 B)False  True

Question 3

The selection sort is a simple and efficient algorithm.

Accepted Answer

A) True 
 B)False  False

Question 4

A linear search algorithm will always search each and every element.

Accepted Answer

A) True 
 B)False

Question 5

If the search key is not in an array of 10 elements,how many comparisons must the linear search algorithm make

Accepted Answer

A)  0 
B)  10 
C)  9 
D)  5 
A)  0 
B)  10 
C)  9 
D)  5

Question 6

What is the efficiency of selection sort

Accepted Answer

A)  O(n2) 
B)  O(n log n) 
C)  O(n) 
D)  O(1) 
A)  O(n2) 
B)  O(n log n) 
C)  O(n) 
D)  O(1)

Question 7

Linear search is faster and more complex than the binary search.

Accepted Answer

A) True 
 B)False

Question 8

O(1)means that the algorithm has a constant run time.

Accepted Answer

A) True 
 B)False

Question 9

The merge sort algorithm sorts an array by splitting it into two equal-sized subarrays,sorting each subarray and merging them in one larger array.

Accepted Answer

A) True 
 B)False

Question 10

At the ith iteration of the insertion sort algorithm,the array will be sorted.

Accepted Answer

A) True 
 B)False

Question 11

Insertion sort is a simple and inefficient algorithm.

Accepted Answer

A) True 
 B)False

Question 12

What is the term used for binary search's run time

Accepted Answer

A)  Linear run time. 
B)  Quadratic run time. 
C)  Constant run time. 
D)  Logarithmic run time. 
A)  Linear run time. 
B)  Quadratic run time. 
C)  Constant run time. 
D)  Logarithmic run time.

Question 13

What is the efficiency of merge sort

Accepted Answer

A)  O(log n) 
B)  O(n) 
C)  O(n log n) 
D)  O(n2) 
A)  O(log n) 
B)  O(n) 
C)  O(n log n) 
D)  O(n2)

Question 14

What does the first pass of selection sort do

Accepted Answer

A)  Splits the array into two approximately equal pieces. 
B)  Orders the first two elements of the array. 
C)  Partitions the array into two unequal pieces depending on whether each element in the array is greater or less that some pivot element. 
D)  Locates the smallest element in the array and swaps it into the zeroth position. 
A)  Splits the array into two approximately equal pieces. 
B)  Orders the first two elements of the array. 
C)  Partitions the array into two unequal pieces depending on whether each element in the array is greater or less that some pivot element. 
D)  Locates the smallest element in the array and swaps it into the zeroth position.

Question 15

Which of the following sorting algorithms is the fastest when sorting a large array

Accepted Answer

A) Selection sort 
B) Insertion sort 
C) Merge sort 
D) They all run at roughly the same speed 
A) Selection sort 
B) Insertion sort 
C) Merge sort 
D) They all run at roughly the same speed

Question 16

What is the efficiency of linear search

Accepted Answer

A)  O(1). 
B)  O(log n). 
C)  O(n). 
D)  O(n2). 
A)  O(1). 
B)  O(log n). 
C)  O(n). 
D)  O(n2).

Question 17

The Big O Notation measures the average case run time of an algorithm.

Accepted Answer

A) True 
 B)False

Question 18

Which of the following is a negative aspect of binary search

Accepted Answer

A)  It requires significantly more memory than linear search 
B)  It is slower than linear search 
C)  The data must be in sorted order 
D)  None of the above 
A)  It requires significantly more memory than linear search 
B)  It is slower than linear search 
C)  The data must be in sorted order 
D)  None of the above

Question 19

How much faster is the insertion sort with a 15-element array than with a 60-element array

Accepted Answer

A)  60 times 
B)  4 times 
C)  15 times 
D)  16 times 
A)  60 times 
B)  4 times 
C)  15 times 
D)  16 times

Exam 18: Searching and Sorting

After the ith iteration of an ascending order selection sort,the smallest i items of the array will be sorted in increasing order in the first i elements of the array.

Searching data involves determining whether a search key is present in the data and,if so,finding its location.

The selection sort is a simple and efficient algorithm.

A linear search algorithm will always search each and every element.

If the search key is not in an array of 10 elements,how many comparisons must the linear search algorithm make

What is the efficiency of selection sort

Linear search is faster and more complex than the binary search.

O(1)means that the algorithm has a constant run time.

The merge sort algorithm sorts an array by splitting it into two equal-sized subarrays,sorting each subarray and merging them in one larger array.

At the ith iteration of the insertion sort algorithm,the array will be sorted.

Insertion sort is a simple and inefficient algorithm.

What is the term used for binary search's run time

What is the efficiency of merge sort

What does the first pass of selection sort do

Which of the following sorting algorithms is the fastest when sorting a large array

What is the efficiency of linear search

The Big O Notation measures the average case run time of an algorithm.

Which of the following is a negative aspect of binary search

How much faster is the insertion sort with a 15-element array than with a 60-element array

Introduction to Computers, the Internet and Visual C#

Dive Into Visual Studio Community

Introduction to C# Apps

Introduction to Classes,Objects,Methods and Strings

Control Statements: Part 1

Control Statements: Part 2

Methods: a Deeper Look

Arrays;Introduction to Exception Handling

Introduction to Linq and Generic Collections

Classes and Objects: A Deeper Look

Object-Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism

Exception Handling: A Deeper Look

GUI With Windows Forms: Part 1

GUI With Windows Forms: Part 2

Strings,Characters and Regular Expressions

Files and Streams

Data Structures

Generics

Collections

Databases and LING

Asynchronous Programming With Async and Await

XML

GUI With Windows Presentation Foundation

Filters