CIT237 TMA4 QUESTION

1. Who among the options proposed an algorithm that finds a pth without any backtracking?

Conrad et al
Warnsdorff
Ball
None of the option

2. Which of the following is not an efficiency of Quick sort algorithm
Cbest(n) E (O 9n2))
Cworst(n) E O n2)
Cavg (n) = O
Cbest (n) = O (n (log2 n)

3.Which of the options can be based 0n both a recursive and non-recursive algorithms?
Bubble sort
Binary search
Merge sort
Selection sort

4.Which of the options is the standard number of rows and columns in a chess board?
16 rows and 16 columns
32 rows and 32 columns
8 rows and 8 columns
None of the options

5.The following are an efficient of binary search,except?
Cworst (n) E O (log n)
Cavg (n) = 1
Cbest (n) = 1
Cavg (n) = 1 (log2 n)

6.Which of the following options is used as a part of many geometric algorithms?
searching
Sorting
All of the options
None of the options

7.Which of the options is a procedure for solving computational problems?
A computational problem
An algorithm
An Instance
None of the Options

8.Which of the options works by comparing a search key K with the array's middle element.?
Merge sort
Bubble sort,
Binary search,
None of the options

9.Which of the options is correct about a queen in a chess?
A queen can move only in horizontal direction
A queen can move as far as she pleases
A queen can move only in vertically direction
None of the options

10.Which of the following options is the family where Hill Climbing belongs,
LAN
WAN
Local search
None of the options

11.Which of the options is the algorithms with divide-and-conquer technique?
Merge sort
Quick sort
All of the options
None of the Options

12.Which of the options divide its input's elements according to their position in the array?
For orderly analysis and presentation of items
For locating an item within a set
For finding duplicate values with a set
None of the options

13.Which of the following is not an example of divide-conquer approch?
Quick sort
Binary search
Merge sort
None of the Options

14.Which of the following Options divide its elements according to their value
Quick sort
Merge sort
Binary search
None of the Options

15.Which of the options do you need to scan the entire given list to find its smallest elements
Selection sort,
Binary search,
Bubble sort,
All of the options

16.Which of the options is to compare adjacent elements of the list and exchange them if the are out of order?
Selection sort,
Bubble Sort,
Merge Sort,
None of the Options

17.Which of the options is a fast and easy way to transverse an array of a given set of elements
Merge sort
Bubble sort
Binary search
All of the Options

18.Which of the following options is true about Hill climbing Technique?
It can be used to solve problem that have few solutions,
It can be used to solve problem that have many solutions,
All of the above
None of the Options

19.Which of the options is Hill Climbing widly used?
Network,
Artifical Intelligence fields,
All of the Options
None of the Options

20.Who among the options discovered another linear time algorithm and proved that it solves the Hamiltonia path problem for all n > - 5?
Warndorff,
Conrad et al,
Dudeney,
Euler