Pructor Python Quiz 10 by anupmaurya June 24, 2021 written by anupmaurya 0 comment Welcome to your Pructor Python Quiz 10 Name Email 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) 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. How many swaps will be performed in selection sort in worst case : a)zero b)one c)n-1 d)n 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) 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. Time's up Share 0 FacebookTwitterLinkedinRedditWhatsappTelegramEmail anupmaurya Hey there, My name is Anup Maurya. I was born with love with programming and works at TCS. One of best global (IT) services and consulting company as System Administrator . I also love graphics designing. It's my 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. * By using this form you agree with the storage and handling of your data by this website.