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

Ask an Expert

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

Write your message here..

Related Questions

Interest rate, explain the determination of interest rate in the classical ... explain the determination of interest rate in the classical system.

Algorithm to add an element at the end of linked list, Write an algorithm t... Write an algorithm to add an element at the end of circular linked list.   Algorithm to Add the Element at the End of Circular Linked List. IINSENDCLL( INFO, LINK, START, A

The various ways in which lc code can be accessed, Problem Your LC code... Problem Your LC code is stored in a memory location as shown and the variable name is LC                  LC Memory address       Content(LC code)

Splaying procedure, For splaying, three trees are maintained, the central, ... For splaying, three trees are maintained, the central, left & right sub trees. At first, the central subtree is the complete tree and left and right subtrees are empty. The target

Hashing, what is hashing? what are diffrent method of hashing? what is hashing? what are diffrent method of hashing?

An undirected graph g with n vertices and e edges, An undirected graph G wi... An undirected graph G with n vertices and e edges is shown by adjacency list.  What is the time required to generate all the connected components? O (e+n)

Best case, for i=1 to n if a[i}>7 for j=2 to n a[j]=a{j}+j for n=2 to n a... for i=1 to n if a[i}>7 for j=2 to n a[j]=a{j}+j for n=2 to n a[k]=a[j]+i else if a[1]>4 && a[1] for 2 to a[1] a[j]= a{j]+5 else for 2to n a[j]=a[j]+i ..

Calculates partial sum of an integer, Now, consider a function that calcula... Now, consider a function that calculates partial sum of an integer n. int psum(int n) { int i, partial_sum; partial_sum = 0;                                           /* L

Write a program to create a hashed file, Write a program to create a hashed... Write a program to create a hashed file that stores the records currently in the file " data_2013 ". Records should use the same fixed-length schema given previously, and should ag

Technique for direct search, Technique for direct search is    Hashing ... Technique for direct search is    Hashing is the used for direct search.