MCQ IN COMPUTER SCIENCE & ENGINEERING

Previous
Next

COMPUTER SCIENCE AND ENGINEERING

DATA STRUCTURES

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Insertion in Queue is done at ____ end, and deletion is at ____ end
A
start, last
B
front, rear
C
rear, front
D
begin, stop
Explanation: 

Detailed explanation-1: -A queue is an important data structure in programming. A queue follows the FIFO (First In First Out) method and is open at both of its ends. Data insertion is done at one end rear end or the tail of the queue while deletion is done at the other end called the front end or the head of the queue.

Detailed explanation-2: -A queue is an ordered list in which all insertions take place at one end, the rear, while all deletions take place at the other end, the front.

Detailed explanation-3: -Insertion and deletion in queues takes place from the opposite ends of the list. The insertion takes place at the rear of the list and the deletion takes place from the front of the list.

Detailed explanation-4: -Double ended Queue: Double Ended Queue is also a Queue data structure in which the insertion and deletion operations are performed at both the ends (front and rear).

There is 1 question to complete.
Previous
Next