search
Log In
0 votes
100 views

 

a , c , d all three are right answer please explain if i am wrong.

in Algorithms
edited by
100 views

Please log in or register to answer this question.

Related questions

0 votes
1 answer
1
0 votes
0 answers
2
205 views
Consider the following statements: $A.$ In a weighted undirected graph $G = (V, E, w)$, breadth-first search from a vertex s finds single-source shortest paths from s (via parent pointers) in $O(V + E)$ time. $B.$ ... $v$ happens), then the breadth-first search order of vertices is a valid order in which to tackle the tasks. Which of the above is TRUE?
asked Jun 19, 2018 in Algorithms Sandy Sharma 205 views
2 votes
2 answers
3
458 views
(1). Both BFS and DFS require $\Omega (N)$ storage for their operation. (2). If we double the weight of every edge in the Graph shortest path between any two vertices will not change. Which of the following is/are True ? (and in every question of shortest path we have to think about negative weight ?)
asked Nov 7, 2017 in Algorithms Mr_22B 458 views
2 votes
0 answers
4
447 views
The optimal time required in merging the list of size 11, 21, 33, 34,45,54,60 is my answer (11+21)*4+ 33*3 +(34+45)*3 + (54+60)*2 but the provided answer is 269 to 282 I don't think I have solved it wrong but just want to confirm is there any other way to do this?
asked Jan 22, 2017 in Algorithms Pankaj Joshi 447 views
...