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
The above 3 cases are also considered conversely while the parent of Z is to the right of its own parent. All the different kind of cases can be illustrated through an instance. Le

Program segment for deletion of any element from the queue delete() { int delvalue = 0; if (front == NULL) printf("Queue Empty"); { delvalue = front->value;

Comparison Techniques There are several techniques for determining the relevancy and relative position of two polygons. Not all tests may be used with all hidden-surface algori

In this assignment, you are invited to design and implement a software system for catalogue sale. A catalogue is organised in a tree structure. Each node of the catalogue tree repr

Threaded Binary Tree:- By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using

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

Binary Space Partition A binary space-partitioning (BSP) tree is an efficient method for determining object visibility by painting surfaces onto the screen from back to front,

Illustrate the intervals in mathematics Carrier set of a Range of T is the set of all sets of values v ∈ T such that for some start value s ∈ T and end value e ∈ T, either s ≤

3. A function to convert a complex number in algebraic form to a complex number in phasor form

Tree is a widely used data structure employed for representing several problems. We studied tree like a special case of acyclic graph. Though, rooted trees are most prominent of al