Question

1.

What is the minimum number of locations a binary search algorithm will have to examine when looking for a particular value in a sorted array of 200 elements? (2 points)

	1
	6
	7
	8
	200

2.

In general, which of the following sorting algorithms is the MOST efficient? (2 points)

	Bubble sort
	Insertion sort
	Heap sort
	Merge sort
	Selection sort

3.

Which of the following are quadratic-sorting algorithms? (2 points)

I. insertion sort
II. selection sort
III. merge sort

	I only
	II only
	III only
	I and II only
	I, II, and III

4.

What is the minimum number of locations a sequential search algorithm will have to examine when looking for a particular value in an array of 200 elements? (2 points)

	1
	7
	8
	100
	200

5.

Which sorting algorithm is LEAST efficient when performed on an array in which the values are already in the desired sorted order? (2 points)

	Binary sort
	Insertion sort
	Merge sort
	Selection sort
	It is not possible to know which will be slowest.

6.

What is the maximum number of locations a binary search algorithm would have to examine when looking for a particular value in a sorted array of 300 elements? (2 points)

	1
	7
	8
	9
	300

7.

As you work through this course, your instructor is here to facilitate it and encourage your success. It is important to reflect on what you have learned, so please take a moment to answer these two questions.
+What did you enjoy about this section of the course?
+What part of this assignment was difficult?

I am not sure about some of the problems

I can check what I still need to work on

8.

What is the maximum number of locations a sequential search algorithm will have to examine when looking for a particular value in an array of 50 elements? (2 points)

	50
	25
	12
	6
	1

9.

Which of the following sorting algorithms is described by this text? "Find the smallest item in the array and swap it with the item currently in index 0. Then, find the smallest remaining item, and swap it with the value at index 1. Continue this process until all items are placed into the array in the correct order." (3 points)

	Insertion sort
	Heap sort
	Merge sort
	Quick sort
	Selection sort

10.

An array of integers is to be sorted from smallest to largest using an insertion sort. Assume the array originally contains the following elements:

24  13  3  9  17  20

What will it look like after the third pass through the loop? (3 points)

	3  9  13  24  17  20
	3  9  13  17  24  20
	3  9  13  17  20  24
	9  13  24  3  20  17
	9  13  24  3  17  20

11.

An array of integers is to be sorted from largest to smallest using a selection sort. Assume the array originally contains the following elements:

10  8  23  19  21  16

What will it look like after the third pass through the loop? (3 points)

	23  21  19  10  8  16
	23  21  10  19  8  16
	23  21  19  16  10  8
	23  21  19  16  8  10
	23  8  10  19  21  16

12.

What is required to implement a sequential search? (2 points)

	Hash table
	Pivot value
	Recursive method
	Sorted data
	None of the above is required.

Answer 1

1.

What is the minimum number of locations a binary search algorithm will have to examine when looking for a particular value in a sorted array of 200 elements? (2 points)

Answer is 8, because 2^8 = 256 is the smallest number greater than 200 which is of 2 power.


2.
In general, which of the following sorting algorithms is the MOST efficient? (2 points)
Merge sort => O(nLogN)

3.
Which of the following are quadratic-sorting algorithms? (2 points)

I. insertion sort
II. selection sort
III. merge sort

II only are quadratic with worst case complexity as O(N^2)


4.

What is the minimum number of locations a sequential search algorithm will have to examine when looking for a particular value in an array of 200 elements? (2 points)

1 => As algorithm can find the element at first place itself.

Answering 4 starting question as per HomeworkLib policy. Request you to post remaining questions in separate thread, Thanks!