Joint Entrance Examination

Graduate Aptitude Test in Engineering

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

1

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

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 ________

Correct Answer is **5**

3

Suppose you are provided with the following function declaration in the C programming language.
^{th} smallest element in an array a[ ] of size n using the partition function. We assume k≤n.

`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 k```
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 respectivelyA

(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

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$$

Subject Name | Total Questions |
---|---|

Algorithms | 5 |

Compiler Design | 3 |

Computer Networks | 6 |

Computer Organization | 4 |

Data Structures | 3 |

Database Management System | 4 |

Digital Logic | 3 |

Discrete Mathematics | 12 |

Operating Systems | 4 |

Programming Languages | 3 |

Software Engineering | 3 |

Theory of Computation | 4 |

Web Technologies | 1 |

GATE CSE 2021 Set 2

GATE CSE 2021 Set 1

GATE CSE 2020

GATE CSE 2019

GATE CSE 2018

GATE CSE 2017 Set 2

GATE CSE 2017 Set 1

GATE CSE 2016 Set 2

GATE CSE 2016 Set 1

GATE CSE 2015 Set 3

GATE CSE 2015 Set 2

GATE CSE 2015 Set 1

GATE CSE 2014 Set 2

GATE CSE 2014 Set 3

GATE CSE 2014 Set 1

GATE CSE 2013

GATE CSE 2012

GATE CSE 2011

GATE CSE 2010

GATE CSE 2009

GATE CSE 2008

GATE CSE 2007

GATE CSE 2006

GATE CSE 2005

GATE CSE 2004

GATE CSE 2003

GATE CSE 2002

GATE CSE 2001

GATE CSE 2000

GATE CSE 1999

GATE CSE 1998

GATE CSE 1997

GATE CSE 1996

GATE CSE 1995

GATE CSE 1994

GATE CSE 1993

GATE CSE 1992

GATE CSE 1991

GATE CSE 1990

GATE CSE 1989

GATE CSE 1988

GATE CSE 1987