COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
overflow
|
|
|
underflow
|
|
|
null pointer exception
|
|
|
all of the mentioned
|
Detailed explanation-1: -Operations on a queue. Source: Lindemuth 2019. Inserting an element to a queue is called enqueue operation. Element is added at the queue’s rear end.
Detailed explanation-2: -a) overflow. b) underflow. c) null pointer exception. d) program won’t be compiled. Explanation: Just as stack, inserting into a full queue is termed overflow.
Detailed explanation-3: -About queue overflow IMS message queues have a limit on the number of messages that they can contain. The IMS Queue Manager can detect when this limit is reached and will respond to this limit by shutting down IMS (UABEND 758). This condition is known as queue overflow .
Detailed explanation-4: -Adding an entry to a stack is known as a push operation, while removing an entry from a stack is known as a pop operation. There are two possible errors that can be caused when pushing onto/popping from a stack: stack underflow-trying to pop an item from an empty stack.
Detailed explanation-5: -The insertion of an element in a queue is called an enqueue operation and the deletion of an element is called a dequeue operation.