1
GATE CSE 2012
+1
-0.3
The recurrence relation capturing the optional execution time of the Towers of Hanoi problem with $$n$$ discs is
A
$$T\left( n \right) = 2T\left( {n - 2} \right) + 2$$
B
$$T\left( n \right) = 2T\left( {n - 1} \right) + n$$
C
$$T\left( n \right) = 2T\left( {n/2} \right) + 1$$
D
$$T\left( n \right) = 2T\left( {n - 1} \right) + 1$$
2
GATE CSE 2012
+1
-0.3
Let G be a simple undirected planner graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to
A
3
B
4
C
5
D
6
3
GATE CSE 2012
+1
-0.3
Consider the function $$f\left( x \right) = \sin \left( x \right)$$ in the interval $$x \in \left[ {\pi /4,\,\,7\pi /4} \right].$$ The number and location(s) of the local minima of this function are
A
One, at $$\pi /2$$
B
One, at $$3\pi /2$$
C
Two, at $$\pi /2$$ and $$3\pi /2$$
D
Two, at $$\pi /4$$ and $$3\pi /2$$
4
GATE CSE 2012
+2
-0.6
Which of the following graphs is isomorphic to
A
B
C
D
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
EXAM MAP
Medical
NEET