1
Numerical

GATE CSE 2016 Set 2

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 ________

Answer

Correct Answer is 8
2
Numerical

GATE CSE 2016 Set 2

The given diagram shows the flowchart for a recursive function $$A(n).$$ Assume that all statements, except for the recursive calls, have $$O(1)$$ time complexity. If the worst case time complexity of this function is $$O\left( {{n^\alpha }} \right),$$ then the least possible value (accurate up to two decimal positions) of $$\alpha $$ is ____________ .
Your Input ________

Answer

Correct answer is between 2.2 and 2.4
3
Numerical

GATE CSE 2016 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,$$ 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 ________

Answer

Correct Answer is 1500
4
MCQ (Single Correct Answer)

GATE CSE 2016 Set 2

Match the following:

GROUP - 1 GROUP - 2
(P) Lexical analysis (i) Leftmost derivation
(Q) Top down parsing (ii) Type checking
(R) Semantic analysis (iii) Regular expressions
(S) Runtime environments (iv) Activation records

A
$$P \leftrightarrow i,\,\,Q \leftrightarrow ii,\,\,R \leftrightarrow iv,\,\,S \leftrightarrow iii$$
B
$$P \leftrightarrow iii,\,\,Q \leftrightarrow i,\,\,R \leftrightarrow ii,\,\,S \leftrightarrow iv$$
C
$$P \leftrightarrow ii,\,\,Q \leftrightarrow iii,\,\,R \leftrightarrow i,\,\,S \leftrightarrow iv$$
D
$$P \leftrightarrow iv,\,\,Q \leftrightarrow i,\,\,R \leftrightarrow ii,\,\,S \leftrightarrow iii$$

Paper Analysis of GATE CSE 2016 Set 2

Subject NameTotal Questions
Algorithms5
Compiler Design3
Computer Networks6
Computer Organization6
Data Structures5
Database Management System4
Digital Logic3
Discrete Mathematics11
Operating Systems3
Theory of Computation6
General Aptitude10

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