📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

Home
Questions
Information Technology Professional Knowledge
Algorithms
Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?

Question

Worst case is the worst case time complexity of Prim’s

algorithm if adjacency matrix is used?

A O(logV) Correct Answer Incorrect Answer

B O(logV*2) Correct Answer Incorrect Answer

C O(logV*V) Correct Answer Incorrect Answer

D V*E Correct Answer Incorrect Answer

E None Correct Answer Incorrect Answer

Solution

The correct answer is C

Practice Next

More Algorithms Questions

प्रश्नवाचक तथा विस्मयादिबोधक को छोड़कर सभी वाक्यों के अंत...
विस्मयादिबोधक चिह्न का प्रयोग कहाँ किया जाता है?
'वह कवि जो तत्काल कविता करे' के लिए एक शब्द है-
छुरी का तत्सम शब्द है-
' सन्तोष ' शब्द में कौन-सा उपसर्ग है ?
कोई कार्मिक राजस्थान के जयपुर स्थित केंद्र सरकार के किसी �...
दिए गए मुहावरे और कहावतों के अर्थ के लिए चार विकल्प दिए गए �...
कौन सा समास बहुव्रीहि समास में आता है -
निम्नलिखित रचनाओं को उनके लेखकों के साथ सुमेलित कीजिए तथ�...
पुष्प कौन-सा शब्द है ?

ask-question

Thank You for posting your query. Please check your email for further guidance

Please Register/Login to Download Question

Login Register

+919205524028 Available Mon-Sat (10 AM to 7 PM)

[email protected]

© ATOZLEARN EDUTECH PRIVATE LIMITED All rights reserved.

Privacy & Policy

Please Enter Details

call-back

Please Enter Name We'll never share your email with anyone else.

Please enter Correct Mobile Number We'll never share your email with anyone else.

Great! Our Exam Experts will contact you soon

Sign up now

Let ixamBee guide you through every stage of your exam preparation!

Continue With Google

OR

Complete Profile

Please provide your details to continue.

Select Account

Your account has multiple linked identities. Please select one to keep; the rest will be removed.

Verify OTP

Enter the code sent to your mobile/email

Verify OTP

Enter the code sent to your mobile/email