Register
Dark Mode

test series

in Algorithms
345 views
0 votes
0 votes
Which of the following statement(s) is/are correct?
P: DFS can be used for finding shortest paths in unweighted graphs and can also be used testing bipartiteness
Q: BFS can be used for topological sorting and finding strongly connected components.
in Algorithms
by
345 views

2 Comments

by
Both are false ! If you would interchange BFS and DFS from respective statements then they are correct.
0
0
by
How statement Q is incorrect ?
0
0

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

No related questions found

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!