Question
If a stack is implemented using a fixed-size array, what
is a significant disadvantage when the stack grows beyond its initial capacity?Solution
A fixed-size array implementation of a stack will lead to a "stack overflow" error if more elements are pushed than the array can hold, as it cannot dynamically resize.
Statements: J > K > M ≤ N < O; M > P > L
Conclusions:
I. J > L
II. P < O
III. J > O
Statements: J < K < M = L, D = E > F, F ≥ G < H = I > J
Conclusions:
I. D > K
II. I < L
III. E > J
Statement: M < N; L ≥ U; L ≥ Q; U > N ≥ T
Conclusion:
I. N > Q
II. Q > T
Statements: T ≤ Q > B = W, Q ≥ E ≥ H
Conclusion:
I. B > H
II. T ≥ E
III. H = W
Statements: W ≤ T = R; T < U < S; X = W ≥ Y
Conclusions:
I. S > Y
II. W ≥ S
III. U ≥ Y
Which of the following symbols should replace (1) and (2) respectively in the given expression in order to make the expression N > P definitely true?
Given statement shows the relation between different elements followed by two conclusions.Â
Statement: B2 = T4 < E3 ≤ G5 > F6 = H7 > Q8Â
...Statement: Q > R; O < K ≤ N; O ≥ S > R
Conclusion: I. O ≥ Q     II. R < N.
Statement:
O ≤ P > K ≤ L; W ≤ X = K > R; Q > L
Conclusion:
I. O > K
II. L < P
Statements: W ≤ B = F; H > T; H < U < F; W ≤ X < S
Conclusions:
I. W < U
II. T < B
III. X > H
