edited by
806 views
0 votes
0 votes

Application of data structure queue is :

  1. Levelwise printing of tree
  2. Implementation of priority queues
  3. Function call implementation
  4. Depth first search in a graph
edited by

3 Answers

0 votes
0 votes

Queue is used for Level order traversing of a tree.

Stack is used for implementing: Function call implementation and Depth first search in a graph.

For priority queues we generally use heap.

0 votes
0 votes
Queue Data structure is used in Level order traversal of the tree BFS, rest all are the application of Stack data structure so the correct answer is B
0 votes
0 votes

Ans: A) Seem to be most suitable

For Function call implementation & Depth first search in a graph “Stack” is suitable

Priority Queues can be implemented mostly using common data structures like arrays, linked-lists, heaps and binary trees

 

 

Related questions

0 votes
0 votes
1 answer
1
go_editor asked Mar 27, 2020
4,578 views
Which statement is wrong If linked origin $\neq$ translated origin, relocation must be performed by the linkerIf load $\neq$ linked origin, the loader must perform reloca...
0 votes
0 votes
0 answers
2
go_editor asked Mar 27, 2020
737 views
Tasks done in parsing are:Check the validity of a source stringDetermine the syntactic structure of a source stringBoth A and BNone of these
0 votes
0 votes
1 answer
3
go_editor asked Mar 27, 2020
344 views
$\text{YACC}$ builds up _____parsing table.$\text{LALR}$$\text{LR}$$\text{SLR}$$\text{LLR}$
2 votes
2 votes
1 answer
4
go_editor asked Mar 27, 2020
1,155 views
The action of passing the source program into the proper syntactic class is known as:Syntax analysisLexical analysisInterpretation analysisUniform symbol generation