[Type A] Chapter – 10 Class 12 CS – Sumita Arora Assignment | Q/A

A stack is linear data structure in which LIFO (last in first out) principle is followed to store the data that means if insertion and deletion of the data is process on the same end known as top. Insertion operation of data is termed as push and deletion is termed as pop.
Its is dynamic memory structure as it changes shape and size.

A queue is linear data structure in which FIFO (first in first out) principle is followed to store the data. Queue operates on two nodes i.e. front end and rear end. In queue insertion id done on the rear/back end while the deletion is done end front end.
Its is dynamic memory structure as it changes shape and size.

In this both data structure came to real life operation.
In donation camp people in stand in queue and person enter queue first will get blanket first.
The blanket will be arranged in stack management in which blanket will be picked from top.

Input/output restricted queue is the data structure where restriction in insertion and deletion at specific node is imposed.

Input restricted is the queue in which deletion can be done at both end but insertion can only done at the specified node.

Output restricted is the queue in which the insertion can be done at both and the deletion can be done at specific node.

Enqueue operations is the insertion of the new element into the queue.

Dequeue operations is the deletion id the data from the queue.

Push operation is the inserting a new element at the rear end in most probably cases.

Pop operations is the deletion of element from the front end from queue.

• Memory arrangement.
• Expression evaluation.
• Expression conversion.
• Backtracking Procedure.

• Service request list.
• CPU task scheduling.
• Call centre phone system.
• Operational queue in execution.

Steal job algorithm in CPU processing of thread operation.