Question
Which algorithm guarantees the shortest path in a graph
with negative weights but no negative cycles?Solution
Bellman-Ford handles negative edge weights and detects negative cycles while finding shortest paths.
Pipe A and Pipe B together can fill the tank in 25 hours. The capacity of the pipe A is 20% of the capacity of the pipe B. How much time will pipe B alo...
Pipe ‘A’ can fill a 210-litre tank in 21 hours. If pipe ‘A’ is 25% more efficient than pipe ‘C’ whereas pipe ‘B’ is 50% more efficient t...
Tap A can fill a tank in 15 hours. Tap B can fill 20% part of the same tank in 4 hours, whereas Tap C can alone empty a tank in ‘x’ hours. 2/5 part ...
Pipe A can fill a tank in 10 hours, while Pipe B can fill it in 15 hours. Pipe C can empty the tank in 12 hours. If all three pipes are opened together,...
Tap A is 100% more efficient than tap B. Both the taps together can fill the tank in 10 hours. Find the time taken by tap C, which is 25% more efficient...
The efficiency of inlet pipe 'P' is 60% of the efficiency of another inlet pipe 'Q'. When both pipes are opened together, they fill a tank in 4 hours. H...
Pipe A and Pipe B could fill a tank together in 40 hours and 16 hours respectively, while pipe C could empty it in 20 hours. If both inlet pipes are ope...
Tap A and tap B can fill a tank in 20 hours and 25 hours respectively. If both the taps are opened together,then find the time after which tap B must be...
Pipe ‘A’ and pipe ‘B’, together can fill 20% of a tank in 7 hours while pipe ‘C’ takes 40 hours to empty it. ...
Pipe ‘X’ alone can fill a tank in 20 hours. When both pipes ‘X’ and ‘Y’ are opened together, they can fill 75% of the tank in 9 hours. How m...
