1
GATE CSE 2012
+2
-0.6
Let $$G$$ be a complete undirected graph on $$6$$ vertices. If vertices of $$G$$ $$\,\,\,\,$$ are labeled, then the number of distinct cycles of length $$4$$ in $$G$$ is equal to
A
$$15$$
B
$$30$$
C
$$90$$
D
$$360$$
2
GATE CSE 2012
+1
-0.3
Let $$A$$ be the $$2 \times 2$$ matrix with elements $${a_{11}} = {a_{12}} = {a_{21}} = + 1$$ and $${a_{22}} = - 1$$. Then the eigen values of the matrix $${A^{19}}$$ are
A
$$1024$$ and $$-1024$$
B
$$1024\sqrt 2 \,i$$ and $$- 1024\sqrt 2$$
C
$$4\sqrt 2$$ and $$-4\sqrt 2$$
D
$$512\sqrt 2$$ and $$-512\sqrt 2$$
3
GATE CSE 2012
+1
-0.3
A process executes the code
fork $$\left( {\,\,\,} \right);$$
fork $$\left( {\,\,\,} \right);$$
fork $$\left( {\,\,\,} \right);$$
The total number of child processes created is
A
$$3$$
B
$$4$$
C
$$7$$
D
$$8$$
4
GATE CSE 2012
+2
-0.6
Consider the $$3$$ processes, $$P1,$$ $$P2$$ and $$P3$$ shown in the table.
Process Arrival Time Time Units
Required
P1 0 5
P2 1 7
P3 3 4

The completion order of the $$3$$ processes under the policies $$FCFS$$ and $$RR2$$ (round robin scheduling with $$CPU$$ quantum of $$2$$ time units) are

A
$$FCFS:P1,P2,P3\,\,\,\,RR2:P1,P2,P3$$
B
$$FCFS:P1,P3,P2\,\,\,\,RR2:P1,P3,P2$$
C
$$FCFS:P1,P2,P3\,\,\,\,RR2:P1,P3,P2$$
D
$$FCFS:P1,P3,P2\,\,\,\,RR2:P1,P2,P3$$
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