Question 31 : What is the complexity of quick sort algorithm?

- O(n2)
- O(logn)
- O(n)
- O(nlogn)

Question 32 : What is runtime complexity of graham scan algorithm, if the points are already sorted by one of the coordinates or by the angle to a fixed vector?

- O(nlogn )
- O(n)
- O(logn )
- O(n2 )

Question 33 : In Binomial Heap, there are B0, B1, B2and B3 binomial trees present, so how many total nodes are there in BH?

- 11
- 13
- 15
- 4

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

- All pair shortest path
- Min-cut
- Single source shortest path
- Minimum spanning tree

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

- Dynamic Programming
- Greedy Algorithms
- Linear Programming
- Branch and Bound

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

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

Question 37 : Which data structure Grahamâ€™s Scan algorithm uses for storing the points of convex hull?

- Tree
- Linked List
- Stack
- Queue

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

- DFS traversal
- BFS traversal
- Shortest path traversal
- Heap order traversal

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

- O(|f*| |E|)
- O(|E|)
- O(VE)
- O(|V|)

Question 40 : When inserting a new entry into red black tree, the newly created node will be

- red,if the new node is not the root node
- red, if the new node is the root node
- black if the new node is not the root node
- the same color as its sibling

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

- f(u,v) <=c(u,v)
- f(u,v)>= c(u,v)
- f(u,v) < c(u,v)
- f(u,v)> c(u,v)

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

- logn
- n
- nlogn
- n/2

Question 43 : To prove NP-Completeness of a problem

- Select a known P problem
- Select a known NP problem
- Select a known NP-Complete problem
- Select a known NP-Hard problem

Question 44 : Cross product of two vectors originating at origin can be interpreted as

- Area of Square
- Perimeter of Square
- Area of Parallelogram
- Perimeter of Parallelogram

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

- Merge sort
- Binary search
- Longest common subsequence
- Quick sort

Question 46 : Which of the following method is taking overcharge for some operations in amortized analysis

- aggregate method
- potential method
- average method
- accounting method

Question 47 : For solving recurrences, which of the following method is used to generate a good guess of the solution?

- Iteration method
- Substitution method
- Recursion tree method
- Master method

Question 48 : Approach used by Matrix chain multiplication algorithm

- Dynamic Programming
- Greedy
- Brute Force
- Branch and Bound

Question 49 : Which technique of Ford- Fulkerson algorithm helps it to solve max flow problem

- Naive greedy algorithm approach
- Minimum spanning tree
- Residual graphs
- Minimum cut

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

- a color which is either red or black and root should always be black color only
- height of the tree
- pointer to next node
- a color which is either green or black