Question
Which data structure allows efficient insertion and
deletion of elements at both ends?Solution
Linked List allow operations on both ends.
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: T < U = S ≤ O, C > Y ≥ X, T > K = X
Conclusions :I. O > K II. C < T III. U > K
Statements: E > G < H > F = I ≥ J > K ≥ D
Conclusion
I: J < H
II: I > D
Statements: U = T ≥ J < Y ≤ X; C ≥ Z > X ≤ P = S.
Conclusions:
I. J ≤ P
II. S > T
In the question, assuming the given statements to be true, Find which of the conclusion (s) among given three conclusions is /are definitely true and t...
Statements: M ≤ N = O ≤ P; P = Q ≤ U; R > N = U
Conclusions:
I. R > O
II. U ≥ M
In the question, relationship between some elements is shown in the statements (s). These statements are followed by two conclusions. Read the statemen...
Statements:
A < L ≤ P > D; F > W = P > S ≥ T
Conclusion:
I. S > L
II. F ≥ A
In the question, assuming the given statements to be true, find which of the conclusion (s) among given two conclusions is/are definitely true and then...
Statements: K * D, D $ N, N % M, M © W
Conclusions: I.M % W II.M $ W III.N @ D�...
Relevant for Exams:
