Stack can be described as a pointer. Explain.
- 5 Answers
- 23682 Views
- Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / pramod
Because stack will contain a head pointer which will always
point to the top of the Stack.
All Stack Operations are done using Head Pointer. Hence
Stack ca be Described as a Pointer
| Is This Answer Correct ? | 50 Yes | 4 No |
Answer / kavitha
stack is last in first out property,so lastly pushed
element is poped out first.so when a pointer is pointed it
always points out the head pointer i.e the top element in
the stack.,so stack is also described as pointer.
| Is This Answer Correct ? | 9 Yes | 1 No |
Answer / shweta
the TOP of Stack element is pointed by a pointer,when we
use PUSH and POP operations i.e. LIFO.
| Is This Answer Correct ? | 10 Yes | 3 No |
Answer / mousumi
Because stack will contain a head pointer which will always point to the top of the Stack. All Stack Operations are done using Head Pointer. Hence Stack can be Described as a Pointer
| Is This Answer Correct ? | 6 Yes | 1 No |
Answer / cse
Stack is also dynamic memory, without the hassle.
Dynamic memory uses pointers to check its value, free the
memory, etc.
| Is This Answer Correct ? | 1 Yes | 1 No |
For searches. Which one is most preferred: array list or linked list?
What do you mean by the term “percolate down”?
Can we add heterogeneous elements into treemap?
What is the difference between dictionary and hashtable?
What is vector and types of vector?
What are the major data structures used in the hierarchical data model?
What is a hashset?
Can arraylist contain null?
Explain set interface?
Explain what are the major data structures used in the network data model?
What is advantage and disadvantage of linked list?
Describe tree database. Explain its common uses.
Windows 
