Queue MCQ Quiz in मल्याळम - Objective Question with Answer for Queue - സൗജന്യ PDF ഡൗൺലോഡ് ചെയ്യുക

The correct answer is CPU scheduling

Key Points

• Queues are often used in operating systems for managing processes and scheduling tasks to be executed by the CPU.
• In CPU scheduling, processes are placed in a queue and are executed in a first-come-first-serve manner or based on priority, depending on the scheduling algorithm in use.

 Additional InformationApplications of Queue in Operating systems:

• Memory management 
• CPU Scheduling 
• Spooling in printers
• FCFS ( first come first serve) scheduling, example: FIFO queue
• Spooling in printers
• Semaphores

Breadth-first search (BFS) is an algorithm for traversing or searching   tree or graph data structures.

It starts at the tree root and explores the neighbor nodes first, before moving to the next level neighbors.

Breadth First Search (BFS) algorithm traverses a graph in a breadthward motion and uses a queue to remember to get the next vertex to start a search, when a dead end occurs in any iteration, while DFS uses stack.

If we see circular queue pictorially as

In circular queue, rear pointer points to the last inserted elements

Front pointer points to the element which will be deleted in next

So, according to that, if the given operations are performed.

i)

ii) 

iii)

iv)

v) 

vi)

The correct answer is option 3.

Concept:

Queue:

• The queue is an abstract data structure, somewhat similar to Stacks.
• Insertion in a queue happens at the rear end and deletion happens at the front end.
• Unlike stacks, a queue is open at both ends. One end is always used to insert data (en queue) and the other is used to remove data (de queue). Queue follows the First-In-First-Out methodology, i.e., the data item stored first will be accessed first.
• Queue follows the principle of First In First Out (FIFO) and Last In Last Out (LILO)

Explanation:

Queue follows the principle of First In First Out so the element which comes first popped first. The poped elements order is 10, 8, 17, and 6.

Hence the correct answer is 10, 8, 17, and 6.

The correct answer is option 2.

Concept:

Queues:

• The queue is an abstract data structure, somewhat similar to Stacks.
• Unlike stacks, a queue is open at both ends. One end is always used to insert data (en queue) and the other is used to remove data (dequeue). Queue follows the First-In-First-Out methodology, i.e., the data item stored first will be accessed first.
• Queue follows the principle of First In First Out (FIFO) and Last In Last Out (LILO)

Explanation:

If a train ticket is on the waiting list (such as W/L1), it means the ticket is in a queue of tickets waiting to get confirmed, as per the increasing order of waiting numbers. If a confirmed ticket is canceled, the W/ L1 numbered ticket is removed from the FRONT of the waiting queue and confirmed.

It follows the queue data structure. Stack is not suitable because it follows the first in last out (FILO) manner. Tree and linked lists are also not suitable because storing the previous node is required and they are not aware of which node came first.

Hence the correct answer is the queue.

The correct option is 11, 7, 11, 17 and 2

CONCEPT:

The queue is a linear data structure that follows First In First Out Order for insertion and deletion of items that take place using Front and Rear pointers.

EXPLANATION:

In the above question, items  2, 17, 11, 11, and 7  are added to Queue. 

The content in the Queue will be as follows:

    F                             R

Now if we perform 3 dequeue operations on the Queue:

                           F      R

Dequeued items are 2, 7, and 11 and are pushed into the stack in the same order as shown

Stack:

                         TOP          

Now 3 pop operations will remove the elements in the order 11, 7, and 2 which are then enqueued in the Queue

Queue:

                       F                       R

Enqueue:

While 1^st  stack is not empty, push everything from 1^st to 2^nd stack.

Push an element to 1^st stack.

Push everything back to 1^st stack.

Here time complexity will be O(n)

Dequeue:

while 1^st stack is not empty then Pop an item from stack1 and return it

The correct answer is O(1) 

Key Points

• A queue is a type of data structure that follows the First In, First Out (FIFO) principle. This means the first element added is the first one to be removed.
• When we add (enqueue) an element to a queue, it is typically added to the end of the queue.
• In an array-based queue, the addition operation involves placing the new element at the position indicated by the "rear" pointer and then incrementing that pointer. Other elements in the queue need not be shifted or checked. This operation is constant in time, i.e., O(1).
• Similarly, in a linked-list based queue, the addition of an element involves creating a new node, setting its value, and updating pointers (typically pointing the "next" reference of the last node to the newly added node). This operation does not depend on the size of the queue either, so it's also a constant-time operation i.e., O(1).

Regardless of the size of the queue, enqueue operation is always a constant time operation, having a time complexity of O(1).

Explanation:

We want to implement queue using stack which has three functions reverse, push and pop.

Example:

Suppose we want to insert a,b in queue using stack then

ENQUEUE item a:

Step 1: reverse (stack)

Step 2: push (a)

Step 3: reverse(stack)

ENQUEUE item b:

Step 1: reverse (stack)

Step 2: push (b)

Step 3: reverse(stack)

• After inserting b to stack if we want to DEQUEUE then only pop of top element is sufficient.
• So for ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction.
• Similarly DEQUEUE (reverse pop reverse) and ENQUEUE ( push ) is also valid for queue implementation.  

Hence option 3 is the correct answer.

Concept:

• Deque is also known as double ended queue
• New items can be added at either the front or the rear Likewise existing item can be removed from either end.

Explanation: (Diagram)

Hence option 1 is the correct answer.