Data Structures 면접 질문과 답변
Ques 36. What method removes the value from the top of a stack?
The pop() member method removes the value from the top of a stack, which is then returned by the pop() member method to the statement that calls the pop() member method.
Ques 37. What does isEmpty() member method determines?
isEmpty() checks if the stack has at least one element. This method is called by Pop() before retrieving and returning the top element.
Ques 38. What is a queue ?
A Queue is a sequential organization of data. A queue is a first in first out type of data structure. An element is inserted at the last position and an element is always taken out from the first position.
Ques 39. What is the relationship between a queue and its underlying array?
Data stored in a queue is actually stored in an array. Two indexes, front and end will be used to identify the start and end of the queue.
When an element is removed front will be incremented by 1. In case it reaches past the last index available it will be reset to 0. Then it will be checked with end. If it is greater than end queue is empty.
When an element is added end will be incremented by 1. In case it reaches past the last index available it will be reset to 0. After incrementing it will be checked with front. If they are equal queue is full.
Ques 40. Which process places data at the back of the queue?
Enqueue is the process that places data at the back of the queue.
Most helpful rated by users:
- What is data structure?
- List out the areas in which data structures are applied extensively?
- What is the data structures used to perform recursion?
- If you are using C language to implement the heterogeneous linked list, what pointer type will you use?
- What are the methods available in storing sequential files ?