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
HOW LINKED LIST HEADER WORKS? HOW TO INSERT AND DELETE ELEMENTS IN LINKED LIST?

Q. Explain the term hashing? Explain any five well known hash functions.                         Ans: Hashing method provides us the direct access of record from the f

Triangular Matrices Tiangular Matrices is of 2 types: a)  Lower triangular b)  Upper triangular

Explain Space Complexity Space Complexity :- The space complexity of an algorithm is the amount of memory it requires to run to completion. Some of the reasons to study space

Q. Let a binary tree 'T' be in memory. Write a procedure to delete all terminal nodes of the tree.       A n s . fun ction to Delete Terminal Nodes from Binary Tree

Describe Binary Search Tree (BST)? Make a BST for the given sequence of numbers. 45, 36, 76, 23, 89, 115, 98, 39, 41, 56, 69, 48 Traverse the obtained tree in Preorder, Inord

Enumerate about the carrier set members Ruby is written in C, so carrier set members (which is, individual symbols) are implemented as fixed-size arrays of characters (which is

A significant aspect of Abstract Data Types is that they explain the properties of a data structure without specifying the details of its implementation. The properties might be im

/* The program accepts matrix like input & prints the 3-tuple representation of it*/ #include void main() { int a[5][5],rows,columns,i,j; printf("enter the order of

Question a) Describe how the endogenous model is an improvement to the neo-classical model in explaining the long-run effect of investment on economic growth of a country.