Consider a language that does not have arrays but does have
stacks as a data type.and PUSH POP..are all defined .Show
how a one dimensional array can be implemented by using two
stacks.
- 3 Answers
- 9667 Views
- Google, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / barun
In one stack keep values and in another stack keep index of
array. In other wards a[0] = 10. Then keep in bottom of
stack1 value 10 and in bottom of stack2 0. Both needs to be
synchronized in such implementation. Of course random access
is not possible.
| Is This Answer Correct ? | 6 Yes | 2 No |
Answer / gingercpu
One to pop and the other to push. Have to maintain all the
elements. Index converted to the # of push and pop
| Is This Answer Correct ? | 4 Yes | 2 No |
Answer / abdur rab
The arrays are always sequential, since we are going to use
stack, ther is no possibility for random access.
PUSH all the values in the stack1, then pop the value from
stack1 into stack2.
so whenever ther is a PUSH to stack1, we need to POP all
the elements from stack2 to stack1 and then PUSH the new
value. Now POP all the values from stack1 to stack2. It ud
work like a queue then.
| Is This Answer Correct ? | 4 Yes | 3 No |
What is memory leak in c?
int main() { Int n=20,i; For(i=0;i<=n;i--) { Printf(“-“); Return 0;
Which is better oop or procedural?
dibakar & vekatesh..uttejana here..abt ur reply for in place reversal of linked list..wats p stands for there?
Write a program to print distinct words in an input along with their count in input in decreasing order of their count..
what are the compilation steps? ( i want inside the compiler )
What is wrong with this program statement? void = 10;
What is the hardest programming language?
String concatenation
i have to apply for rbi before that i need to know the the syllabus for the entrance questions. whethet it may be aps or techinical
What is structure padding and packing in c?
what is the purpose of the code, and is there any problem with the code? int f( int n, int l, int r ) { return (n << l) >> r; }
C 
