GATE CSE 1996 | Divide and Conquer Method Question 32 | Algorithms

PREVIOUS NEXT

GATE CSE 1996

MCQ (Single Correct Answer)

-0.6

The recurrence relation
T(1) = 2
T(n) = 3T(n/4) + n
has the solution, T(n) equals to

O(n)

O(log n)

O(n^3/4)

None of the above

GATE CSE 1994

MCQ (Single Correct Answer)

-0.6

The recurrence relation that arises in relation with the complexity of binary search is:

$$T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$$

$$T(n) = T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$$

$$T(n) = T\left(\frac{n}{2}\right)+\log n$$

$$T(n) = T\left(\frac{n}{2}\right)+n$$

GATE CSE 1992

Subjective

-0

Assume that the last element of the set is used as partition element in Quicksort. If n distinct elements from the set [1…n] are to be sorted, give an input for which Quicksort takes maximum time.

GATE CSE 1987

Subjective

-0

Find a solution to the following recurrence equation
T(n) = T(n - 1)+ n
T(1) = 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 P and NP Concepts Dynamic Programming

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