Register

NIELIT 2016 DEC Scientist B (IT) - Section B: 42

• retagged by
3,114 views

2 Answers

2 votes
2 votes
A. Depth First Search

Since DFS uses stack, it pushes all the descendent nodes of a vertex and processes it before processing any adjacent node.

That is why the name DEPTH FIRST.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
1 answer
1
admin asked Mar 31, 2020
891 views
NIELIT 2016 DEC Scientist B (IT) - Section B: 30
What data structures is used for depth first traversal of a graph? Queue Stack List None of the above
What data structures is used for depth first traversal of a graph?QueueStackListNone of the above
User Avatar
3 votes
3 votes
2 answers
2
admin asked Mar 31, 2020
2,555 views
NIELIT 2016 DEC Scientist B (IT) - Section B: 17
Which of the following is the correct order of evaluation for the below expression? $z=x+y^*z/4\%2-1$ $^*/\%+-=$ $=^*/\%+-$ $/^*\%-+=$ $^*\% /-+=$
Which of the following is the correct order of evaluation for the below expression? $z=x+y^*z/4\%2-1$$^*/\%+-=$$=^*/\%+-$$/^*\%-+=$$^*\% /-+=$
User Avatar
4 votes
4 votes
1 answer
3
admin asked Mar 31, 2020
1,854 views
NIELIT 2016 DEC Scientist B (IT) - Section B: 13
The number of unused pointers in a complete binary tree of depth $5$ is: $4$ $8$ $16$ $32$
The number of unused pointers in a complete binary tree of depth $5$ is:$4$$8$$16$$32$
User Avatar
4 votes
4 votes
4 answers
4
admin asked Mar 31, 2020
2,008 views
NIELIT 2016 DEC Scientist B (IT) - Section B: 15
A ________ is a linear list in which insertions and deletions are made to from either end of the structure. Circular queue. Priority queue. Stack. Dequeue.
A ________ is a linear list in which insertions and deletions are made to from either end of the structure.Circular queue.Priority queue.Stack.Dequeue.
User Avatar
Link Copied!