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
Tech Content | Educational Content