Recent activity by Sumit1311 / GATE Overflow for GATE CSE

1 answer

1

375 views

comment edited Nov 22, 2016

3 answers

2

GATE IT 2007 | Question: 18
A firewall is to be configured to allow hosts in a private network to freely open TCP connections and send packets on open connections. However, it will only allow external hosts to send packets on existing open TCP connections or connections ... be that of A combinational circuit A finite automaton A pushdown automaton with one stack A pushdown automaton with two stacks

A firewall is to be configured to allow hosts in a private network to freely open TCP connections and send packets on open connections. However, it will only allow extern...

6.4k views

commented Nov 17, 2016

4 answers

3

GATE CSE 2016 Set 2 | Question: 41
In an adjacency list representation of an undirected simple graph $G=(V, E)$, each edge $(u, v)$ has two adjacency list entries: $[v]$ in the adjacency list of $u$, and $[u]$ in the adjacency list of $v$. These are called twins of each other. A twin pointer ... $\Theta\left(n+m\right)$ $\Theta\left(m^{2}\right)$ $\Theta\left(n^{4}\right)$

In an adjacency list representation of an undirected simple graph $G=(V, E)$, each edge $(u, v)$ has two adjacency list entries: $[v]$ in the adjacency list of $u$, and $...

19.7k views

answered Feb 28, 2016

8 answers

4

GATE CSE 2016 Set 2 | Question: 33
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac{3 \tau_2}{4}=2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency , the new frequency is __________ $\text{GHz}$, ignoring delays in the pipeline registers.

Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac...

19.2k views

answer edited Feb 23, 2016

6 answers

5

GATE CSE 2016 Set 2 | Question: 22
Suppose a database schedule $S$ involves transactions $T_1,\ldots,T_n$ . Construct the precedence graph of $S$ with vertices representing the transactions and edges representing the conflicts. If $S$ is serializable, which one of ... to yield a serial schedule? Topological order Depth-first order Breadth-first order Ascending order of the transaction indices

Suppose a database schedule $S$ involves transactions $T_1,\ldots,T_n$ . Construct the precedence graph of $S$ with vertices representing the transactions and edges repr...

13.2k views

comment edited Feb 18, 2016

1 answer

6

functions
1 int main() { int b; b = f(20,30); printf("%d",b); return 0; } int f(int a,int b){ int z; z= a + b; return z; } this program compile fine and o/p is 50 2 int main() { int b; b = f(20,'a'); printf("%d",b); return 0; } int f(int a,char b){ int z; z= a + b; return z; } this give compilation error. I don't know why??Please explain

1 int main() { int b; b = f(20,30); printf("%d",b); return 0;}int f(int a,int b){ int z; z= a + b; return z;}this program compile fine and o/p is 502 i...

577 views

commented Feb 5, 2016

2 answers

7

ISRO2015-76
Consider the following statements #define hypotenuse (a, b) sqrt (a*a+b*b); The macro call hypotenuse(a+2,b+3); Finds the hypotenuse of a triangle with sides $a+2$ and $b+3$ Finds the square root of $(a+2)^2$ and $(b+3)^2$ Is invalid Find the square root of $3 *a+4*b+5$

Consider the following statements#define hypotenuse (a, b) sqrt (a*a+b*b);The macro call hypotenuse(a+2,b+3);Finds the hypotenuse of a triangle with sides $a+2$ and $b+3$...

6.0k views

answered Feb 3, 2016

5 answers

8

GATE IT 2008 | Question: 77
A binary tree with $n > 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbours. Starting with the above tree, while there remains a node $v$ of degree two in the tree, add ... will remain at the end of the process? $2 * n_1- 3$ $n_2 + 2 * n_1 - 2$ $n_3 - n_2$ $n_2+ n_1- 2$

A binary tree with $n 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbo...

14.8k views

commented Feb 3, 2016

3 answers

9

TIFR CSE 2012 | Part B | Question: 5
Let $R$ be a binary relation over a set $S$. The binary relation $R$ is called an equivalence relation if it is reflexive transitive and symmetric. The relation is called partial order if it is reflexive, transitive and anti symmetric. ... $\sqsubseteq $ is neither a partial order nor an equivalence relation.

Let $R$ be a binary relation over a set $S$. The binary relation $R$ is called an equivalence relation if it is reflexive transitive and symmetric. The relation is called...

2.0k views

commented Feb 2, 2016

3 answers

10

GATE 2015 EC_S03 Q 4
Q.4 Find the missing sequence in the letter series below: A, CD, GHI, ?, UVWXY (A) LMN (B) MNO (C) MNOP (D) NOPQ

Q.4 Find the missing sequence in the letter series below:A, CD, GHI, ?, UVWXY(A) LMN (B) MNO (C) MNOP (D) NOPQ

