Pructor Python Quiz 10 by anupmaurya June 24, 2021 written by anupmaurya June 24, 2021 234 Welcome to your Pructor Python Quiz 10 1. In a binary search algorithm, Which is the worst case scenario: a)O(1) b)O(log n) c)O(n) d)O(n/2) 1 out of 5 2. Which statement is correct in case of tower of hanoi ? a)It consists of more than three rods. b)Only one disk can move at a time. c)any disk can be moved on to any one. d)None of the above. 2 out of 5 3. How many swaps will be performed in selection sort in worst case : a)zero b)one c)n-1 d)n 3 out of 5 4. Which of the following is true for binary search algorithm :- a)Array can be in sorted order b)Search is performed by repetedly dividing search interval into one fourth c)If there are two or more numbers equals to the search item, either can be true depending on implementation d)Its best case complexity is O(log n) 4 out of 5 5. Which of the following statement is true for recursion ? a)Absence of base condition can cause infinite loop. b)There is only one base case c)Both 1 and 2. d)None of the above. 5 out of 5 Name Email Time's upTime is Up! 0 comment 1 FacebookTwitterPinterestEmail anupmaurya "Hi there, My name is Anup Maurya. I have a passion for programming and previously worked at TCS, one of the best global IT services and consulting companies, as a System Administrator. I also enjoy graphic design. It's a pleasure to have you here." previous post Prutor Python Quiz 4 Leave a Comment Cancel Reply Save my name, email, and website in this browser for the next time I comment.
