Single Choice/ Multiple Choice Easy/ Moderate/ Difficult Topic or Sub-Topic Covered 1 CO1
Single Choice/ Multiple Choice Easy/ Moderate/ Difficult Topic or Sub-Topic Covered 1 CO1
Session – 2020-21
UNIT- 1
Single Easy Exception 32. A single try statement can have 1 CO1
Choice handling multiple except statements, help in
a) It does not support in python
b) to handle only one exception
c) to handle many exception
d) None of these
Single Easy Exception 33. Index error exception raised 1 CO1
Choice handling a) This exception is never raised
b) When a key is not found
c) When an index in not found
d) None of these
Single Easy Exception 34. Key error exception 1 CO1
Choice handling a) When specific key is not found in
a sequence
b) The exception does not exist
c) When key exist but program not
working
d) None of these
Single Easy Exception 35. Syntax error exception 1 CO1
Choice handling a) Raise when there is error in
python
b) when there is error in indentation
c) Due to system error
d) None of these
Single Easy Exception 36. Indentation error exception raised 1 CO1
Choice handling a) when there is syntax error
b ) When indentation is not specified
properly
c) When key is not define
d) None of these
Single Easy OOPS 37. Object is 1 CO1
Choice a) an entity that has state and
behavior.
b) an entity that has only state
c) It has only method
d) None of these
Single Easy OOPS 38. Which of the following is based in 1 CO1
Choice oops concept?
a) C++
b ) Java
c) python
d) All of these
Single Easy OOPS 39. What is base class in OOPS concept? 1 CO1
Choice a) Whose inherit all the properties of
another class
b) those class whose properties is
acquired
c) Both a and b
d) None of these
Single Easy OOPs 40. self parameter refers to 1 CO2
Choice a) current instances of the class and
access the class variable.
b) It does not access the class variable.
c) It help to access the method.
d) None of these
Single Easy Insertion sort 41. Best case time complexity of insertion 1 CO1
Choice sort.
a) O(n)
b) O(n2)
c) O(nlogn)
d) None of these
Single Hard sorting 42. Consider a situation where swap 1 CO4
Choice operation is very costly. Which of the
following sorting algorithms should be
preferred so that the numbers of swap
operations are minimized in general?
a) insertion
b) selection
c) Merge sort
d) None of these
Single Moderate sorting 43. Appropriate condition for best case 1 CO2
Choice complexity in case of insertion sort for
increasing order sorting
a) Descending order
b ) All element are identical
c) Random order
d) None of these
Single Hard Tower of 44. Total number of movement for 7 disk 1 CO5
Choice Hanoi in Tower of Hanoi problem
a) 128
b )127
c) 122
d) 126
Single Easy Sorting 45. Time complexity for merge sort 1 CO1
Choice algorithm
a) O(nlogn)
b) O(logn)
c) O(n)
d) None of these
Single Moderate Sorting 46. Recurrence function of merge sort. 1 CO3
Choice a) T(n)=2T(n/2)+O(n)
b) T(n)=2T(n)+1
c) T(n)=2T(n/2)
d) None of these
Single Moderate Tower of 47. Recurrence relation for tower of Hanoi 1 CO3
Choice Hanoi problem
a) T(n)=2T(n-1)+1
b) T(n)=2T(n/2)+1
c) T(n)=2T(n/4)+1
d) None of these
Single Easy sorting 48. Time complexity of binary search 1 CO1
Choice algorithm
a) O(logn)
b) O(nlogn)
c) O(n)
d) None of these
Single Moderate Searching 49. Recurrence relation for binary search 1 CO3
Choice algorithm
a) T(n)=T(n/4)+c
b) T(n)=T(n/2)+c
c) T(n)=T(n)+c
d) None of these
Single Moderate Tower of 50. The number of comparison required to 1 CO2
Choice Hanoi search x=5 for given element 1,2,5,7,9
a) 2
b) 1
c) 4
d) 3