Register

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 6

• edited by
730 views

2 Answers

3 votes
3 votes
option D is correct.

Queue is used in Breadth First Search

Stack is used in Depth First Search.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4.1k
views
2 answers
1 votes
admin asked Apr 1, 2020
4,050 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 12
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?$O(n),O(n)$O(n),O(1)$O(1),O(n)$O(1),O(1)$
User Avatar
1.1k
views
1 answers
2 votes
admin asked Apr 1, 2020
1,092 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 2
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$2^{h-1} – 1$2^{h+1} – 1$2^{h+1}$
User Avatar
1.1k
views
2 answers
2 votes
admin asked Apr 1, 2020
1,092 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 20
The number of possible binary trees with $4$ nodes is$12$13$14$15$
User Avatar
436
views
0 answers
0 votes
admin asked Aug 28, 2020
436 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section D: 6
A solution for the differential equation $x’(t) + 2x(t) = \delta(t)$ with initial condition $x(\overline{0}) = 0$e^{-2t}u(t)$e^{2t}u(t)$e^{-t}u(t)$e^{t}u(t)$
User Avatar
Link Copied!