## Marks 1

More
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?
GATE CSE 1998
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
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
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
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on
GATE CSE 2016 Set 2

## Marks 2

More
Obtain the optimal binary search tree with equal probabilities for the identifier set (a1, a2, a3) = ( if, stop, while)...
GATE CSE 1991
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
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
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
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
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
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
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
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
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
Given below are some algorithms, and some algorithm design paradigms. .tg {border-collapse:collapse;border-spacing:0;b...
GATE CSE 2015 Set 2
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 Assume that multiplying a matrix$${G_1}$$of dimension$$p \times q$$with another matrix$${G_2}$$of dimension$$q \t...
GATE CSE 2018