GATE CSE 2008 | Searching and Sorting Question 19 | Algorithms

GATE CSE 2008

MCQ (Single Correct Answer)

-0.3

The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity

$$\Theta (n)$$

$$\Theta (m)$$

$$\Theta (n+m)$$

$$\Theta (mn)$$

GATE CSE 2008

MCQ (Single Correct Answer)

-0.3

The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is GATE CSE 2008 Algorithms - Searching and Sorting Question 35 English

GATE CSE 2008 Algorithms - Searching and Sorting Question 35 English

MNOPQR

NQMPOR

QMNPRO

QMNPOR

GATE CSE 2007

MCQ (Single Correct Answer)

-0.3

Consider the DAG with $$V = \{1,2,3,4,5,6\}$$, shown below. GATE CSE 2007 Algorithms - Searching and Sorting Question 38 English

Which of the following is NOT a topological ordering?

1 2 3 4 5 6

1 3 2 4 5 6

1 3 2 4 6 5

3 2 4 1 6 5

GATE CSE 2007

MCQ (Single Correct Answer)

-0.3

Which of the following sorting algorithms has the lowest worst-case complexity?

Merge sort

Bubble sort

Quick sort

Selection sort

PREVIOUS NEXT

GATE CSE Subjects

Discrete Mathematics

Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Computer Organization

Computer Arithmetic Memory Interfacing Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

Network Security Data Link Layer and Switching Application Layer Protocol Network Layer Routing Algorithm Concepts of Layering Lan Technologies and Wi-Fi TCP UDP Sockets and Congestion Control

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Numerical Ability Verbal Ability