Algorithm: MCQ Set – 13

Algorithm: MCQ Set – 13

Q121: f(n) =n2 , g(n) = n3 ,then which of the following is not correct?

  • (A) g(n) = Ω(n)
  • (B) g(n) = O(n2)
  • (C) g(n) = O(n3)
  • (D) g(n) = Ω(f(n))

Q122: “Longest Common Subsequence” Problem can be solved by

  • (A) Greedy Method
  • (B) Dynamic Programming
  • (C) Backtracking
  • (D) None of these

Q123: The Time Complexity of finding Transitive Closure of a Binary Relation on a set of n elements is known to be

  • (A) O (n3)
  • (B) O (n)
  • (C) O (n2 log n)
  • (D) O (n2)

Q124: Divide & Conquer can’t solve Problems like

  • (A) Merge Sort
  • (B) Exponentiation
  • (C) Minimum Spanning Tree
  • (D) Binary Search

Q125: Binary Search method uses as input

  • (A) Unsorted Array
  • (B) Linear Linked List
  • (C) Sorted Array
  • (D) Hash Table

Q126: Which of the following is not the required condition for binary search algorithm?

  • (A) There must be mechanism to delete or insert elements in the list
  • (B) there should be the direct access to the middle element in any sublist
  • (C) The list must be sorted
  • (D) None of these

Q127: One NP-Complete Problem can be reduced to another problem of NP in What time?

  • (A) Polynomial Time
  • (B) Exponential Time
  • (C) Linear Time
  • (D) Logarithmic Time

Q128: Feasible Solution in Greedy Method is

  • (A) Satisfying constraints
  • (B) Always optimal
  • (C) Not a solution
  • (D) None of these