GATE CSE 2015 Set 1 | Searching and Sorting Question 15 | Algorithms

GATE CSE 2015 Set 1

MCQ (Single Correct Answer)

-0.6

Consider a max heap, represented by the array: 40, 30, 20, 10, 15, 16, 17, 8, 4.

Array Index	1	2	3	4	5	6	7	8	9
Value	40	30	20	10	15	16	17	8	4

Now consider that a value 35 is inserted into this heap. After insertion, the new heap is

40, 30, 20, 10, 15, 16, 17, 8, 4, 35

40, 35, 20, 10, 30, 16, 17, 8, 4, 15

40, 30, 20, 10, 35, 16, 17, 8, 4, 15

40, 35, 20, 10, 15, 16, 17, 8, 4, 30

GATE CSE 2009

MCQ (Single Correct Answer)

-0.6

Consider a binary max-heap implemented using an array. What is the content of the array {25, 14, 16, 13, 10, 8, 12} after two delete operations?

{14, 13, 12, 10, 8}

{14, 12, 13, 8, 10}

{14, 13, 8, 12, 10}

{14, 13, 12, 8 10}

GATE CSE 2009

MCQ (Single Correct Answer)

-0.6

Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap?

$$\left\{25,12,16,13,10,8,14\right\}$$

$$\left\{25,14,13,16,10,8,12\right\}$$

$$\left\{25,14,16,13,10,8,12\right\}$$

$$\left\{25,14,12,13,10,8,16\right\}$$

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

We have a binary heap on n elements and wish to insert n more elements (not necessarily one after another) into this heap. The total time required for this is

$$\Theta(\log n)$$

$$\Theta(n)$$

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

$$\Theta(n^2)$$

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 File System IO and Protection Deadlocks Memory Management

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits 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

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

Algorithms

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

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability