Download Android App in your Android Device from Google Play Store
- Search for "Withoutbook Practice Exam Test" in Mobile/Tablet Play Store
Practice InterviewNew Search by Name or Email

Exams Attended

Make Homepage

Bookmark this page

Subscribe Email Address

Data Structures Interview Questions and Answers

Ques 36. What method removes the value from the top of a stack?

Ans. 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.

Is it helpful? Add Comment View Comments
Ques 37. What does isEmpty() member method determines?
Ans. isEmpty() checks if the stack has at least one element. This method is called by Pop() before retrieving and returning the top element.
Is it helpful? Add Comment View Comments
Ques 38. What is a queue ?
Ans. 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.
Is it helpful? Add Comment View Comments
Ques 39. What is the relationship between a queue and its underlying array?
Ans. 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.
Is it helpful? Add Comment View Comments
Ques 40. Which process places data at the back of the queue?
Ans. Enqueue is the process that places data at the back of the queue.
Is it helpful? Add Comment View Comments

Most helpful rated by users:

©2019 WithoutBook