Question
Worst case is the worst case time complexity of Prim’s
algorithm if adjacency matrix is used?Solution
The correct answer is C
More Algorithms Questions
- Ritesh got 84 marks in an exam, which is 100% more than the marks secured by Mohan. If Mohan failed the exam by 4 marks, then find the total marks of Rites...
- A 220 metres long train, travelling at 60 km/h crosses a platform in 30 seconds. What is the length of the platform?
- 10 dogs can finish 20 trays of food in 25 hours. How long will it take 5 dogs to consume 16 trays of food?
- The cost price of a product is Rs. 400. The shopkeeper marks it 25% above the cost price and then offers a discount of 10%. Calculate the overall gain or l...
- Three figures are given such that the first is 45% less than the third, and the second is 50% less than the third. The first figure is what percent of the ...
- Four lights blink at intervals of 18 seconds, 24 seconds, 36 seconds, and 48 seconds respectively. How many times will all the lights blink together in 3 h...
- In a tank, the ratio of petrol to kerosene is 7:5. 50% of this mixture is removed and replaced with kerosene. Again, 50% is replaced with petrol. Find the ...
- The current average age of Ayan, Rohit and Mohan is 27 years, whereas the average age of Rohit and Mohan is 30 years. If Ayan is 5 years younger than Mohan...
- A total of Rs. 17400 is shared between 'X' and 'Y' in the ratio 11:7. If 'Y' invests his portion in a compound interest scheme at a rate of 10% per annum, ...
