Recent questions tagged made-easy-test-series / GATE Overflow for GATE CSE

Consider the vertices ‘a’ and ‘b’ that are simultaneously on the function call stack at some point during the execution ofDFS from vertices ‘s’ in diagraph. W...

KISHALAY DAS

1.8k views

KISHALAY DAS asked Oct 16, 2016

2 votes

1 answer

1538

MadeEasy Test Series: Theory Of Computation - Regular Expressions
The regular expression equivalent to (a*b)* a* (a) (ab*)* a* (b) (a*b*)*a* (c) a* (ba*)* (d) (ab*)*b* Why correct answer is only (c), not (b) also??

The regular expression equivalent to (a*b)* a*(a) (ab*)* a* (b) (a*b*)*a* (c) a* (ba*)* (d) (ab*)*b*Why correct answer is only (c), not (b) ...

ARUN KUMAR 3

944 views

ARUN KUMAR 3 asked Oct 15, 2016

3 votes

4 answers

1539

MadeEasy Test Series: Theory Of Computation - Finite Automata
How many states are there in a minimal state FA accepting {0,01,011,001} ? (a) 4 (b) 5 (c) 6 (d) 7

How many states are there in a minimal state FA accepting {0,01,011,001} ?(a) 4 (b) 5 (c) 6 (d) 7

ARUN KUMAR 3

1.1k views

ARUN KUMAR 3 asked Oct 15, 2016

0 votes

1 answer

1540

MadeEasy Test Series: Theory Of Computation - Regular Grammar
The grammer {S--> aA | aB | ε, A--> Ab | ε } is (a) Regular and Linear (b) Regular but not Linear (c) Linear but not Regular (d) Neither Linear nor Regular

The grammer {S aA | aB | ε, A Ab | ε } is(a) Regular and Linear(b) Regular but not Linear(c) Linear but not Regular(d) Neither Linear nor Regular

ARUN KUMAR 3

768 views

ARUN KUMAR 3 asked Oct 15, 2016

1 votes

1 answer

1541

ME TEST SERIES

Aman Jha

401 views

Aman Jha asked Oct 14, 2016

0 votes

1 answer

1542

me/test
explain plzz

explain plzz

Rajesh Raj

500 views

Rajesh Raj asked Oct 14, 2016

1 votes

2 answers

1543

MadeEasy Test Series: Compiler Design - Grammar
Given the following expression grammer: E --> E * F | F + E | F F --> F - F | id Which of the following is true?? (a) * has higher precendence than + (b) - has higher precendence than * (c) + and - have same precendence (d) + has higher precendence than *

Given the following expression grammer:E E * F | F + E | FF F - F | idWhich of the following is true??(a) * has higher precendence than +(b) - has higher precendence ...

ARUN KUMAR 3

451 views

ARUN KUMAR 3 asked Oct 12, 2016

0 votes

1 answer

1544

MadeEasy Test Series: Theory Of Computation - Grammar
If a parse tree is made for a w ε L(G), when G is in Chomsky-Normal form then what would be it's least height?? Plz explain what and how...

If a parse tree is made for a w ε L(G), when G is in Chomsky-Normal form then what would be it's least height?? Plz explain what and how...

ARUN KUMAR 3

549 views

ARUN KUMAR 3 asked Oct 12, 2016

3 votes

2 answers

1545

made easy test
1. ambiguous 2. left recursive 3. unambiguous 4. None

1. ambiguous2. left recursive3. unambiguous4. None

kashyap.rj

323 views

kashyap.rj asked Oct 11, 2016

1 votes

2 answers

1546

MadeEasy Test Series: Operating System - Disk Scheduling

vaishali jhalani

535 views

vaishali jhalani asked Oct 11, 2016

0 votes

1 answer

1547

MADE EASY TEST SERIES
Consider the following grammar: $S \rightarrow aPbSQ|a$ $Q \rightarrow t|\epsilon$ $P \rightarrow r$ The number of states will reduce when a LALR(1) parse is computed out of CLR(1) parser for the above grammar ________. [Made easy answer is 5 but my answer is 6. I will paste Made Easy's solution in the comment section.]

Consider the following grammar:$S \rightarrow aPbSQ|a$$Q \rightarrow t|\epsilon$$P \rightarrow r$The number of states will reduce when a LALR(1) parse is computed out o...

User007

931 views

User007 asked Oct 6, 2016

0 votes

1 answer

1548

MADE EASY TEST SERIES
Consider the following grammar: S --> aPbSQ/a Q --> tS/ ε P --> r Is the above grammar SLR(1) ?

Consider the following grammar:S aPbSQ/aQ tS/ εP r Is the above grammar SLR(1) ?

User007

494 views

User007 asked Oct 6, 2016

0 votes

2 answers

1549

MADE EASY TEST SERIES
Assume , -, + and / are operators. Precedences and associativity given for those operators as following: 1. has highest precedence among all operators and it is left associative 2. -, + and / are having equal precedence and they are right associative. Using as ... / is Division. The output of the following expression : 10 10 - 5 + 15 - 5 10 / 5 is ________.

Assume ×, –, + and / are operators. Precedences and associativity given for those operators as following:1. × has highest precedence among all operators and it is lef...

User007

1.2k views

User007 asked Oct 6, 2016

1 votes

5 answers

1550

MADE EASY TEST SERIES
Consider the following CFG: E --> E*T/T+E/T T --> (T*F)/F F --> id Which of the following strings are not generated by above CFG? A> id+id+id B> id∗id∗id C> (id∗id∗id) D> None of these

Consider the following CFG:E E*T/T+E/TT (T*F)/FF idWhich of the following strings are not generated by above CFG?A id+id+idB id∗id∗idC (id∗id∗id)D None of t...

User007

711 views

User007 asked Oct 5, 2016

0 votes

3 answers

1551

MADE EASY TEST SERIES
Consider the following augmented grammar G which is used to build LR (0) parsing table. E' __> E E __> E+T/T T __> T*F/F F -->(E)/id The number of shift reduce conflict in the LR(0) parsing table construction are __________. Please somebody help. I am not getting more then two but Made easy's answer is 3.

Consider the following augmented grammar G which is used to build LR (0) parsing table.E' __ EE __ E+T/TT __ T*F/FF >(E)/idThe number of shift reduce conflict in the LR(...

User007

910 views

User007 asked Oct 5, 2016

2 votes

2 answers

1552

MadeEasy Test Series: Operating System - File System
Which of the following statements are true? S1 : Using a larger block size in fixed block size file system leads to better disk throughput but poor disk space utilization. S2 : In index allocation of block to a file, the maximum possible size of file ... size of the address of blocks. a).Only S1 b).Only S2 c).Both S1 and S2 d).Neither S1 nor S2

