Register

UGC NET CSE | June 2016 | Part 2 | Question: 24

• recategorized by
3,728 views

2 Answers

Best answer
5 votes
5 votes

Job scheduling is commonly done via queue data structure .

  1. Implementation of recursion :since for each funtion call stack is used to store its activation record.
  2. Evaluation of  a postfix expression : perfect exampe for stack data structure application push until operator not found.
  3. Reverse a string : simpe example for reverse any string : push all then pop all.

so c is answer

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
1 answer
1
go_editor asked Aug 16, 2016
4,886 views
UGC NET CSE | June 2016 | Part 2 | Question: 22
Consider the following operations performed on a stack of size 5: Push (a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e) Which of the following statements is correct? Underflow occurs Stack operations are performed smoothly Overflow occurs None of the above
Consider the following operations performed on a stack of size 5:Push (a); Pop(); Push(b); Push(c); Pop();Push(d); Pop(); Pop(); Push(e)Which of the following statements ...
User Avatar
3 votes
3 votes
3 answers
2
go_editor asked Aug 16, 2016
14,219 views
UGC NET CSE | June 2016 | Part 2 | Question: 23
Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The maximum height of the tree will be $\frac{n}{2}-1$ $\frac{n}{2}+1$ $(n-1)/2$ $(n+1)/2$
Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The maximum height of the tree will be$\frac{n}{2}-1$$\frac{...
User Avatar
7 votes
7 votes
1 answer
3
go_editor asked Aug 14, 2016
5,345 views
UGC NET CSE | June 2016 | Part 2 | Question: 5
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below? 2 4 5 6
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below?2456...
User Avatar
3 votes
3 votes
2 answers
4
go_editor asked Aug 14, 2016
5,532 views
UGC NET CSE | June 2016 | Part 2 | Question: 2
The number of different spanning trees in complete graph, $K_4$ and bipartite graph, $K_{2,2}$ have ____ and ___ respectively. 14, 14 16, 14 16, 4 14, 4
The number of different spanning trees in complete graph, $K_4$ and bipartite graph, $K_{2,2}$ have ____ and ___ respectively.14, 1416, 1416, 414, 4
User Avatar
Link Copied!