Q.1
Which of the following is also known as LCM?
  • lowest common divisor
  • least common multiple
  • lowest common measure
  • highest common multiple
Q.2
What is the LCM according to the given Venn Diagram?
  • 2
  • 3 c) 180
  • d) 6
Q.3
What is the time complexity of the above recursive implementation used to reverse a string?
  • o(1)
  • o(n)
  • o(n2)
  • o(n3)
Q.4
What can be the maximum sum of digits for a 4 digit number?
  • 1
  • 16
  • 36
  • 26
Q.5
What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?
  • o(n)
  • o(n2)
  • o(n3)
  • o(n!)
Q.6
What can be the minimum sum of digits for a 4 digit number?
  • 0
  • 1
  • 16
  • 36
Q.7
Which of the following is not the algorithm to find the minimum spanning tree of the given graph?
  • boruvka’s algorithm
  • prim’s algorithm
  • kruskal’s algorithm
  • bellman–ford algorithm
Q.8
Which of the following strategies does the following diagram depict?
  • divide and conquer strategy
  • brute force
  • exhaustive search
  • backtracking
Q.9
How many Hamiltonian paths does the following graph have?
  • 1
  • 2
  • 3
  • 4
0 h : 0 m : 1 s