Interested to Buy Any Domain ? << Click Here >> for more details...
Stack can be described as a pointer. Explain.
- 5 Answers
- 25571 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
Define non-linear data structures?
What is an iterative algorithm?
Define secondary clustering?
What do you mean by shortest path?
Why do we need linked lists?
What is bubble sort used for?
How many types of data structure are there?
Write a program to insert an element and in the specific position in the array?
What type of memory allocation is referred for Linked lists?
What is a postfix expression?
What is huffman’s algorithm?
Describe what is Node in link list? And name the types of Linked Lists?
Can you sort a hashset?
On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.
What is the best case time complexity of bubble sort?
