Question
Statements: Z > L = I ≥ X = W > K = P, P < N = J
Conclusions: I. X > J II. J > K III. P ≤ L In the following question, the relationship between different elements is given in the statements followed by three conclusions I, II and III. Read the statements carefully and mark your answer accordingly.Solution
X = W > K = P < N = J                     No relationship can be established between X and J. Hence conclusion I is not true. K = P < N = J                                   J > K. Hence conclusion II is true. L = I ≥ X = W > K = P                       L > P. Hence conclusion III is not true.
Which algorithm finds Minimum Spanning Tree in a weighted graph by adding edges in increasing order?
The Master Theorem gives time complexity for recurrences of the form:
In hashing, what is a collision?
Which of the following properties must a problem exhibit to be solvable by a greedy algorithm?
A unique piece of information that is used in encryption.
Which of the following sorting algorithms is best for nearly sorted data?
Which algorithm returns a minimum spanning tree (MST) and uses a priority queue to select the next edge connected to the growing tree?
In a binary search tree (BST), what is true about the left child of a node?
What is the time complexity of inserting an element in a heap?
Depth-First Search (DFS) typically uses which data structure implicitly or explicitly?
