Question
Statements: Q © E, S % C, E $ S, C @ AÂ
>Conclusions: I. A © C II. S % A III. C © Q In the following questions, the symbols @, #, %, $ and © are used with the following meaning as illustrated below- ‘A # B’ means ‘A is neither greater than nor equal to B’  ‘A © B’ means ‘A is neither equal to nor smaller than B’  ‘A % B’ means ‘A is neither smaller than nor greater than B’  ‘A $ B’ means ‘A is not smaller than B’  ‘A @ B’ means ‘A is not greater than B’ Now in each of the following questions assuming the given statement to be true, find which of the three conclusions I, II and III given below them is/are definitely true and give your answer accordingly.ÂSolution
Decoded Statement: Q> E, S = C, E ≥ S, C ≤ A Decoded conclusion: I. A > C      II. S= A                 III.C > Q Q > E ≥ S = C ≤ A              C ≤ A. Hence conclusion I is not true. Q > E ≥ S = C ≤ A               S ≤ A. Hence conclusion II is not true. Q > E ≥ S = C ≤ A               Q > C. Hence conclusion III is not true
Which algorithm returns a minimum spanning tree (MST) and uses a priority queue to select the next edge connected to the growing tree?
What is the time complexity of searching in a balanced binary search tree?
For which problem is dynamic programming NOT generally an applicable technique because it lacks overlapping subproblems?
Which of the following algorithms is most appropriate for a sorting task that requires minimal auxiliary space?
In a binary tree, if the number of leaf nodes is L, what is the number of nodes with two children?
Which of the following is true about the time complexity of Merge Sort?
The recurrence relation T(n) = 2T(n/2) + O(n) corresponds to which algorithm’s time complexity?
The amortized time for inserting into a dynamic array (like C++ vector) is:
Which data structure is most suitable for implementing recursion?
In hashing, what is a collision?
