Interested to Buy Any Domain ? << Click Here >> for more details...
Stack can be described as a pointer. Explain.
- 5 Answers
- 25637 Views
- Wipro, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What are the advantages and disadvantages of copyonwritearraylist?
What is dangling pointer and how to avoid it?
What is meant by int?
Which algorithm is used in collections sort method?
What are the advantages of linked list over array (static data structure)?
What is difference between hashtable and hashmap?
Explain the term recursive case?
How do hash tables work?
What is the best sorting technique?
What is the Role of push() and pop() method?
Describe tree database. Explain its common uses.
How do you find the complexity of a selection sort?
Does treeset allow null?
What is data algorithm?
Why is waste sorting important?
