@

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

admin asked in DS Apr 1, 2020 edited Sep 30, 2020 by soujanyareddy13

692 views

1 vote

1 vote

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

admin asked in DS Apr 1, 2020 edited Sep 30, 2020 by soujanyareddy13

by admin

692 views

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

2 Answers

3 votes

3 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

0 Comments

Please log in or register to add a comment.

1 vote

1 vote

Answer is D
QUEUE is for BFS
STACK is for DFS

Amey Nikam answered Apr 20, 2020

0 Comments

Please log in or register to add a comment.

Answer:

← Previous Next →

← Previous in category Next in category →

Related questions

1 vote

1 vote

2 answers

1

admin asked in DS Apr 1, 2020

3,653 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)$

admin asked in DS Apr 1, 2020

by admin

3.7k views

nielit2017oct-assistanta-it
data-structures
queue

2 votes

2 votes

1 answer

2

admin asked in DS Apr 1, 2020

1,039 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}$

admin asked in DS Apr 1, 2020

by admin

1.0k views

nielit2017oct-assistanta-it
data-structures
binary-tree

2 votes

2 votes

2 answers

3

admin asked in DS Apr 1, 2020

985 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$

admin asked in DS Apr 1, 2020

by admin

985 views

nielit2017oct-assistanta-it
data-structures
binary-tree

0 votes

0 votes

0 answers

4

admin asked in Calculus Aug 28, 2020

395 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)$

admin asked in Calculus Aug 28, 2020

by admin

395 views

nielit2017oct-assistanta-it
differential-equation
non-gate

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes

Subjects

All categories
General Aptitude (3.5k)
Engineering Mathematics (10.4k)
Digital Logic (3.6k)
Programming and DS (6.2k)
- Programming (4.1k)
- DS (2.0k)
Algorithms (4.8k)
Theory of Computation (6.9k)
Compiler Design (2.5k)
Operating System (5.2k)
Databases (4.8k)
CO and Architecture (4.0k)
Computer Networks (4.9k)
Artificial Intelligence (79)
Machine Learning (48)
Data Mining and Warehousing (25)
Non GATE (1.4k)
Others (2.7k)
Admissions (684)
Exam Queries (1.6k)
Tier 1 Placement Questions (17)
Job Queries (80)
Projects (11)
Unknown Category (870)

64.3k questions

77.9k answers

244k comments

80.0k users

Recent Blog Comments

category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
GATER
Refund Policy
Terms and Conditions
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!