1
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Consider the following C function.
int fun1 (int n) {
int i, j, k, p, q = 0;
for (i = 1; i < n; ++i)
{
p = 0;
for (j = n; j > 1; j = j/2)
++p;
for (k = 1; k < p; k = k * 2)
++q;
}
return q;
}
Which one of the following most closely approximates the return value of the function fun1?2
GATE CSE 2015 Set 1
Numerical
+2
-0
The graph shown below has 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A, C), (B, C), (B, E), (E, F), (D, F)}. The edge weights of only those edges which are in the MST are given in the figure shown below. The minimum possible sum of weights of all 8 edges of this graph is ___________.
![GATE CSE 2015 Set 1 Algorithms - Greedy Method Question 11 English](https://imagex.cdn.examgoal.net/NV4jiP3pSuGJlvuS7/dhBraD7o72I5xmK8ZuQCQYCbj1zSc/OHt0JzRzLgEL2A6kFuqAvy/uploadfile.jpg)
![GATE CSE 2015 Set 1 Algorithms - Greedy Method Question 11 English](https://imagex.cdn.examgoal.net/NV4jiP3pSuGJlvuS7/dhBraD7o72I5xmK8ZuQCQYCbj1zSc/OHt0JzRzLgEL2A6kFuqAvy/uploadfile.jpg)
Your input ____
3
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is TRUE at any valid state in shift-reduce parsing?
4
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+2
-0.6
A variable x is said to be live at a statement $${S_i}$$ in a programif the following three conditions hold simultaneously:
i. There exists a statement $${S_j}$$ that uses x
ii. There is a path from $${S_i}$$ to $${S_j}$$ in the flow graph corresponding to the program
iii. The path has no intervening assignment to x including at $${S_i}$$ and $${S_j}$$
![GATE CSE 2015 Set 1 Compiler Design - Code Generation and Optimization Question 6 English](https://imagex.cdn.examgoal.net/IttYl02R9AhbgzTaf/vW1DkxLbtOYhbKMZhAJBRPeqhIImr/D1jjkZ06AZVLzMte9bIMJS/uploadfile.jpg)
The variables which are live both at the statement in basic block 2 and at the statement in basic block 3 of the above control flow graph are
Paper analysis
Total Questions
Algorithms
6
Compiler Design
3
Computer Networks
6
Computer Organization
3
Data Structures
4
Database Management System
4
Digital Logic
4
Discrete Mathematics
12
Operating Systems
6
Programming Languages
3
Software Engineering
2
Theory of Computation
3
Web Technologies
1
General Aptitude
10
More papers of GATE CSE
GATE CSE 2024 Set 2
GATE CSE 2024 Set 1
GATE CSE 2023
GATE CSE 2022
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
GATE CSE
Papers
2023
2022
2020
2019
2018
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987