Topic: Queue | BPSC Paper-2 Computer Science Notes

Topic: QUEUE

Summary notes on topic "Queue"

-----------------------------------

• Queue is an ordered linear data structure, following FIFO strategy.

• Front and Rear are used to indicate beginning and end of queue.

• In Python, the use of predefined methods takes care of Front and Rear.

• Insertion in a queue happens at the rear end. Deletion happens at the front.

• Insertion operation is known as enqueue and deletion operation is known as dequeue.

• To support enqueue and dequeue operations, isEmpty, isfull and peek operations are used

• Deque is a version of queue, which allows insertion and deletion at both ends.

• A deque can support both stack and queue operations.

• Other operations supported by deque are insertfront, insertrear, deletefront, deleterear, getfront, getrear, isempty and isfull.

MCQ Qu-Ans

Qu: The end from which elements are added or deleted is called _________ of a stack.

Stack
Tree
Linked list
Queue
All Above/None Above

Qu: Trying to add an element to a full stack results in an exception called __________

Array
Queue
Tree
Queue
All Above/None Above

Qu: __________ adds a new element at the TOP of the stack.

One
MAX_SIZE-1
MAX_SIZE
MAX_SIZE
All Above/None Above

Qu: Built-in method of list to add an element to the stack.

LIFO (Last In First Out) list.
Ordered array
Linear tree
Fifo (First in First Out) List
All Above/None Above

$ads={1}

Qu: Trying to pop an element from an empty stack results into a special condition called________ .

Queue
Linked list
None
Queue
All Above/None Above

Qu: Any arithmetic expression can be represented in any of the notation.

DCBA
DCAB
ABCD
ABCD
All Above/None Above

Qu: x+y can be written as xy+. This is called

At the tail of the link list
At the centre position in the link list
None
At the tail of the link list
All Above/None Above

Qu: Polish mathematician Jan Lukasiewicz in the 1920’s introduced a different way of representing arithmetic expression, called

Deletion
To empty a queue
None
None
All Above/None Above

$ads={2}

Qu: Insertion in queue happens at the ________ end. Deletion happens at the __________.

Deletion
To empty a queue
Both a) and c)
Both a) and c)
All Above/None Above

Qu: Queue is an ordered linear data structure, following ___________ strategy.

rear=rear%(MAX_SIZE+1)
rear=(rear+1)%MAX_SIZE
rear=rear+(1%MAX_SIZE)
rear=(rear+1)%MAX_SIZE
All Above/None Above

Qu: The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

Front=(rear+1)%MAX_SIZE
Rear=front+1
Rear=(front+1)%MAX_SIZE
Front=(rear+1)%MAX_SIZE
All Above/None Above

Qu: The data structure required to check whether an expression contains balanced parenthesis is?

7
9
10
0
All Above/None Above

Qu: What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

Front= rear=-1
Front=rear+1
Front=(rear+1)%MAX_SIZE
Front= rear=-1
All Above/None Above

Qu: The process of accessing data stored in a serial access memory is similar to manipulating data on a ------?

Circular queue
Dequeue
Priority queue
Dequeue
All Above/None Above

Qu: The postfix form of A*B+C/D is?

Only rear pointer
Both front and rear pointer
None of the front and rear pointer
Only rear pointer
All Above/None Above

Qu: Which data structure is needed to convert infix notation to postfix notation?

Front=(rear+1)mod MAX_SIZE
Front=rear+1
Rear=front
Rear=MAX_SIZE-1
All Above/None Above

Qu: The prefix form of A-B/ (C * D ⋀ E) is?

Only rear pointer
Both front and rear pointer
None
Both front and rear pointer
All Above/None Above

Qu: What is the result of the following operation Top (Push (S, X))

One
MAX_SIZE-1
MAX_SIZE
MAX_SIZE
All Above/None Above