GATE CSE 2009 | Searching and Sorting Question 18 | Algorithms

PREVIOUS NEXT

GATE CSE 2009

MCQ (Single Correct Answer)

-0.3

What is the number of swaps required to sort n elements using selection sort, in the worst case?

$$\Theta(n)$$

$$\Theta(n \log n)$$

$$\Theta(n^2)$$

$$\Theta(n^2 \log n)$$

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 36 English

GATE CSE 2008 Algorithms - Searching and Sorting Question 36 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 39 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

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

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

Operating Systems

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

Algorithms

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

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

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

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

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

Computer Organization

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