1
MCQ (Single Correct Answer)

GATE CSE 2015 Set 2

Given below are some algorithms, and some algorithm design paradigms.

GROUP 1 GROUP 2
1. Dijkstra's Shortest Path i. Divide and Conquer
2. Floyd-Warshall algorithm to compute
all pairs shortest path
ii. Dynamic Programming
3. Binary search on a sorted array iii. Greedy design
4. Backtracking search on a graph iv. Depth-first search
v. Breadth-first search

Match the above algorithms on the left to the corresponding design paradigm they follow.

A
$$1 - i,\,\,2 - iii,\,\,3 - i,\,\,4 - v.$$
B
$$1 - iii,\,\,2 - iii,\,\,3 - i,\,\,4 - v.$$
C
$$1 - iii,\,\,2 - ii,\,\,3 - i,\,\,4 - iv.$$
D
$$1 - iii,\,\,2 - ii,\,\,3 - i,\,\,4 - v.$$
2
Numerical

GATE CSE 2015 Set 2

A Young tableau is a $$2D$$ array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with $$\infty ,$$ and hence there cannot be any entry to the right of, or below a $$\infty .$$ The following Young tableau consists of unique entries.

1 2 5 14
3 4 6 23
10 12 18 25
31 ∞
∞ ∞

When an element is removed from a Young tableau, other elements should be moved into its place so that the resulting table is still a Young tableau (unfilled entries may be filled in with a $$\infty $$). The minimum number of entries (other than $$1$$) to be shifted, to remove $$1$$ from the given Young tableau is ______________.

Your Input ________

Answer

Correct Answer is 5
3
MCQ (Single Correct Answer)

GATE CSE 2015 Set 2

Suppose you are provided with the following function declaration in the C programming language.
int partition(int a[], int n);
The function treats the first element of a[ ] as a pivot and rearranges the array so that all elements less than or equal to the pivot is in the left part of the array, and all elements greater than the pivot is in the right part. In addition, it moves the pivot so that the pivot is the last element of the left part. The return value is the number of elements in the left part. The following partially given function in the C programming language is used to find the kth smallest element in an array a[ ] of size n using the partition function. We assume k≤n.
int kth_smallest (int a[], int n, int k)
{
    int left_end = partition (a, n);
    if (left_end+1==k) {
        return a[left_end];
    }
    if (left_end+1 > k) {
        return kth_smallest (___________);
    } else {
        return kth_smallest (___________);   
    }
}
The missing arguments lists are respectively
A
(a, left_end, k) and (a + left_end + 1, n - left_end - 1, k - left_end - 1)
B
(a, left_end, k) and (a, n - left_end - 1, k - left_end-1)
C
(a + left_end + 1, n - left_end - 1, k - left_end - 1) and (a, left_end, k)
D
(a, n - left_end - 1, k - left_end - 1) and (a, left_end, k)
4
MCQ (Single Correct Answer)

GATE CSE 2015 Set 2

Match the following:
GROUP 1 GROUP 2
P. Lexical analysis 1. Graph coloring
Q. Parsing 2. DFA minimization
R. Register allocation 3. Post-order traversal
S. Expression evaluation 4. Production tree
A
$$P - 2,\,\,Q - 3,\,\,R - 1,\,\,S - 4$$
B
$$P - 2,\,\,Q - 1,\,\,R - 4,\,\,S - 3$$
C
$$P - 2,\,\,Q - 4,\,\,R - 1,\,\,S - 3$$
D
$$P - 2,\,\,Q - 3,\,\,R - 4,\,\,S - 1$$

Paper Analysis of GATE CSE 2015 Set 2

Subject NameTotal Questions
Algorithms5
Compiler Design3
Computer Networks6
Computer Organization4
Data Structures3
Database Management System4
Digital Logic3
Discrete Mathematics12
Operating Systems4
Programming Languages3
Software Engineering3
Theory of Computation4
Web Technologies1

More Papers of GATE CSE

GATE CSE 2021 Set 2
keyboard_arrow_right
GATE CSE 2021 Set 1
keyboard_arrow_right
GATE CSE 2020
keyboard_arrow_right
GATE CSE 2019
keyboard_arrow_right
GATE CSE 2018
keyboard_arrow_right
GATE CSE 2017 Set 2
keyboard_arrow_right
GATE CSE 2017 Set 1
keyboard_arrow_right
GATE CSE 2016 Set 2
keyboard_arrow_right
GATE CSE 2016 Set 1
keyboard_arrow_right
GATE CSE 2015 Set 3
keyboard_arrow_right
GATE CSE 2015 Set 2
keyboard_arrow_right
GATE CSE 2015 Set 1
keyboard_arrow_right
GATE CSE 2014 Set 2
keyboard_arrow_right
GATE CSE 2014 Set 3
keyboard_arrow_right
GATE CSE 2014 Set 1
keyboard_arrow_right
GATE CSE 2013
keyboard_arrow_right
GATE CSE 2012
keyboard_arrow_right
GATE CSE 2011
keyboard_arrow_right
GATE CSE 2010
keyboard_arrow_right
GATE CSE 2009
keyboard_arrow_right
GATE CSE 2008
keyboard_arrow_right
GATE CSE 2007
keyboard_arrow_right
GATE CSE 2006
keyboard_arrow_right
GATE CSE 2005
keyboard_arrow_right
GATE CSE 2004
keyboard_arrow_right
GATE CSE 2003
keyboard_arrow_right
GATE CSE 2002
keyboard_arrow_right
GATE CSE 2001
keyboard_arrow_right
GATE CSE 2000
keyboard_arrow_right
GATE CSE 1999
keyboard_arrow_right
GATE CSE 1998
keyboard_arrow_right
GATE CSE 1997
keyboard_arrow_right
GATE CSE 1996
keyboard_arrow_right
GATE CSE 1995
keyboard_arrow_right
GATE CSE 1994
keyboard_arrow_right
GATE CSE 1993
keyboard_arrow_right
GATE CSE 1992
keyboard_arrow_right
GATE CSE 1991
keyboard_arrow_right
GATE CSE 1990
keyboard_arrow_right
GATE CSE 1989
keyboard_arrow_right
GATE CSE 1988
keyboard_arrow_right
GATE CSE 1987
keyboard_arrow_right

EXAM MAP

Joint Entrance Examination

JEE Advanced JEE Main

Graduate Aptitude Test in Engineering

GATE CSE GATE EE GATE ECE GATE ME GATE CE GATE PI GATE IN