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

Here is class 12 computer science Unit 1 [Type A] solutions for Sumita Arora back exercise assignment. Below includes both textual and video solutions wherever required. View all the answers in assignment for chapter 10 and for all chapters here.

Watch all tutorials for chapter 10.

Q1: What is a stack?

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.

Q2: What is a queue?

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.

Q3: Which data structure will you use for simulating a blanket donation camp?

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.

Q4: Differentiate between :                                                                                                                               
(i) Linear Queue and Circular Queue                                                                                                 
(ii) A Queue and a Deque
Linear queueCircular queue
A linear queue will have two nodes i.e. front and rear end.In circular queue both the rear and front is connected.
Insertion from rear end and deletion from front end.Insertion and deletion can be done at the any node.
Require more memory.Require less memory.
Less efficientMore efficient

In queue a linear data structure implementation is followedIn deque, it is called as deck i.e. double ended queue.
In this insertion happens at the rear end and insertion at the front end.In this both the end is open for insertion and deletion.
In this accessing a traversing complexity is more.Traversing complexity is less than queue.
Q5: What are the input/output restricted queues?

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.

Q6: What are enqueue and dequeue operations?

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

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

Q7: What are push and pop operations?

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.

Q8: Give some examples of stack applications.
  • Memory arrangement.
  • Expression evaluation.
  • Expression conversion.
  • Backtracking Procedure.
Q9: Give some examples of queue applications.
  • Service request list.
  • CPU task scheduling.
  • Call centre phone system.
  • Operational queue in execution.
Q10: Can you suggest a real-life application for input/output restricted queues?

Steal job algorithm in CPU processing of thread operation.

Clear Doubts with Computer Tutor
In case you’re facing problems in understanding concepts, writing programs, solving questions, want to learn fun facts | tips | tricks or absolutely anything around computer science, feel free to join CTs learner-teacher community: students.computertutor.in

You cannot copy content of this page