Applications of the queue, Data Structure & Algorithms

Write down any four applications of the queues.                                                           

Ans.

Application of Queue is given below

(i)  Queue is used in time the sharing system in which the programs with  the same priority form a queue while waiting to be executed.

(ii) Queue is used for completing the level order traversal of a binary tree and for performing breadth first search at a graph.

(iii)  It is also used in simulation related problem.

(iv) When the jobs are submitted to the networked printer, they are arranged in order of arrival, ie. Jobs are smartly arranged in a queue.

 

 

Posted Date: 7/13/2012 2:09:33 AM | Location : United States







Related Discussions:- Applications of the queue, Assignment Help, Ask Question on Applications of the queue, Get Answer, Expert's Help, Applications of the queue Discussions

Write discussion on Applications of the queue
Your posts are moderated
Related Questions
In the present scenario of global warming, the computer hard ware and software are also contributing for the increase in the temperature in the environment and contributing for the

What do you understand by term structured programming? Explain the structured programming as well.                                 Ans. S tructured Programming is expla

Two broad classes of collision resolution techniques are A) open addressing and B) chaining

Create a Money data structure that is made up of amount and currency. (a) Write a constructor for this data structure (b) Create accessors for this data structure (c) Writ

Ask question #Minimum 10000 words accepted#

Illustrates the program for Binary Search. Program: Binary Search /*Header Files*/ #include #include /*Functions*/ void binary_search(int array[ ], int value,

A circular queue can be implemented through arrays or linked lists. Program 6 gives the array implementation of any circular queue. Program 6: Array implementation of any Circu

Data Structure and Algorithm 1. Explain linked list and its types. How do you represent linked list in memory? 2. List and elucidate the types of binary tree. 3. Descr

A full binary tree with 2n+1 nodes have n non-leaf nodes

This is the most extensively used internal sorting algorithm. In its fundamental form, it was invented by C.A.R. Hoare in the year of 1960. Its popularity lies in the easiness of i