Stack can be described as a pointer. Explain.
Answer Posted / 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 |
Post New Answer View All Answers
Which is the best book for data structures and algorithms?
Why set will not allow duplicates?
What is entryset in hashmap?
What is the use of bubble sort?
What is time complexity of quick sort?
Define graph?
What is the difference between b tree and binary search tree?
Who invented merge sort?
How do you assign an address to an element of a pointer array ?
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
Explain the internal working of a hash map?
Model a data structure for a DFA that takes an event as parameter and performs a desired action.
How does a selection sort work for an array?
Which language is best for data structures?
Explain binary searching and Fibinocci search?