Which of the following statements are true?S1 : Using a larger block size in fixed block size file system leads to better disk throughput but poor disk space utilization....

mcjoshi

2.1k views

mcjoshi asked Oct 5, 2016

2 votes

1 answer

1553

MadeEasy Workbook: Probability - Conditional Probability
Q : Two computers A and B are to be sold . A salesman who is assigned the job of selling these has the chances of 60 percent and 40 percent respectively to get success.The two computers may be sold independently.Given that at least ... probability that computer A has been sold is ..........(Round off your answer correct to 2 decimal places).

Q : Two computers A and B are to be sold . A salesman who is assigned the job of selling these has the chances of 60 percent and 40 percent respectively to get success.Th...

Habibkhan

3.4k views

Habibkhan asked Oct 4, 2016

4 votes

2 answers

1554

MadeEasy Workbook: Probability
Q : There are two identical locks with two identical keys and the key are among the six different ones which a person carries in his pocket.In hurry he drops one key somewhere . Then the probability that the locks can still be opened by drawing one key at random is equal to : a) 1/3 b) 5/6 c) 1/12 d) 1/30

Q : There are two identical locks with two identical keys and the key are among the six different ones which a person carries in his pocket.In hurry he drops one key some...

Habibkhan

5.4k views

Habibkhan asked Oct 4, 2016

4 votes

2 answers

1555

MadeEasy Test Series: Compiler Design - Viable Prefix
i think "(E+F*" is viable prefix but "E+F*" is not viable prefix. correct?

i think "(E+F*" is viable prefix but "E+F*" is not viable prefix. correct?

Anusha Motamarri

1.3k views

Anusha Motamarri asked Sep 30, 2016

2 votes

2 answers

1556

MadeEasy Test Series: Databases - Database Normalization
Let R(X,Y,Z,W) be a relational schema with the following dependencies: X -> Y, Y->Z ,Z ->W AND W -> Y. The decomposition of R into (x,y),(y,z),(y,w) is a) Lossy join , but is ... b) lossless join , but is not dependency preserving c) lossless join and is dependency preserving d) Lossy join , and is not dependency preserving

Let R(X,Y,Z,W) be a relational schema with the following dependencies: X - Y, Y->Z ,Z ->W AND W - Y.The decomposition of R into (x,y),(y,z),(y,w) isa) Lossy join , but i...

Turning Turing

837 views

Turning Turing asked Sep 26, 2016

4 votes

1 answer

1557

MadeEasy Test Series: Operating System - Process Synchronization

thor

976 views

thor asked Sep 25, 2016

17 votes

1 answer

1558

MadeEasy Test Series: Algorithms - Graph Algorithms
For the graph given below Dijkstra's algorithm does not provide correct shortest path tree. Suppose a new graph that is different only in weight between Q to S is created. The number of values of edge [Q to S] that ensures that Dijkstra's provide the ... tree where the values of edge (Q to S) ∈ [-20, 20] and P' is the source vertex are ______.

For the graph given below Dijkstra’s algorithm does not provide correct shortest path tree.Suppose a new graph that is different only in weight between Q to S is create...

User007

2.4k views

User007 asked Sep 24, 2016

4 votes

1 answer

1559

MadeEasy Test Series: Algorithms - Sorting
Consider the following code executed on an n-element array A such that each element i an A satisfies the condition 0 ≤ A[i] < 1. The code also uses an auxiliary array, B[0 to n - 1]. Random-Sort (A) { 1. n ← Length ... order. } Which algorithm will be placed in the blank at line 5 for sorting (stable) so that the code will give minimum time complexity?

Consider the following code executed on an n-element array A such that each element i an A satisfies thecondition 0 ≤ A[i] < 1. The code also uses an auxiliary array, B...

User007

3.5k views

User007 asked Sep 24, 2016

0 votes

1 answer

1560

made easy
what is the expected number of probs requires when inserting an element into an open address hash table with load factor x (assume uniform hashing) a 1/(1-x) b 1/(1+x) c 1/x d 2/(2-x)

what is the expected number of probs requires when inserting an element into an open address hash table with load factor x (assume uniform hashing)a 1/(1-x)b 1/(1+x)c 1/x...

qwertyui

449 views

qwertyui asked Sep 24, 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