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

Environmental Engineering

Geomatics Engineering Or Surveying

Transportation Engineering

Engineering Mathematics

General Aptitude

1

Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are **TRUE**?

$$\,\,\,\,\,\,\,{\rm I}.\,\,\,\,\,\,\,$$ Quicksort runs in $$\Theta \left( {{n^2}} \right)$$ time

$$\,\,\,\,\,{\rm I}{\rm I}.\,\,\,\,\,\,\,$$ Bubblesort runs in $$\Theta \left( {{n^2}} \right)$$ time

$$\,\,\,{\rm I}{\rm I}{\rm I}.\,\,\,\,\,\,\,$$ Mergesort runs in $$\Theta \left( n \right)$$ time

$$\,\,\,{\rm I}V.\,\,\,\,\,\,\,$$ Insertion sort runs in $$\Theta \left( n \right)$$ time

A

$${\rm I}$$ and $${\rm II}$$ only

B

$${\rm I}$$ and $${\rm III}$$ only

C

$${\rm II}$$ and $${\rm IV}$$ only

D

$${\rm I}$$ and $${\rm IV}$$ only

2

The Floyd-Warshall algorithm for all-pair shortest paths computation is based on

A

Greedy paradigm.

B

Divide-and-Conquer paradigm.

C

Dynamic Programming paradigm.

D

neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.

3

A complete binary min-heap is made by including each integer in $$[1,1023]$$ exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth $$0.$$ The maximum depth at which integer $$9$$ can appear is ___________.

Your Input ________

Correct Answer is **8**

4

Let $${A_1},{A_2},{A_3},$$ and $${A_4}$$ be four matrices of dimensions $$10 \times 5,\,\,5 \times 20,\,\,20 \times 10,$$ and $$10 \times 5,\,$$ respectively. The minimum number of scalar multiplications required to find the product $${A_1}{A_2}{A_3}{A_4}$$ using the basic matrix multiplication method is ______________.

Your Input ________

Correct Answer is **1500**

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

Algorithms | 5 |

Compiler Design | 3 |

Computer Networks | 6 |

Computer Organization | 6 |

Data Structures | 5 |

Database Management System | 4 |

Digital Logic | 3 |

Discrete Mathematics | 11 |

Operating Systems | 3 |

Theory of Computation | 6 |

General Aptitude | 10 |

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