Prepare
Practice
Interview
Aptitude
Reasoning
English
GD
Placement papers
HR
Current affairs
Engineering
MCA
MBA
Online test
Login
Timing complexity of Prims Algorithm - Data Structure
Home
>>
Category
>>
Programming Language (MCQ) questions
>>
Data Structure
Q. What is the timing complexity of Prim's Algorithm for a graph comprising ' n ' vertices?
- Published on 27 Aug 15
a.
O(n)
b.
O(n
2
)
c.
O(n
3
)
d.
O(n-1)
2
ANSWER: O(n
2
)
Related Content
Networking (
207
)
Database (
97
)
C programming (
58
)
Software Engineering (
28
)
SQL (
5
)
HTML (
74
)
Web Technologies (
11
)
Data Structure (
140
)
Operating System (
96
)
Java (
25
)
Oracle (
5
)
C++ (
50
)
Algorithms (
7
)
PL/SQL (
13
)
JavaScript (
7
)
XML (
0
)
CSS (
1
)
➨
Post your comment / Share knowledge
Required!
Required!
Invalid Email Id!
Required!
Enter the code shown above:
Please enter the code shown above
(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
MCQs
English
Tutorials
Download
▲
