Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by kiv
0
votes
1
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
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 wei...
1.2k
views
answered
Feb 11, 2022
Algorithms
nptel-quiz
dijkstras-algorithm
shortest-path
graph-theory
+
–
1
votes
2
Applied Test Series
Consider an indexed file allocation using index nodes (inodes). An inode contains among other things, 7 indexes, one indirect index, one double index, and one triple index. If the disk sector is 512 bytes, which is the closest option for maximum file size in this allocation scheme?
Consider an indexed file allocation using index nodes (inodes). An inode contains among other things, 7 indexes, one indirect index, one double index, and one triple inde...
428
views
answered
Feb 11, 2022
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register