Dark Mode

Recent questions tagged marks-to-all

55 votes

5 answers

1

GATE CSE 2012 | Question: 29
Let $G$ be a weighted graph with edge weights greater than one and $G'$ be the graph constructed by squaring the weights of edges in $G$. Let $T$ and $T'$ be the minimum spanning trees of $G$ and $G'$, respectively, with total weights $t$ and $t'$. Which of the ... $T' = T$ with total weight $t' < t^2$ $T' \neq T$ but total weight $t' = t^2$ None of the above

gatecse asked in Algorithms Sep 15, 2014

12.8k views

101 votes

8 answers

2

GATE CSE 2012 | Question: 38
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 $15$ $30$ $90$ $360$

gatecse asked in Graph Theory Sep 12, 2014

28.8k views

38 votes

2 answers

3

GATE CSE 2013 | Question: 47
Which one of the following is NOT logically equivalent to $¬∃x(∀ y (α)∧∀z(β ))$ ? $∀ x(∃ z(¬β )→∀ y(α))$ $∀x(∀ z(β )→∃ y(¬α))$ $∀x(∀ y(α)→∃z(¬β ))$ $∀x(∃ y(¬α)→∃z(¬β ))$

gatecse asked in Mathematical Logic Aug 21, 2014

9.6k views

65 votes

2 answers

4

GATE CSE 2013 | Question: 42
What is the return value of $f(p,p)$, if the value of $p$ is initialized to $5$ before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value. int f (int &x, int c) { c = c - 1; if (c==0) return 1; x = x + 1; return f(x,c) * x; }

gatecse asked in Programming Aug 7, 2014

16.6k views

To see more, click for the full list of questions or popular tags.

Recent questions tagged marks-to-all