GATE CSE 1996 | Searching and Sorting Question 46 | 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

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

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

Digital Logic

Boolean Algebra K Maps 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

Function and Recursion Basic of Programming Language 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