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
Electric Circuits
Electromagnetic Fields
Signals and Systems
Electrical Machines
Engineering Mathematics
General Aptitude
Power System Analysis
Electrical and Electronics Measurement
Analog Electronics
Control Systems
Power Electronics
Digital Electronics
GATE ME
Engineering Mechanics
Machine Design
Strength of Materials
Heat Transfer
Production Engineering
Industrial Engineering
Turbo Machinery
Theory of Machines
Engineering Mathematics
Fluid Mechanics
Thermodynamics
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
Engineering Mechanics
Strength of Materials
Theory of Machines
Engineering Mathematics
Machine Design
Fluid Mechanics
Heat Transfer
Thermodynamics
Casting
Joining of Materials
Metal Forming
Machine Tools and Machining
Metrology
Industrial Engineering
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
Dynamic Programming
Algorithms
Previous Years Questions
START HERE
Marks 1
More
Let G(V, E) be a directed graph, where V = {1, 2, 3, 4, 5} is the set of vertices and E is the set of directed edges, as...
GATE CSE 2022
GO TO QUESTION
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on
GATE CSE 2016 Set 2
GO TO QUESTION
Match the following: List 1 (P) Prim’s algorithm for minimum spanning tree (Q) Floyd-Warshall algorithm for all pairs sh...
GATE CSE 2015 Set 1
GO TO QUESTION
An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array A[0:n−1] is give...
GATE CSE 2011
GO TO QUESTION
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order o...
GATE CSE 2004
GO TO QUESTION
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?
GATE CSE 1998
GO TO QUESTION
Marks 2
More
Let G = (V, E) be an undirected unweighted connected graph. The diameter of G is defined as: diam(G) = $$\displays...
GATE CSE 2021 Set 1
GO TO QUESTION
Consider the following undirected graph with edge weights as shown: The number of minimum-weight spanning trees of t...
GATE CSE 2021 Set 1
GO TO QUESTION
Assume that multiplying a matrix $${G_1}$$ of dimension $$p \times q$$ with another matrix $${G_2}$$ of dimension $$q \t...
GATE CSE 2018
GO TO QUESTION
Let $${A_1},{A_2},{A_3},$$ and $${A_4}$$ be four matrices of dimensions $$10 \times 5,\,\,5 \times 20,\,\,20 \times 10,$...
GATE CSE 2016 Set 2
GO TO QUESTION
Given below are some algorithms, and some algorithm design paradigms. .tg {border-collapse:collapse;border-spacing:0;b...
GATE CSE 2015 Set 2
GO TO QUESTION
Consider two strings A = “qpqrr” and B = “pqprqrp”. Let x be the length of the longest common subsequence (not necessari...
GATE CSE 2014 Set 2
GO TO QUESTION
Four matrices M1, M2, M3 and M4 of dimensions p $$\times$$ q, q $$\times$$ r, r $$\times$$ s and s $$\times$$ t respecti...
GATE CSE 2011
GO TO QUESTION
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are...
GATE CSE 2009
GO TO QUESTION
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are...
GATE CSE 2009
GO TO QUESTION
Consider the following C program that attempts to locate an element x in an array Y[] using binary search. The program i...
GATE CSE 2008
GO TO QUESTION
Consider the following C program that attempts to locate an element x in an array Y[] using binary search. The program i...
GATE CSE 2008
GO TO QUESTION
The subset-sum problem is defined as follows. Given a set of n positive integers, S = {a1 ,a2 ,a3 ,…,an} and positive in...
GATE CSE 2008
GO TO QUESTION
The subset-sum problem is defined as follows. Given a set of n positive integers, S = {a1 ,a2 ,a3 ,…,an} and positive in...
GATE CSE 2008
GO TO QUESTION
A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60,...
GATE CSE 1996
GO TO QUESTION
Obtain the optimal binary search tree with equal probabilities for the identifier set (a1, a2, a3) = ( if, stop, while)...
GATE CSE 1991
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