Advance Algorithm MCQ's




Question 31 :
In a binary max heap containing n numbers, the smallest element can be found in time

  1. O(n)
  2. O(logn)
  3. O(loglogn)
  4. O(1)
  

Question 32 :
What is the special property of red-black trees and what root should always be?

  1. A colour of a node is either red or black and root should always be black colour only
  2. height of the tree
  3. pointer to next node
  4. A colour which is either green or black
  

Question 33 :
Push Relabel algorithm is used to find

  1. finding a flow between source and sink that is maximum
  2. finding a flow between source and sink that is minimum
  3. finding the shortest path between source and sink
  4. computing a minimum spanning tree
  

Question 34 :
Which of the terms is not used in a linear programming problem?

  1. Slack variables
  2. Objective function
  3. Concave region
  4. Feasible solution
  

Question 35 :
Problems that cannot be solved by any algorithm are called?

  1. tractable problems
  2. intractable problems
  3. undecidable problems
  4. decidable problems
  

Question 36 :
Which is the correct technique for finding a maximum matching in a graph?

  1. DFS traversal
  2. BFS traversal
  3. Shortest path traversal
  4. Heap order traversal
  

Question 37 :
Johnson's algorithm used to solve following problem?

  1. All pair shortest path
  2. Min-cut
  3. Single source shortest path
  4. Minimum spanning tree
  

Question 38 :
Bellman Ford algorithm uses which algorithm design technique?

  1. Dynamic Programming
  2. Greedy Algorithms
  3. Linear Programming
  4. Branch and Bound
  

Question 39 :
Another name for Jarvis march algorithm to find convex hull is

  1. Gift wrapping
  2. Bin packing
  3. Segment linking
  4. Region mapping
  

Question 40 :
Arrange the following in the increasing order of their asymptotic complexity in big theta notation 2n, log n, n! , n

  1. 2n < log n < n! < n
  2. 2n < n< n! < log n
  3. n < log n < 2n < n!
  4. log n < n < 2n < n!
  

Question 41 :
What is the complexity of Ford Fulkerson's algorithm?

  1. O(|f*| |E|)
  2. O(|E|)
  3. O(VE)
  4. O(|V|)
  

Question 42 :
The number of trees in a binomial heap with n nodes is

  1. logn
  2. n
  3. nlogn
  4. n/2
  

Question 43 :
The flow function f maps a value for each edge where ___________

  1. f(u,v) <=c(u,v)
  2. f(u,v)>= c(u,v)
  3. f(u,v) < c(u,v)
  4. f(u,v)> c(u,v)
  

Question 44 :
In what time can an augmented path be found?

  1. O(|E| log |V|)
  2. O(|E|)
  3. O(|E|2)
  4. O(|E|2 log |V|)
  

Question 45 :
If the cross product of the vectors p1 and p2 is 0 then

  1. p1 is clockwise from p2 with respect to the origin (0,0).
  2. p1 is counterclockwise from p2 with respect to the origin (0,0).
  3. Either p1 is clockwise from p2 or p2 is clockwise from p1
  4. p1 and p2 are collinear, pointing in either opposite or same direction.
  

Question 46 :
The running time of graham scan Algorithm for solving convex hull is(n=number of points in set Q).

  1. O(n)
  2. O(n.logn)
  3. O(logn)
  4. O(n^2)
  

Question 47 :
Which method of amortized analysis keeps the same amortized cost for all the operations?

  1. Aggregate Analysis
  2. Accounting Method
  3. Potential Method
  4. Dynamic Table
  

Question 48 :
How many cases are there in under master method?

  1. 2
  2. 3
  3. 4
  4. 5
  

Question 49 :
Which data structure Graham’s Scan algorithm uses for storing the points of convex hull?

  1. Tree
  2. Linked List
  3. Stack
  4. Queue
  

Question 50 :
Which of the following problems should be solved using dynamic programming?

  1. Merge sort
  2. Binary search
  3. Longest common subsequence
  4. Quick sort
  
Pages