Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 6
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
edited
Sep 30, 2020
by
soujanyareddy13
495
views
0
votes
0
votes
Which of the following is useful in traversing a given graph by breadth first search?
Stack
Set
List
Queue
nielit2017oct-assistanta-it
data-structures
queue
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
edited
Sep 30, 2020
by
soujanyareddy13
by
Lakshman Patel RJIT
495
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
2
votes
2
votes
option D is correct.
Queue is used in Breadth First Search
Stack is used in Depth First Search.
Vipin Tiwari
answered
Apr 2, 2020
by
Vipin Tiwari
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
0
votes
0
votes
Answer is D
QUEUE is for BFS
STACK is for DFS
Amey Nikam
answered
Apr 20, 2020
by
Amey Nikam
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
Answer:
D
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
2
answers
1
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
1,924
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)$
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
by
Lakshman Patel RJIT
1.9k
views
nielit2017oct-assistanta-it
data-structures
queue
1
vote
1
vote
1
answer
2
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
802
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}$
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
by
Lakshman Patel RJIT
802
views
nielit2017oct-assistanta-it
data-structures
binary-tree
1
vote
1
vote
2
answers
3
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
565
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$
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
by
Lakshman Patel RJIT
565
views
nielit2017oct-assistanta-it
data-structures
binary-tree
0
votes
0
votes
0
answers
4
Lakshman Patel RJIT
asked
in
Calculus
Aug 28, 2020
251
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)$
Lakshman Patel RJIT
asked
in
Calculus
Aug 28, 2020
by
Lakshman Patel RJIT
251
views
nielit2017oct-assistanta-it
differential-equation
non-gate
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Programming
(3.9k)
DS
(1.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Can Someone guide me how to prepare for interview...
It's not a standard resource, don't follow them.
https://byjus.com/maths/diagonalization/
@amit166 can you share the reference of the...
Twist at every point Man
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
