Brute Force

A walk which visits every vertex, returning to its starting vertex, is called a ...?

• tour

• extended walk

• spannig tree

• path

The travelling salesman problem involves finding a tour of minimum length.

• True

• False

What is the other term for Knapsack?

• rucksuck problem
• rucksack prablem
• rucksack problem
• racksack problem

1. Exhaustive search tries every possible solution to find an answer.

• True

• False

by using exhaustive search algorithm what is the possible routes between A and C

• ABC

• ADC

• ABC/

  ADC

By using exhaustive search algorithm which is the quickest routes to go from point A to E

• AFE

• ABE

Which of the following is true about Selection Sort?

• a. It is an unstable sorting algorithm.

• b. It is an adaptive sorting algorithm.

• c. It has a best-case time complexity of O(N log N).

• d. It is more efficient than Quick Sort.

Which sorting algorithm is more efficient than Selection Sort on average?

• a. Quick Sort

• b. Merge Sort

• c. Bubble Sort

• d. Insertion Sort

In Selection Sort, how many comparisons are made to sort an array of N elements?

• a. N

• b. N-1

• c. N^2

• d. N/2

Which of the following sorting algorithms is not an in-place sorting algorithm?

• a. Selection Sort

• b. Quick Sort

• c. Merge Sort

• d. Bubble Sort