1
GATE CSE 2012
+2
-0.6
Suppose a fair six-sided die is rolled once. If the value on the die is 1, 2 or 3 the die is rolled a second time. What is the probability that the sum total of values that turn up is at least 6?
A
10/21
B
5/12
C
2/3
D
1/6
2
GATE CSE 2012
+2
-0.6
How many onto (or subjective) functions are there form an n-element $$(n\, \ge \,2)$$ set to a 2-element set ?
A
$${2^n}$$
B
$${2^n}\, - 1$$
C
$${2^n}\, - 2$$
D
$$2\,({2^n}\, - 2)$$
3
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$$
4
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
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