1
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
Consider the following class definitions in a hypothetical Object Oriented
language that supports inheritance and uses dynamic binding. The language
should not be assumed to be either Java or C++, though the syntax is similar.
Px = new Q();
Qy = new Q();
Pz = new Q();
x.f(1); ((P)y).f(1); z.f(1);
Here ((P)y) denotes a typecast of y to P. The output produced by executing the above program fragment will be
Class P {
void f(int i) {
print(i);
}
}
Class Q subclass of P {
void f(int i) {
print(2*i);
}
}
Now consider the following program fragment:
Px = new Q();
Qy = new Q();
Pz = new Q();
x.f(1); ((P)y).f(1); z.f(1);
Here ((P)y) denotes a typecast of y to P. The output produced by executing the above program fragment will be
2
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
The following program fragment is written in a programming language that allows global
variables and does not allow nested declarations of functions.
global int i = 100, j = 5;
void P(x) {
int i = 10;
print(x + 10);
i = 200;
j = 20;
print (x);
}
main() {
P(i + j);
}
If the programming language uses dynamic scoping and call by name parameter
passing mechanism, the values printed by the above program are3
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
Consider the following C function.
float f,(float x, int y) {
float p, s; int i;
for (s=1,p=1,i=1; i < y; i++) {
p *= x/i;
s+=p;
}
return s;
}
For large values of y, the return value of the function f best approximates4
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
A single tape Turing Machine $$M$$ has two states $${q_0}$$ and $${q_1}$$, of which $${q_0}$$ is the starting state. The tape alphabet of $$M$$ is $$\left\{ {0,\,\,1,\,\,B} \right\}$$ and its input alphabet is $$\left\{ {0,\,\,1} \right\}$$. The symbol $$B$$ is the blank symbol used to indicate end of an input string. The transition function of $$M$$ is described in the following table.
The table is interpreted as illustrated below. The entry $$\left( {{q_1},1,\,R} \right)$$ in row $${{q_0}}$$ and column $$1$$ signifies that if $$M$$ is in state $${{q_0}}$$ and reads $$1$$ on the current tape square, then it writes $$1$$ on the same tape square, moves its tape head one position to the right and transitions to state $${{q_1}}$$.
Which of the following statements is true about $$M?$$
Paper Analysis
Total Questions
Algorithms 9
Compiler Design 9
Computer Networks 5
Computer Organization 2
Data Structures 4
Database Management System 5
Digital Logic 5
Discrete Mathematics 11
Operating Systems 8
Programming Languages 7
Theory of Computation 8
More Papers of GATE CSE
GATE CSE 2026 Set 2 GATE CSE 2026 Set 1 GATE CSE 2025 Set 2 GATE CSE 2025 Set 1 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 1 GATE CSE 2014 Set 2 GATE CSE 2014 Set 3 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
All year-wise previous year question 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