Question 10809 – APPSC-2016-DL-CS
March 19, 2024Question 10831 – APPSC-2016-DL-CS
March 19, 2024APPSC-2016-DL-CS
| Question 18 |
Consider optimal implementation of two stacks growing in opposite directions in a single array A[n]. If t1 and t2 denote the stack pointers, which of the following, checks for stack full condition?
| t2=(n-1) or t1=(n-1) | |
| t1=n/2 or t2=(n-1) | |
| t1=0 and t2=(n-1) | |
| t2=t1+1 |
Question 18 Explanation:
Correct Answer: D
Question 18 Explanation: