Queues-and-Stacks

Question 81

Application of data structure queue is :

A	Level wise printing of tree
B	Implementation of priority queues
C	Function call implementation
D	Depth first search in a graph

Data-StructuresQueues-and-StacksUGC NET CS 2006 June-Paper-2

Question 81 Explanation:

Application of data structure queue is implementation of priority queues. In a priority queue, an element with high priority is served before an element with low priority. In some implementations, if two elements have the same priority, they are served according to the order in which they were enqueued, while in other implementations, ordering of elements with the same priority is undefined. While priority queues are often implemented with heaps.
Applications:
1.Bandwidth management
2.Discrete event simulation
3.Dijkstra’s algorithm
4.Huffman coding
5.Best-first search algorithms
6.ROAM triangulation algorithm
7.Prim’s algorithm for minimum spanning tree

Correct Answer: B

Question 81 Explanation:

Application of data structure queue is implementation of priority queues. In a priority queue, an element with high priority is served before an element with low priority. In some implementations, if two elements have the same priority, they are served according to the order in which they were enqueued, while in other implementations, ordering of elements with the same priority is undefined. While priority queues are often implemented with heaps.
Applications:
1.Bandwidth management
2.Discrete event simulation
3.Dijkstra’s algorithm
4.Huffman coding
5.Best-first search algorithms
6.ROAM triangulation algorithm
7.Prim’s algorithm for minimum spanning tree

Theory-of-Computation

Digital-Logic-Design

Theory-of-Computation

Digital-Logic-Design

Queues-and-Stacks

Azhar Rashid