Recent activity by raj_rajvir / GATE Overflow for GATE CSE

5 answers

1

CMI2013-A-02
$10\%$ of all email you receive is spam. Your spam filter is $90\%$ reliable: that is, $90\%$ of the mails it marks as spam are indeed spam and $90\%$ of spam mails are correctly labeled as spam. If you see a mail marked spam by your filter, what is the probability that it really is spam? $10\%$ $50\%$ $70\%$ $90\%$

$10\%$ of all email you receive is spam. Your spam filter is $90\%$ reliable: that is, $90\%$ of the mails it marks as spam are indeed spam and $90\%$ of spam mails are c...

7.9k views

answered Feb 7, 2018

7 answers

2

GATE CSE 2010 | Question: 37
The program below uses six temporary variables $a, b, c, d, e, f$. a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + f Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling? $2$ $3$ $4$ $6$

The program below uses six temporary variables $a, b, c, d, e, f$.a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + fAssuming tha...

21.8k views

commented Jan 9, 2018

0 answers

3

Topological ordering in Hasse diagram

1.8k views

commented Dec 26, 2017

7 answers

4

GATE IT 2006 | Question: 21
Consider the following first order logic formula in which $R$ is a binary relation symbol. $∀x∀y (R(x, y) \implies R(y, x))$ The formula is satisfiable and valid satisfiable and so is its negation unsatisfiable but its negation is valid satisfiable but its negation is unsatisfiable

Consider the following first order logic formula in which $R$ is a binary relation symbol.$∀x∀y (R(x, y) \implies R(y, x))$The formula issatisfiable and validsatisfia...

13.4k views

commented Dec 3, 2017

3 answers

5

TIFR CSE 2013 | Part B | Question: 3
How many $4 \times 4$ matrices with entries from ${0, 1}$ have odd determinant? Hint: Use modulo $2$ arithmetic. $20160$ $32767$ $49152$ $57343$ $65520$

How many $4 \times 4$ matrices with entries from ${0, 1}$ have odd determinant?Hint: Use modulo $2$ arithmetic.$20160$$32767$$49152$$57343$$65520$

4.5k views

commented Nov 12, 2017

4 answers

6

GATE CSE 2005 | Question: 46
Consider the set $H$ of all $3 * 3$ matrices of the type $\left( \begin{array}{ccc} a & f & e \\ 0 & b & d \\ 0 & 0 & c \end{array} \right)$ where $a,b,c,d,e$ and $f$ ... the matrix multiplication operation, the set $H$ is: a group a monoid but not a group a semi group but not a monoid neither a group nor a semi group

Consider the set $H$ of all $3 * 3$ matrices of the type $$\left( \begin{array}{ccc} a & f & e \\ 0 & b & d \\ 0 & 0 & c \end{array} \right)$$ where $a,b,c,d,e$ and $f$ a...

7.6k views

commented Nov 11, 2017

5 answers

7

GATE CSE 2008 | Question: 30
Let $\text{fsa}$ and $\text{pda}$ be two predicates such that $\text{fsa}(x)$ means $x$ is a finite state automaton and $\text{pda}(y)$ means that $y$ is a pushdown automaton. Let $\text{equivalent}$ ...

Let $\text{fsa}$ and $\text{pda}$ be two predicates such that $\text{fsa}(x)$ means $x$ is a finite state automaton and $\text{pda}(y)$ means that $y$ is a pushdown autom...

14.1k views

commented Oct 27, 2017

5 answers

8

GATE CSE 2012 | Question: 2
Which of the following is TRUE? Every relation in $\text{3NF}$ is also in $\text{BCNF}$ A relation $\text{R}$ is in $\text{3NF}$ if every non-prime attribute of $\text{R}$ is fully functionally dependent on every key of $R$ Every relation in $\text{BCNF}$ is also in $\text{3NF}$ No relation can be in both $\text{BCNF}$ and $\text{3NF}$

Which of the following is TRUE?Every relation in $\text{3NF}$ is also in $\text{BCNF}$A relation $\text{R}$ is in $\text{3NF}$ if every non-prime attribute of $\text{R}$ ...

19.8k views

commented Oct 7, 2017

7 answers

9

GATE CSE 2014 Set 3 | Question: 41
Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChild-rightSibling$ representation. Each node of the tree is of type $treeNode$. typedef struct ... height of the tree. number of nodes without a right sibling in the tree. number of leaf nodes in the tree

Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChild-rightSibl...

19.8k views

commented Jul 20, 2017

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