1
GATE CSE 2013
MCQ (Single Correct Answer)
+2
-0.6
The line graph $$L(G)$$ of a simple graph $$G$$ is defined as follows:
$$\,\,\,\,$$There is exactly one vertex $$v(e)$$ in $$L$$(G)$$ for each edge $$e$$ in $$G$$
$$\,\,\,\,$$ For any two edges $$e$$ and $$e'$$ in $$G$$, $$L(G)$$ has an edge between $$v(e)$$ and $$v(e')$$, if and only if $$e$$ and $$e'$$
$$\,\,\,\,$$ Which of the following statements is/are TRUE?
(P) The line graph of a cycle is a cycle.
(Q) The line graph of a clique is a clique.
(R) The line graph of a planar graph is planar.
(S) The line graph of a tree is a tree.
2
GATE CSE 2013
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following functions is continuous at $$x=3?$$
3
GATE CSE 2013
MCQ (Single Correct Answer)
+1
-0.3
Suppose p is the number of cars per minute passing through a certain road junction between 5PM and 6PM and p has a poisson distribution with mean 3. What is the probability of observing fewer than 3 cars during any given minute in this interval?
4
GATE CSE 2013
MCQ (Single Correct Answer)
+2
-0.6
A certain computation generates two arrays a and b such that a[i]=f(i)for 0 ≤ i < n and b[i] = g (a[i] )for 0 ≤ i < n. Suppose this computation is decomposed into two concurrent processes X and Y such that X computes the array a and Y computes the array b. The processes employ two binary semaphores R and S, both initialized to zero. The array a is shared by the two processes. The structures of the processes are shown below.
Process X:
private i;
for(i = 0; i < n; i++){
a [i] = f (i);
Exit X (R, S);
}
Process Y:
private i;
for(i = 0; i < n; i++){
Entry Y (R, S);
b [i] = g (a [i] );
}
Which of the following represents the correct implementations of Exit X and Entry Y?
Paper Analysis
Total Questions
Algorithms 7
Compiler Design 2
Computer Networks 5
Computer Organization 5
Data Structures 1
Database Management System 4
Digital Logic 3
Discrete Mathematics 11
Operating Systems 4
Programming Languages 1
Software Engineering 3
Theory of Computation 5
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 1 GATE CSE 2016 Set 2 GATE CSE 2015 Set 1 GATE CSE 2015 Set 3 GATE CSE 2015 Set 2 GATE CSE 2014 Set 2 GATE CSE 2014 Set 1 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