Answers by Aditya / GATE Overflow for GATE CSE

2 votes

1

toc
Suppose we have a language $L$ and it is finite, now if we take a complement of language $L$ than what can we say about the language $L^{ / }$ ? a.) Language is decidable b.) Undecidable??

Suppose we have a language $L$ and it is finite, now if we take a complement of language $L$ than what can we say about the language $L^{ / }$ ?a.) Language is decidableb...

951 views

answered Nov 6, 2015

0 votes

2

query
consider following queries over R(AB) ans S(BC) Q1:select distinct A,C from R,S where R.B=S.B Q2:{A,C|∃B(A,B)|∊R ∧(B,C)∊S)} Q3:∏A,C(R⨝S) which of following queries are equivalent??

consider following queries over R(AB) ans S(BC)Q1:select distinct A,C from R,S where R.B=S.BQ2:{A,C|∃B(A,B)|∊R ∧(B,C)∊S)}Q3:∏A,C(R⨝S)which of following que...

346 views

answered Oct 19, 2015

0 votes

3

3nf decomposition
Consider R(ABCDEF) with following fd AB->CDEF C->A D->B C->D E->F B->E Decompose it into 3NF

Consider R(ABCDEF) with following fdAB->CDEFC->AD->BC->DE->FB->EDecompose it into 3NF

901 views

answered Oct 19, 2015

0 votes

4

What is the criteria for distinguishing data structure in terms of linear and non-linear ?
What is the criteria for distinguishing data structure in terms of linear and non-linear ? I am bit confused with the criteria for this. I have search and tried to clear this confusion but then i got more ... categorizing on the basis of storage in the memory and some place it is on the basis of traversal.

What is the criteria for distinguishing data structure in terms of linear and non-linear ?I am bit confused with the criteria for this. I have search and tried to clear t...

882 views

answered Oct 10, 2015

9 votes

5

GATE CSE 2000 | Question: 18
Consider the following program is pseudo-Pascal syntax program main; var x: integer; procedure Q (z: integer); begin z := z+x; writeln(z); end; procedure P (y: integer); var x: integer; begin x := y+2; Q(x); writeln(x); ... is call-by-value and the scope rule is static scoping? the parameter passing mechanism is call-by-reference and the scope rule is dynamic scoping?

Consider the following program is pseudo-Pascal syntaxprogram main; var x: integer; procedure Q (z: integer); begin z := z+x; writeln(z); end; procedure P (y: integer);...

3.1k views

answered Sep 28, 2015

29 votes

6

GATE CSE 2004 | Question: 32
Consider the following program fragment for reversing the digits in a given integer to obtain a new integer. Let $n = d_1\, d_2\, \ldots\, d_m$. int n, rev; rev = 0; while(n > 0) { rev = rev * 10 + n%10; n = n/10; } The loop invariant condition at the end ... $n=d_1\, d_2 \,\ldots\, d_m \qquad \mathbf{or} \qquad \text{rev} =d_m \,\ldots\, d_2\, d_1$

Consider the following program fragment for reversing the digits in a given integer to obtain a new integer.Let $n = d_1\, d_2\, \ldots\, d_m$.int n, rev; rev = 0; while(...

12.3k views

answered Sep 24, 2015

18 votes

7

ISRO2014-13
Which of the following is true with respect to Reference? A reference can never be NULL A reference needs an explicit dereferencing mechanism A reference can be reassigned after it is established A reference and pointer are synonymous

Which of the following is true with respect to Reference?A reference can never be NULLA reference needs an explicit dereferencing mechanismA reference can be reassigned a...

5.2k views

answered Sep 23, 2015

19 votes

8

GATE CSE 1999 | Question: 15
What will be the output of the following program assuming that parameter passing is call by value call by reference call by copy restore procedure P{x, y, z}; begin y:y+1; z: x+x; end; begin a:= b:= 3; P(a+b, a, a); Print(a); end

What will be the output of the following program assuming that parameter passing iscall by valuecall by referencecall by copy restoreprocedure P{x, y, z}; begin y:y+1; z:...

5.9k views

answered Sep 23, 2015

7 votes

9

GATE CSE 1998 | Question: 19a
Let $p$ be a pointer as shown in the figure in a single linked list. What do the following assignment statements achieve? q:= p -> next p -> next:= q -> next q -> next:=(q -> next) -> next (p -> next) -> next:= q

Let $p$ be a pointer as shown in the figure in a single linked list. What do the following assignment state...

7.9k views

answered Sep 23, 2015

0 votes

10

The minimum number of temporary variables needed to swap the contents of two variables?
The minimum number of temporary variables needed to swap the contents of two variables is: (a) 1 (b) 2 (c) 3 (d) 0

The minimum number of temporary variables needed to swap the contents of two variables is:(a) 1 (b) 2(c) 3 (d) 0

17.0k views

answered Sep 15, 2015

7 votes

11

Which of the following is not a recursive Language? Please explain the reason for each
Which of the following is not a recursive language? a. Regular language b. {$\langle M,w \rangle$ | $M$ is a DFA that accepts $w$} c. {$\langle M \rangle$ | $M$ is a TM and there exists an input which halts within $100$ steps} d. {$\langle M \rangle$ | $M$ is a TM and $L(M)$ is regular }

Which of the following is not a recursive language?a. Regular languageb. {$\langle M,w \rangle$ | $M$ is a DFA that accepts $w$}c. {$\langle M \rangle$ | $M$ is a TM and ...

1.4k views

answered Sep 11, 2015

0 votes

12

toc
for DCFL there exists LL(k) or not?

for DCFL there exists LL(k) or not?

1.1k views

answered Aug 21, 2015

–1 votes

13

Let A and B be disjoint, R.E. languages. Let A' U B' also be recursive enumerable. What can you say about A and B?

Let $A$ and $B$ be disjoint, R.E. languages. Let $\bar A \cup \bar B$ also be recursive enumerable. What can you say about $A$ and $B$?(a) Neither A nor B is decidable is...

3.2k views

answered Aug 19, 2015

0 votes

14

L1 = {ca^nb^n} ∪ {da^nb^2n} L2 = {a^nb^n c} ∪ {a^nb^2n d}
$L_1 = \left\{ca^nb^n\right\} \cup \left\{da^nb^{2n}\right\}$ $L_2 = \left\{a^nb^n c\right\} \cup \left\{a^nb^{2n} d\right\}$ Both are DCFL’s Both are NCFL’s L1 is DCFL, L2 is NCFL L1 is NCFL, L2 is DCFL

$L_1 = \left\{ca^nb^n\right\} \cup \left\{da^nb^{2n}\right\}$$L_2 = \left\{a^nb^n c\right\} \cup \left\{a^nb^{2n} d\right\}$Both are DCFL’sBoth are NCFL’sL1 i...

1.9k views

answered Aug 19, 2015

22 votes

15

GATE CSE 1992 | Question: 03,ii
Mention the pass number for each of the following activities that occur in a two pass assembler: object code generation literals added to literal table listing printed address resolution of local symbols

Mention the pass number for each of the following activities that occur in a two pass assembler:object code generationliterals added to literal tablelisting printedaddres...

4.6k views

answered Aug 12, 2015

10 votes

16

GATE CSE 2000 | Question: 19
Consider the syntax directed translation scheme $\textsf{(SDTS)}$ ... given, without changing the grammar, to find $E.red$, the number of reductions performed while reducing an input to $E$.

Consider the syntax directed translation scheme $\textsf{(SDTS)}$ given in the following. Assume attribute evaluation with bottom-up parsing, i.e., attributes are evaluat...

8.3k views

answered Aug 12, 2015

39 votes

17

GATE CSE 2001 | Question: 16
Consider the following grammar with terminal alphabet $\Sigma =\{a,(,),+,* \}$ and start symbol $E$. The production rules of the grammar are: $ E \rightarrow aA$ $ E \rightarrow (E)$ $A \rightarrow +E$ $A \rightarrow *E$ $A \rightarrow \epsilon $ Compute the FIRST and FOLLOW sets for $E$ and $A$. Complete the LL(1) parse table for the grammar.

Consider the following grammar with terminal alphabet $\Sigma =\{a,(,),+,* \}$ and start symbol $E$. The production rules of the grammar are:$ E \rightarrow aA$$ E \right...

4.9k views

answered Aug 12, 2015

15 votes

18

the possible no of dfa with three states
Q The possible no of dfa with three states X,Y and Z, where X being always initial state for the DFA over the alphabet {0,1} a)5830 b)5831 c)5832 d)5932 correct answer is option C,but what is the systematic way to get it??