1.6k views

commented Feb 2, 2016

7 answers

11

GATE CSE 2008 | Question: 38
In an instruction execution pipeline, the earliest that the data TLB (Translation Lookaside Buffer) can be accessed is: before effective address calculation has started during effective address calculation after effective address calculation has completed after data cache lookup has completed

In an instruction execution pipeline, the earliest that the data TLB (Translation Lookaside Buffer) can be accessed is:before effective address calculation has starteddur...

19.4k views

commented Jan 31, 2016

1 answer

12

TIFR CSE 2011 | Part B | Question: 34
Consider the class of synchronization primitives. Which of the following is false? Test and set primitives are as powerful as semaphores. There are various synchronizations that can be implemented using an array of semaphores but not by binary ... equivalent. All statements a - c are false. Petri nets with and without inhibitor arcs have the same power.

Consider the class of synchronization primitives. Which of the following is false?Test and set primitives are as powerful as semaphores.There are various synchronizations...

2.3k views

commented Jan 31, 2016

5 answers

13

GATE CSE 1996 | Question: 2.19
A solution to the Dining Philosophers Problem which avoids deadlock is to ensure that all philosophers pick up the left fork before the right fork ensure that all philosophers pick up the right fork before the left fork ensure that one particular ... the right fork, and that all other philosophers pick up the right fork before the left fork None of the above

A solution to the Dining Philosophers Problem which avoids deadlock is toensure that all philosophers pick up the left fork before the right forkensure that all philosoph...

11.1k views

answered Jan 31, 2016

10 answers

14

GATE CSE 2005 | Question: 82a
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$. Consider the edge $e$ having the minimum weight amongst all those edges that ... of $G$ the weighted shortest path from $s$ to $t$ each path from $s$ to $t$ the weighted longest path from $s$ to $t$

Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$...

12.7k views

commented Jan 30, 2016

4 answers

15

Virtual Gate Test Series: CO & Architecture - Pipelining Comparision
For D1 1st instruction will take 3+2+4+2+3 = 16ns rest 99 instruction will take 99*4=396 Hence total: 16+396=412 For D2 1st instruction will take 2+2+2+2+2+2+2+2 = 16ns rest 99 instruction will take 99*2=198 Hence total: 16+198=214 Hence, 412-214=198 according to me Where am I going wrong?

For D11st instruction will take 3+2+4+2+3 = 16nsrest 99 instruction will take 99*4=396Hence total: 16+396=412For D21st instruction will take 2+2+2+2+2+2+2+2 = 16nsrest 99...

675 views

commented Jan 30, 2016

11 answers

16

GATE CSE 2004 | Question: 81
Let $G_1=(V,E_1)$ and $G_2 =(V,E_2)$ be connected graphs on the same vertex set $V$ with more than two vertices. If $G_1 \cap G_2= (V,E_1\cap E_2)$ is not a connected graph, then the graph $G_1\cup G_2=(V,E_1\cup E_2)$ cannot have a cut vertex must have a cycle must have a cut-edge (bridge) has chromatic number strictly greater than those of $G_1$ and $G_2$

Let $G_1=(V,E_1)$ and $G_2 =(V,E_2)$ be connected graphs on the same vertex set $V$ with more than two vertices. If $G_1 \cap G_2= (V,E_1\cap E_2)$ is not a connected gr...

11.8k views

commented Jan 30, 2016

12 answers

17

GATE CSE 2003 | Question: 61
In a permutation $a_1 ... a_n$, of n distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i > a_j$. If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of $1. . . n$? $\frac{n(n-1)}{2}$ $\frac{n(n-1)}{4}$ $\frac{n(n+1)}{4}$ $2n[\log_2n]$

In a permutation $a_1 ... a_n$, of n distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i a_j$.If all permutations are equally likel...

22.0k views

commented Jan 30, 2016

1 answer

18

MadeEasy Test Series: CO & Architecture - Instruction Execution
Each word is 4b and there are 10 words 40 B 3000+40B +1 What is the actual solution ?

Each word is 4b and there are 10 words40 B3000+40B +1What is the actual solution ?

870 views

commented Jan 30, 2016

11 answers

19

GATE CSE 2014 Set 1 | Question: 47
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true? There exists a $y$ in the interval $(0,1)$ such that $f(y) = f(y+1)$ For every $y$ ... the function in the interval $(0,2)$ is $1$ There exists a $y$ in the interval $(0,1)$ such that $f(y)$ = $-f(2-y)$

A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true?There exis...

21.0k views

commented Jan 30, 2016

2 answers

20

