GATE CSE 2007 | Searching and Sorting Question 26 | Algorithms

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 40 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 2006

MCQ (Single Correct Answer)

-0.3

An element in an array X is called a leader if it is greater than all elements to the right of it in X. The best algorithm to find all leaders in an array

Solves it in linear time using a left to right pass of the array

Solves it in linear time using a right to left pass of the array

Solves it using divide and conquer in time $$\theta \left( {n\log n} \right)$$

Solves it in time $$\theta \left( {{n^2}} \right)$$

GATE CSE 2006

MCQ (Single Correct Answer)

-0.3

Which one of the following in place sorting algorithms needs the minimum number of swaps?

Quick sort

Insertion sort

Selection sort

Heap sort

GATE CSE 2006

MCQ (Single Correct Answer)

-0.3

In a binary max heap containing n numbers, the smallest element can be found in time

$$O(n)$$

$$O(\log n)$$

$$O(\log \log n)$$

$$O(1)$$

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

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

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

K Maps Boolean Algebra Combinational Circuits Number Systems 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 Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Logical Reasoning Numerical Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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