GATE CSE 1996 | Searching and Sorting Question 42 | Algorithms

PREVIOUS NEXT

GATE CSE 1996

MCQ (Single Correct Answer)

-0.6

The minimum number of interchanges needed to convert the array

89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70

into a heap with the maximum element at the root is

GATE CSE 1996

MCQ (Single Correct Answer)

-0.6

The average number of key comparisons done on a successful sequential search in list of length n is

log n

$${{n - 1} \over 2}$$

$${n \over 2}$$

$${{n + 1} \over 2}$$

GATE CSE 1994

MCQ (Single Correct Answer)

-0.6

Which one of the following statements is false?

Optimal binary search tree construction can be performed efficiently using dynamic programming.

Breadth-first search cannot be used to find connected components of a graph

Given the prefix and postfix walks over a binary tree, the binary tree cannot be uniquely constructed.

Depth-first search can be used to find connected components of a graph.

GATE CSE 1992

MCQ (Single Correct Answer)

-0.6

Following algorithm(s) can be used to sort n integers in the range [1....... n³] in O(n) time

Heapsort

Quicksort

Merge sort

Radix sort

PREVIOUS NEXT

GATE CSE Subjects

Discrete Mathematics

Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra 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

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

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

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

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