ExamSIDE
Questions
ExamSIDE.Com
Algorithms
Complexity Analysis and Asymptotic Notations
Searching and Sorting
Divide and Conquer Method
Greedy Method
Dynamic Programming
P and NP Concepts
Joint Entrance Examination
JEE Main
Chemistry
Physics
Mathematics
JEE Advanced
Physics
Chemistry
Mathematics
WB JEE
Physics
Chemistry
Mathematics
Graduate Aptitude Test in Engineering
GATE CSE
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Digital Logic
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude
GATE ECE
Network Theory
Control Systems
Electronic Devices and VLSI
Analog Circuits
Digital Circuits
Microprocessors
Signals and Systems
Communications
Electromagnetics
General Aptitude
Engineering Mathematics
GATE EE
Electromagnetic Fields
Signals and Systems
Engineering Mathematics
General Aptitude
Power Electronics
Power System Analysis
Analog Electronics
Control Systems
Digital Electronics
Electrical Machines
Electric Circuits
Electrical and Electronics Measurement
GATE ME
Engineering Mechanics
Strength of Materials
Theory of Machines
Engineering Mathematics
Machine Design
Fluid Mechanics
Turbo Machinery
Heat Transfer
Thermodynamics
Production Engineering
Industrial Engineering
General Aptitude
GATE CE
Engineering Mechanics
Strength of Materials Or Solid Mechanics
Structural Analysis
Construction Material and Management
Reinforced Cement Concrete
Steel Structures
Geotechnical Engineering
Fluid Mechanics and Hydraulic Machines
Hydrology
Irrigation
Geomatics Engineering Or Surveying
Environmental Engineering
Transportation Engineering
Engineering Mathematics
General Aptitude
GATE PI
Fluid Mechanics
Metrology
Theory of Machines
Engineering Mathematics
Heat Transfer
Machine Tools and Machining
Industrial Engineering
Engineering Mechanics
Strength of Materials
Thermodynamics
Machine Design
Casting
Joining of Materials
Metal Forming
GATE IN
Engineering Mathematics
Medical
NEET
Biology
Chemistry
Physics
NEW
New Website Launch
Experience the best way to solve previous year questions with
mock tests
(very detailed analysis),
bookmark your favourite questions
,
practice
etc...
VISIT NOW
GATE CSE
Divide and Conquer Method
Algorithms
Previous Years Questions
START HERE
Marks 1
More
Consider a sequence of 14 elements: A = [-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]. The subsequence sum $$S\le...
GATE CSE 2019
GO TO QUESTION
You have an array of n elements. Suppose you implement quicksort by always choosing the central element of the array as ...
GATE CSE 2014 Set 3
GO TO QUESTION
Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1? T(1) = 2T (n/2) +...
GATE CSE 2014 Set 2
GO TO QUESTION
Let P be a QuickSort Program to sort numbers in ascending order using the first element as pivot. Let t1 and t2 be the n...
GATE CSE 2014 Set 1
GO TO QUESTION
The minimum number of arithmetic operations required to evaluate the polynomial P(X) = X5 + 4X3 + 6X + 5 for a given val...
GATE CSE 2014 Set 3
GO TO QUESTION
Which of the following statement(s) is / are correct regarding Bellman-Ford shortest path algorithm? P: Always finds a n...
GATE CSE 2009
GO TO QUESTION
The usual $$\Theta ({n^2})$$ implementation of Insertion Sort to sort an array uses linear search to identify the positi...
GATE CSE 2003
GO TO QUESTION
The solution to the recurrence equation T(2k) = 3 T(2k-1) + 1, T (1) = 1, is:
GATE CSE 2002
GO TO QUESTION
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity ...
GATE CSE 2001
GO TO QUESTION
Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if ...
GATE CSE 2000
GO TO QUESTION
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4,...
GATE CSE 1999
GO TO QUESTION
A sorting technique is called stable if:
GATE CSE 1999
GO TO QUESTION
Merge sort uses
GATE CSE 1995
GO TO QUESTION
Which of the following statements is true? I. As the number of entries in a hash table increases, the number of collisio...
GATE CSE 1995
GO TO QUESTION
For merging two sorted lists of sizes m and n into a sorted list of size m+n, we require comparisons of
GATE CSE 1995
GO TO QUESTION
Marks 2
More
Consider the following statements: I. The smallest element in a max-heap is always at a leaf node II. The second larg...
GATE CSE 2019
GO TO QUESTION
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do...
GATE CSE 2014 Set 1
GO TO QUESTION
The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is ________
GATE CSE 2014 Set 1
GO TO QUESTION
Consider the following function: int unknown(int n) { int i, j, k = 0; for (i = n/2; i <= n; i++) fo...
GATE CSE 2013
GO TO QUESTION
Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. Mul...
GATE CSE 2013
GO TO QUESTION
A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case...
GATE CSE 2012
GO TO QUESTION
In quick sort, for sorting n elements, the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. W...
GATE CSE 2009
GO TO QUESTION
The running time of an algorithm is represented by the following recurrence relation: $$T(n) = \begin{cases} n &...
GATE CSE 2009
GO TO QUESTION
Consider the Quicksort algorithm. Suppose there is a procedure for finding a pivot element which splits the list into tw...
GATE CSE 2008
GO TO QUESTION
An array of n numbers is given, where n is an even number. The maximum as well as the minimum of these n numbers needs t...
GATE CSE 2007
GO TO QUESTION
The median of n elements can be found in O(n) time. Which one of the following is correct about the complexity of quick ...
GATE CSE 2006
GO TO QUESTION
Consider the following recurrence: $$T\left( n \right){\rm{ }} = {\rm{ 2T(}}\left\lceil {\sqrt n } \right\rceil {\rm{) +...
GATE CSE 2006
GO TO QUESTION
Suppose T(n) = 2T (n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?
GATE CSE 2005
GO TO QUESTION
Let T(n) be the function defined by $$T(1) =1, \: T(n) = 2T (\lfloor \frac{n}{2} \rfloor ) + \sqrt{n}$$ Which of the fol...
GATE CSE 1997
GO TO QUESTION
The recurrence relation T(1) = 2 T(n) = 3T(n/4) + n has the solution, T(n) equals to
GATE CSE 1996
GO TO QUESTION
Quicksort is run on two inputs shown below to sort in ascending order taking first element as pivot i) 1, 2, 3,......., ...
GATE CSE 1996
GO TO QUESTION
The recurrence relation that arises in relation with the complexity of binary search is:
GATE CSE 1994
GO TO QUESTION
Assume that the last element of the set is used as partition element in Quicksort. If n distinct elements from the set [...
GATE CSE 1992
GO TO QUESTION
Find a solution to the following recurrence equation T(n) = T(n - 1)+ n T(1) = 1
GATE CSE 1987
GO TO QUESTION
Let P be a quicksort program to sort numbers in ascending order. Let t1 and t2 be the time taken by the program for the ...
GATE CSE 1987
GO TO QUESTION
Joint Entrance Examination
JEE Main
JEE Advanced
WB JEE
Graduate Aptitude Test in Engineering
GATE CSE
GATE ECE
GATE EE
GATE ME
GATE CE
GATE PI
GATE IN
Medical
NEET
CBSE
Class 12