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
Recent questions tagged shortest-path
0
votes
1
answer
1
Testbook CN question
Which of the following statement is/are incorrect about the Routing Information Protocol (RIP) protocol and Open Shortest Path First (OSPF) protocol? RIP packets are sent using TCP. OSPF packets are sent using TCP. RIP is an Network Layer protocol OSPF is an Application Layer protocol
Sahil_Lather
asked
in
Computer Networks
Jan 27
by
Sahil_Lather
109
views
computer-networks
network-layer
application-layer
shortest-path
1
vote
1
answer
2
Dijkstra's algorithm | Negative Weight Cycle
If a -ve weight cycle is reachable from source, the Dijkstra's algorithm gets into an infinite loop TRUE FALSE
Souvik33
asked
in
Algorithms
Dec 19, 2022
by
Souvik33
335
views
dijkstras-algorithm
graph-algorithms
shortest-path
1
vote
0
answers
3
TIFR CSE 2022 | Part B | Question: 13
Consider a directed graph $G=(V, E)$, where each edge $e \in E$ has a positive edge weight $c_e$. Determine the appropriate choices for the blanks below so that the value of the following linear program is the length of the shortest directed path in $G$ from $s$ ... $\text{blank }1: \min, \text{blank }2:\; \geq$ $\text{blank }1: \min, \text{blank }2:\; =$
admin
asked
in
Algorithms
Sep 1, 2022
by
admin
104
views
tifr2022
algorithms
shortest-path
0
votes
2
answers
4
Made Easy Test Series
Which of the following can be the best algorithm(s) for all pair of the shortest path problem? I. ‘V’ invocations of Dijkstra algorithm ⇒ Ο(VE logV). II. ‘V’ invocations of Bellman-Ford algorithm ⇒ Ο(V2 E). III. ‘1’ invocations of Floyd-Warshall algorithm ⇒ Ο(V3).
LRU
asked
in
Algorithms
Jan 8, 2022
by
LRU
240
views
made-easy-test-series
shortest-path
time-complexity
0
votes
1
answer
5
Nptel Assignment Question
Consider the following strategy to convert a graph with negative edge weights to one that does not have negative edge weights. Let the maximum magnitude negative edge weight in the graph be -k. Then, for each edge in the graph with weight w, ... all graphs. The claim is true for connected acyclic graphs. The claim is not true in general for connected graphs with cycles
rsansiya111
asked
in
Algorithms
Dec 8, 2021
by
rsansiya111
399
views
nptel-quiz
dijkstras-algorithm
shortest-path
graph-theory
0
votes
1
answer
6
NPTEL Assignment Question
Consider the following strategy to solve the single source shortest path problem with edge weights from source s. 1. Replace each edge with weight w by w edges of weight 1 connected by new intermediate nodes 2. Run BFS(s) on the modified graph to ... 's algorithm.s st This strategy will not solve the problem correctly. This strategy will only work if the graph is acyclic.
rsansiya111
asked
in
Algorithms
Dec 8, 2021
by
rsansiya111
438
views
nptel-quiz
shortest-path
graph-search
graph-algorithms
0
votes
1
answer
7
NPTEL Assignment Question
Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change P only Q only Neither P nor Q Both P and Q
rsansiya111
asked
in
Algorithms
Dec 7, 2021
by
rsansiya111
325
views
nptel-quiz
graph-algorithms
minimum-spanning-tree
shortest-path
0
votes
1
answer
8
NPTEL Assignment Question
rsansiya111
asked
in
Algorithms
Dec 7, 2021
by
rsansiya111
199
views
nptel-quiz
shortest-path
graph-algorithms
Page:
1
2
3
4
next »
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
Central Pollution Control Board CPCB Various Post Recruitment 2023
MP Rajya Sahkari Apex Bank Various Post Recruitment 2023
NITIE MUMBAI throgh GATE
PGCIL recruitment 2023 – Apply Online For 138 Posts through GATE
Admission guidance for GATE CSE 2023
Subjects
All categories
General Aptitude
(2.6k)
Engineering Mathematics
(9.4k)
Digital Logic
(3.3k)
Programming and DS
(5.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.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(655)
Exam Queries
(848)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(866)
Recent questions tagged shortest-path
Recent Blog Comments
Please upload updated previous year question...
The last hardcopy that was made was for GATE 2022...
overall only 3 post .no post for gen male
for gen GS in the range of 720-750 approx.
can we get 2023 hark copy from amazon?