| CARVIEW |
Select Language
HTTP/2 200
content-type: text/html; charset=utf-8
date: Sun, 24 Aug 2025 00:29:50 GMT
permissions-policy: interest-cohort=()
strict-transport-security: max-age=31536000; includeSubDomains
server: nginx
cache-control: s-maxage=56948, max-age=0
x-powered-by: Next.js
etag: "hsrzs78b94nd4"
content-encoding: gzip
x-xss-protection: 1; mode=block
x-content-type-options: nosniff
referrer-policy: no-referrer-when-downgrade
content-security-policy: default-src 'self' http: https: ws: wss: data: blob: 'unsafe-eval' 'unsafe-inline'; frame-ancestors 'self';
vary: Accept-Encoding
x-cache: Hit from cloudfront
via: 1.1 d03e1fdb296cec133b80d2f6e5d8974a.cloudfront.net (CloudFront)
x-amz-cf-pop: BOM78-P9
x-amz-cf-id: gdCKp4c8aZko4bBQgMcLVLmeW0T8vE7t8uIUHXuF1VS7OlMmEneolw==
age: 36492
GATE | CS | 2008 | Algorithms | Miscellaneous | Question 7 
- Courses
- Tutorials
- Practice
- Jobs
Data Structure
Java
Python
HTML
Interview Preparation
Interview Preparation
- Interview Preparation For Software Developers
- Must Coding Questions - Company-wise
- Must Do Coding Questions - Topic-wise
- Company-wise Practice Problems
- Company Preparation
- Competitive Programming
- Software Design-Patterns
- Company-wise Interview Experience
- Experienced - Interview Experiences
- Internship - Interview Experiences
GATE | CS | 2008 | Algorithms | Miscellaneous | Question 7
Last Updated :
Discuss
Comments
The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity
&thetha;(n)
&thetha;(m)
&thetha;(m + n)
&thetha;(mn)
This question is part of this quiz :
GATE CS 2008,Algorithms GATE CS PYQ Quiz,Miscellaneous on Algorithms GATE CS PYQ QuizShare your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy