Answers by sshekhar94 / GATE Overflow for GATE CSE

0 votes

1

Nullity of matrix is defined only for square matrices rank(A) + nullity(A) = order of matrix ?
Nullity of matrix is defined only for square matrices rank(A) + nullity(A) = order of matrix ?

Nullity of matrix is defined only for square matricesrank(A) + nullity(A) = order of matrix ?

3.3k views

answered Mar 10, 2016

0 votes

2

GATE1991-15,a
Show that the product of the least common multiple and the greatest common divisor of two positive integers $a$ and $b$ is $a\times b$.

Show that the product of the least common multiple and the greatest common divisor of two p...

2.0k views

answered Mar 9, 2016

3 votes

3

GATE CSE 1991 | Question: 10a
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol) Is the grammar ... what is the relative precedence between $-$ and $/$? If not, give an unambiguous grammar that gives $/$ precedence over $-$.

Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative$E \rightarrow E -T\mid T$$T \rightarrow T/F\mid F$ ...

4.5k views

answered Mar 9, 2016

38 votes

4

GATE CSE 1998 | Question: 6b
Consider the grammar S $\rightarrow Aa \mid b$ A $\rightarrow Ac \mid Sd \mid \epsilon$ Construct an equivalent grammar with no left recursion and with minimum number of production rules.

Consider the grammarS $\rightarrow Aa \mid b$A $\rightarrow Ac \mid Sd \mid \epsilon$Construct an equivalent grammar with no left recursion and with minimum number of pr...

7.0k views

answered Mar 8, 2016

61 votes

5

GATE CSE 1998 | Question: 2.18, UGCNET-June2012-III: 48
If an instruction takes $i$ microseconds and a page fault takes an additional $j$ microseconds, the effective instruction time if on the average a page fault occurs every $k$ instruction is: $i + \dfrac{j}{k}$ $i +(j\times k)$ $\dfrac{i+j}{k}$ $({i+j})\times {k}$

If an instruction takes $i$ microseconds and a page fault takes an additional $j$ microseconds, the effective instruction time if on the average a page fault occurs every...

19.4k views

answered Mar 7, 2016

27 votes

6

GATE CSE 1998 | Question: 1.21, ISRO2008-16
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph? Dynamic programming Backtracking Greedy Divide and Conquer

Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?Dynamic programmingBacktrackingGreedyDivide and Conqu...

9.2k views

answered Mar 7, 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