Stack can be described as a pointer. Explain.
- 5 Answers
- 23762 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 |
Why insertion is faster in linked list?
What are doubly linked lists?
What are the disadvantages of representing a stack or queue by a linked list?
What can be stored in an arraylist?
What is a Queue? Explain its operation with example?
Different Types of pattern?
How many different trees are possible with 10 nodes ?
write a program to accept name & sort them?
How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3?
28 Answers Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro,
Define the tree data structure.
Why is hashset not ordered?
Why concurrenthashmap is fail safe?
Windows 
