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
IITD EET
Churchill Khangar
asked
in
Algorithms
Nov 22, 2018
retagged
Jun 11, 2022
by
makhdoom ghaya
316
views
0
votes
0
votes
graph-algorithm
p-np-npc-nph
Churchill Khangar
asked
in
Algorithms
Nov 22, 2018
retagged
Jun 11, 2022
by
makhdoom ghaya
by
Churchill Khangar
316
views
answer
comment
Follow
share this
share
3 Comments
by
kumar.dilip
commented
Nov 22, 2018
reply
Follow
share this
C ???
0
0
by
Utkarsh Joshi
commented
Nov 22, 2018
reply
Follow
share this
whats the given answer?? C?
0
0
by
Churchill Khangar
commented
Nov 23, 2018
reply
Follow
share this
I don't know exact answer, please elaborate your guess
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Churchill Khangar
asked
in
Algorithms
Nov 23, 2018
155
views
EET IITD
Churchill Khangar
asked
in
Algorithms
Nov 23, 2018
by
Churchill Khangar
155
views
time-complexity
0
votes
0
votes
0
answers
2
Churchill Khangar
asked
in
Algorithms
Nov 22, 2018
241
views
IITD EET
Churchill Khangar
asked
in
Algorithms
Nov 22, 2018
by
Churchill Khangar
241
views
time-complexity
algorithms
1
vote
1
vote
1
answer
3
Churchill Khangar
asked
in
Graph Theory
Nov 23, 2018
611
views
EET IITD
Churchill Khangar
asked
in
Graph Theory
Nov 23, 2018
by
Churchill Khangar
611
views
graph-theory
graph-connectivity
vertex-cover
1
vote
1
vote
1
answer
4
Mahima Manik
asked
in
Interview Questions
May 16, 2017
823
views
IITD EET Interview
Question was about Single Source shortest path - We know that Dijkstra may/ may not handle negative edge weights in graph but Bellman Ford can. Also, the time complexity of bellman ford is higher than that of Dijkstra's. Now what if we add a large positive integer to all the weights of the graph, and then simply apply Dijkstra? What is the need of Bellman Ford then?
Mahima Manik
asked
in
Interview Questions
May 16, 2017
by
Mahima Manik
823
views
iit-interviews
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)
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:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