QThe possible no of dfa with three states X,Y and Z, where X being always initial state for the DFA over the alphabet {0,1}a)5830b)5831c)5832d)5932correct answer is optio...

7.9k views

answered Jul 20, 2015

8 votes

19

GATE CSE 2011 | Question: 7
A company needs to develop a digital signal processing software for one of its newest inventions. The software is expected to have 40000 lines of code. The company needs to determine the effort in person-months needed to develop this software using the basic COCOMO ... factor is given as 1.20. What is the estimated effort in person-months? 234.25 932.50 287.80 122.40

A company needs to develop a digital signal processing software for one of its newest inventions. The software is expected to have 40000 lines of code. The company needs ...

5.3k views

answered Nov 21, 2014

6 votes

20

GATE IT 2004 | Question: 17
In a software project, COCOMO (Constructive Cost Model) is used to estimate effort and duration based on the size of the software size and duration based on the effort of the software effort and cost based on the duration of the software size, effort and duration based on the cost of the software

In a software project, COCOMO (Constructive Cost Model) is used to estimateeffort and duration based on the size of the softwaresize and duration based on the effort of t...

3.6k views

answered Nov 21, 2014

10 votes

21

GATE IT 2004 | Question: 71
A software was tested using the error seeding strategy in which 20 errors were seeded in the code. When the code was tested using the complete test suite, 16 of the seeded errors were detected. The same test suite also detected 200 non-seeded errors. What is the estimated number of undetected errors in the code after this testing? 4 50 200 250

A software was tested using the error seeding strategy in which 20 errors were seeded in the code. When the code was tested using the complete test suite, 16 of the seede...

4.0k views

answered Nov 21, 2014

6 votes

22

GATE IT 2004 | Question: 70
Assume that the delivered lines of code L of a software is related to the effort E in person months and duration t in calendar months by the relation L P* (E/B)1/3 * t4/3, where P and B are two constants for the software process and ... asked the project team to complete the software project in 4 months. What would be the required effort in person months? 10 40 160 320

Assume that the delivered lines of code L of a software is related to the effort E in person months and duration t in calendar months by the relation L P* (E/B)1/3 * t4/3...

3.2k views

answered Nov 21, 2014

7 votes

23

GATE IT 2004 | Question: 72
What is the availability of a software with the following reliability figures? Mean Time Between Failure (MTBF) = 25 days Mean Time To Repair (MTTR) = 6 hours 1% 24% 99% 99.009%

What is the availability of a software with the following reliability figures?Mean Time Between Failure (MTBF) = 25 daysMean Time To Repair (MTTR) = 6 hours1%24%99%99.009...

5.2k views

answered Nov 20, 2014

11 votes

24

GATE IT 2005 | Question: 64
The availability of a complex software is 90%. Its Mean Time Between Failure (MTBF) is 200 days. Because of the critical nature of the usage, the organization deploying the software further enhanced it to obtain an availability of 95%. In the process, the ... (MTTR) increased by 5 days. What is the MTBF of the enhanced software? 205 days 300 days 500 days 700 days

The availability of a complex software is 90%. Its Mean Time Between Failure (MTBF) is 200 days. Because of the critical nature of the usage, the organization deploying t...

5.0k views

answered Nov 20, 2014

7 votes

25

GATE IT 2005 | Question: 65
Tb carry out white box testing of a program, its flow chart representation is obtained as shown in the figure below: For basis path based testing of this program, its cyclomatic complexity is $5$ $4$ $3$ $2$

Tb carry out white box testing of a program, its flow chart representation is obtained as shown in the figure below:For basis path based testing of this program, its cycl...

2.9k views

answered Nov 20, 2014

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