Algorithm: MCQ Set – 07

Q61: The goal of hashing is to produce a search that takes

  • (A) O(1) time
  • (B) O(n2) time
  • (C) O( log n ) time
  • (D) O(n log n ) time

Q62: The time complexity of an algorithm T(n), where n is the input size, is given by T( n) = T( n – 1) + (1/n) if n > 1. The order of this algorithm is

  • (A) log n
  • (B) n
  • (C) n2
  • (D) nn

Q63: The number of edges in a Minimum Spanning Tree of a connected Graph G with n vertices is

  • (A) n log(n)
  • (B) n!
  • (C) n*(n-1)/2
  • (D) n – 1

Q64: Krushkal’s Algorithm uses

  • (A) Greedy Method
  • (B) Divide and Conquer Method.
  • (C) Dynamic Programming
  • (D) Branch & Bound Method

Q65: The “Principle of Optimality” is used in

  • (A) Greedy Method
  • (B) Backtracking
  • (C) Dynamic Programming
  • (D) Branch & Bound

Q66: Which of the following algorithm do not  have a time complexity of O(n2)

  • (A) Bubble Sort
  • (B) Shell Sort
  • (C) Radix Sort
  • (D) Quick Sort

Q67: f(n) = O (g(n) ) is

  • (A) g(n) is asymptotic upper bound for f(n)
  • (B) g(n) is asymptotic tight bound for f(n)
  • (C) g(n) is asymptotic lower bound for f(n)
  • (D) None of these

Q68: Graphs are represented using

  • (A) Adjacency tree
  • (B) Adjacency linked list
  • (C) Adjacency Graph
  • (D) Adjacency Queue

Q69: The goal of hashing is to produce a search that takes

  • (A) O(1) time
  • (B) O(n2) time
  • (C) O( log n ) time
  • (D) O(n log n ) time
  • (A) Uses a queue
  • (B) Uses a stack
  • (C) Searches a tree
  • (D) Searches a linked list

Answer:

QuestionQ61Q62Q63Q64Q65Q66Q67Q68Q69Q70
AnswerAADACCABAB

≪ Previous | Next ≫


Leave a Reply

Your email address will not be published.