GATE CSE 2006 | Searching and Sorting Question 33 | Algorithms

PREVIOUS NEXT

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)$$

GATE CSE 2004

MCQ (Single Correct Answer)

-0.3

The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of

$$n$$

$${n^2}$$

$$n\log n$$

$$n{\log ^2}n$$

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

In a heap with n elements with the smallest element at the root, the 7^th smallest element can be found in time

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

$$\Theta (n)$$

$$\Theta(\log n)$$

$$\Theta(1)$$

PREVIOUS NEXT

GATE CSE Subjects

Browse all chapters by subject

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

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

Digital Logic

Sequential Circuits Boolean Algebra K Maps Combinational Circuits Number Systems

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 Pointer and Structure in C Function and Recursion

Computer Organization

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