Stack can be described as a pointer. Explain.
- 5 Answers
- 26222 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 |
How do you do a selection sort?
What is the idea behind splaying?
Explain quick sort?
Which language is best for data structures?
Does hashmap sort automatically?
Write a program to reverse a single linked list.
Devise a program to sort an array using bubble sort.
Define probing?
List the applications of stacks?
Whether Linked List is linear or Non-linear data structure?
What is collection sort?
How does variable declaration affect memory allocation?
Windows 
