GATE CSE 1987 | Divide and Conquer Method Question 39 | Algorithms

Algorithms

Complexity Analysis and Asymptotic Notations

Marks 1 Marks 2

Searching and Sorting

Marks 1 Marks 2

Divide and Conquer Method

Greedy Method

P and NP Concepts

Dynamic Programming

GATE CSE 1987

MCQ (Single Correct Answer)

-0.6

Let P be a quicksort program to sort numbers in ascending order. Let t₁ and t₂ be the time taken by the program for the inputs [1 2 3 4] and [5 4 3 2 1], respectively. Which of the following holds?

t₁ = t₂

t₁ > t₂

t₁ < t₂

t₁= t₂ + 5 log 5

Questions Asked from Marks 2

GATE CSE 2019 (1) GATE CSE 2018 (1) GATE CSE 2014 Set 1 (2) GATE CSE 2013 (2) GATE CSE 2012 (1) GATE CSE 2009 (2) GATE CSE 2008 (1) GATE CSE 2007 (1) GATE CSE 2006 (2) GATE CSE 2005 (1) GATE CSE 1997 (1) GATE CSE 1996 (2) GATE CSE 1994 (1) GATE CSE 1992 (1) GATE CSE 1987 (2)

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Digital Logic

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages

Computer Organization