Discrete Mathematics

Algorithms

Question 1
Marks : +2 | -2
Pass Ratio : 100%
The Worst case occurs in linear search algorithm when ____________
Item is somewhere in the middle of the array
Item is not in the array at all
Item is the last element in the array
Item is the last element in the array or is not there at all
Explanation:
The Worst case occur in linear search algorithm when Item is the last element in the array or is not there at all.
Question 2
Marks : +2 | -2
Pass Ratio : 100%
The complexity of merge sort algorithm is _________
O(n)
O(log n)
O(n2)
O(n log n)
Explanation:
The worst case complexity for merge sort is O(nlogn).
Question 3
Marks : +2 | -2
Pass Ratio : 100%
If a|b and a|c, then?
a|bc
c|a
a|(b+c)
b|a
Explanation:
If a|b and a|c then b = am and c = an for some integer m and n. Hence, b + c = a(m + n). Therefore, a|(b+c).
Question 4
Marks : +2 | -2
Pass Ratio : 100%
The value of 155 mod 9 is?
0
1
2
3
Explanation:
By the Division algorithm 155 = 9(17) + 2. Where remainder is 155 mod 9.
Question 5
Marks : +2 | -2
Pass Ratio : 100%
Out of the following which property algorithms does not share?
Input
Finiteness
Generality
Constancy
Explanation:
All the others are the properties of algorithms.
Question 6
Marks : +2 | -2
Pass Ratio : 100%
The worst case complexity for insertion sort is _________
O(n)
O(log n)
O(n2)
O(n log n)
Explanation:
In worst case nth comparison are required to insert the nth element into correct position.
Question 7
Marks : +2 | -2
Pass Ratio : 100%
The quotient and remainder when 18 is divided by 5 is?
2 and 3
1 and 2
3 and 2
3 and 3
Explanation:
According to the Division Algorithm 18 = 5(3) + 3. Hence, quotient when 18 divided by 5 is 3 = 18 div 5 and remainder when 18 divided by 5 is 3 = 18 mod 5.
Question 8
Marks : +2 | -2
Pass Ratio : 100%
List obtained in third pass of selection sort for list 3, 5, 4, 1, 2 is ___________
1, 2, 4, 3, 5
1, 2, 3, 4, 5
1, 5, 4, 3, 2
3, 5, 4, 1, 2
Explanation:
The selection sort begins with finding the least element in the list. This element is moved to front and then the least element among the remaining elements. Is found and put into the second position and so on.
Question 9
Marks : +2 | -2
Pass Ratio : 100%
If the entire list is searched sequentially without locating x in linear search, the solution is __________
0
-1
1
2
Explanation:
If the element is not found in the entire list, then the solution is 0.
Question 10
Marks : +2 | -2
Pass Ratio : 100%
The complexity of Binary search algorithm is _________
O(n)
O(log)
O(n2)
O(n log n)
Explanation:
The compexity of binary search is O(logn).