PYTHON QUIZ 10 ASSIGNMENT WITH SOLUTION ( AKTU )
Q:1. In a binary search algorithm, Which is the worst case scenario:-
1.O(1)
2.O(log n)
3.O(n)
4.O(n/2)
Answer:- 3.O(n)
Reason :- coming soon
JOIN OUR YOUTUBE CHANNEL - CLICK - HERE
Q:2. Which statement is correct in case of tower of hanoi ?
1.It consists of more than three rods.
2.Only one disk can move at a time.
3.any disk can be moved on to any one.
4.None of the above.
Answer:- 2.Only one disk can move at a time.
Reason :- coming soon
JOIN OUR YOUTUBE CHANNEL - CLICK - HERE
Q:3. How many swaps will be performed in selection sort in worst case :-
1.zero
2.one
3.n-1
4.n
Answer:- 3.n-1
Reason :- coming soon
JOIN OUR YOUTUBE CHANNEL - CLICK - HERE
Q:4. Which of the following is true for binary search algorithm :-
1.Array should be in unsorted order
2.Search is performed by repetedly dividing search interval into one fourth
3.If there are two numbers equals to the search item ( number to be searched ), it can pick anyone depending on the implementation
4.Its best case complexity is O(log n)
Answer:- 4.Its best case complexity is O(log n)
Reason :- coming soon
JOIN OUR YOUTUBE CHANNEL - CLICK - HERE
Q:5. Which of the following statement is true for recursion ?
1.Absence of base condition can cause infinite loop.
2.There is only one base case.
3.Both 1 and 2.
4.None of the above.
Answer:- 1.Absence of base condition can cause infinite loop.
Reason:- coming soon .
JOIN OUR YOUTUBE CHANNEL - CLICK - HERE
Posts
 ( python quiz 10 solution aktu ){kind=link}
0 Comments