write down a minimal cover
Consider the attribute set R = ABCDEGH (where Functional Dependencies are F= {AB·--> C,AC --> B: AD ---> E, B -----> D, BE --> A, B -> G}.

Consider the attribute set R = ABCDEGH (where Functional Dependencies areF= {AB· C,AC B: AD - E, B - D, BE A, B - G}.

1.3k views

commented Jan 29, 2016

2 answers

21

MadeEasy Test Series: Algorithms - Greedy Algorithm
There are n white dots and n black dots. Equally spaced in a line. You want to connect each white dot with some block dot in one to one fashion with a minimum total length of wire. Consider 2 examples: Greedy algorithm gives optimal solution for Only (i) Only (ii) Both (i) and (ii) None of these

There are n white dots and n black dots. Equally spaced in a line. You want to connect each white dot with some block dot in one to one fashion with a minimum total lengt...

2.2k views

commented Jan 29, 2016

3 answers

22

Progress guaranteed/Mutual Exclusion/Deadlock or not?
var occupied var blocked Enter Region: { If (occupied) { then blocked= blocked +1 sleep ( ); } else occupied= 1; } Exit Region: { occupied= 0 If (blocked) { then wakeup (process); blocked= blocked – 1; } } True/False (1) Mutual Exclusion is guaranteed? (2) Deadlock free Algorithm? (3) Progress is guaranteed?

var occupiedvar blockedEnter Region:{If (occupied) {then blocked= blocked +1sleep ( );}else occupied= 1;}Exit Region:{occupied= 0If (blocked) {then wakeup (process);block...

2.3k views

commented Jan 29, 2016

4 answers

23

DAG
Q). Consider the following directed acyclic graph (DAG): The expression represented by above DAG is: (A) $a+a+(a+a+a)$ (B) $a+a+(a+a+a+(a+a+a+a))$ (C) $a+a+(a+a+a+(a+a+a))$ (D) None

Q). Consider the following directed acyclic graph (DAG): The expression represented by above DAG is:(A) $a+a+(a+a+a)$(B) $a+a+(a+a+a+(a+a+a+a))$...

3.4k views

commented Jan 29, 2016

6 answers

24

TIFR CSE 2012 | Part A | Question: 7
It is required to divide the $2n$ members of a club into $n$ disjoint teams of $2$ members each. The teams are not labelled. The number of ways in which this can be done is: $\frac{\left ( 2n \right )!}{2^{n}}$ $\frac{\left ( 2n \right )!}{n!}$ $\frac{\left ( 2n \right )!}{2^n . n!}$ $\frac{n!}{2}$ None of the above

It is required to divide the $2n$ members of a club into $n$ disjoint teams of $2$ members each. The teams are not labelled. The number of ways in which this can be done ...

4.7k views

commented Jan 29, 2016

3 answers

25

How many DFA's exist with three states over the input alphabet {0,1}
Is there any procedure to generalize these types of problems ? Thanks in advance

Is there any procedure to generalize these types of problems ? Thanks in advance

16.4k views

commented Jan 29, 2016

11 answers

26

GATE IT 2006 | Question: 9
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree is $10$ $11$ $12$ $15$

In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree i...

26.1k views

commented Jan 28, 2016

11 answers

27

GATE2014 EC-1: GA-10
You are given three coins: one has heads on both faces, the second has tails on both faces, and the third has a head on one face and a tail on the other. You choose a coin at random and toss it, and it comes up heads. The probability that the other face is tails is $\dfrac{1}{4}$ $\dfrac{1}{3}$ $\dfrac{1}{2}$ $\dfrac{2}{3}$

You are given three coins: one has heads on both faces, the second has tails on both faces, and the third has a head on one face and a tail on the other. You choose a coi...

10.3k views

commented Jan 28, 2016

6 answers

28

GATE CSE 2015 Set 3 | Question: 9
The value of $\displaystyle \lim_{x \rightarrow \infty} (1+x^2)^{e^{-x}}$ is $0$ $\frac{1}{2}$ $1$ $\infty$

The value of $\displaystyle \lim_{x \rightarrow \infty} (1+x^2)^{e^{-x}}$ is$0$$\frac{1}{2}$$1$$\infty$

13.3k views

commented Jan 27, 2016

5 answers

29

GATE CSE 1991 | Question: 1,ix
If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______

If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______

5.5k views

commented Jan 27, 2016

4 answers

30

GEEK_MOCK_QUETION_30
$\begin{pmatrix} 4&3 \\ 6&3 \end{pmatrix}$ What is the sum of all the elements of the $L$ and $U$ matrices as obtained in the L U decomposition? $16$ $10$ $9$ $6$

$\begin{pmatrix}4&3 \\6&3 \end{pmatrix}$What is the sum of all the elements of the $L$ and $U$ matrices as obtained in the L U decomposition?$16$$10$$9$$6$

1.3k views

answer selected Jan 27, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true