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
Acyclic Graphs In a directed graph a path is said to form a cycle is there exists a path (A,B,C,.....P) such that A = P. A graph is called acyclic graph if there is no cycle in

Describe different methods of developing algorithms with examples.

7. String manipulation 7.a Write a C Program using following string manipulation functions a) strcpy b) strncpy c) strcmp d) strncmp e) strlen f) strcat

what are grounded header linked lists?

Write an algorithm, using a flowchart, which inputs the heights of all 500 students and outputs the height of the tallest person and the shortest p erson in the school.

While BFS is applied, the vertices of the graph are divided into two categories. The vertices, that are visited as part of the search & those vertices that are not visited as part

Ask queConsider the following functional dependencies: Applicant_ID -> Applicant_Name Applicant_ID -> Applicant_Address Position_ID -> Positoin_Title Position_ID -> Date_Position_O

tree is graph or not

How many recursive calls are called by the naïve recursive algorithm for binomial coefficients, C(10, 5) and C(21, 12) C(n,k){c(n-1,k)+c(n-1,k-1) if 1 1 if k = n or k = 0

What is a Spanning tree of a graph? A Spanning Tree is any tree having of vertices of graph tree and some edges of graph is known as a spanning tree.