Questions by Shubhanshu / GATE Overflow for GATE CSE

1 votes

0 answers

41

Bounded Wait
Process Pi repeat flag[i] = true; while ( flag[j] ) do no-op; < critical - section > flag[i] = false; < remainder - section > until false; Note : "i" refer0s to current process and "j" refers to another process. How Bounded Wait is satisfied here?

Process Pi repeatflag[i] = true; while ( flag[j] ) do no-op; < critical - section flag[i] = false; < remainder - section until false; Note : "i" refer0s to current proc...

2.0k views

asked Dec 7, 2017

2 votes

1 answer

42

Gambler and Four Coins
A Gambler has four coins in his pocket. Two are double-headed, one is double-tailed and one is normal coin. The coins cannot be distinguished until one looks at them. The gambler takes a coin at random, opens his eyes and sees that the upper face of the coin is the head. What is the probability that the lower face is a head? Given answer is 4/5. I think it should be 2/3.

A Gambler has four coins in his pocket. Two are double-headed, one is double-tailed and one is normal coin. The coins cannot be distinguished until one looks at them. The...

906 views

asked Dec 6, 2017

0 votes

0 answers

43

Number of Table in ER
Q1 I think here number of tables required should be 2 right? Q2 Consider the following set of functional dependencies { (Eid, pno) --> hours, Eid --> Ename, Pno --> (Pname, Plocation), Pname --> Plocation } in a relation R ( ... in an entity It can be derived from a different entity All of the above. Here answer is 4. Any good reference to support answer?

Q1I think here number of tables required should be 2 right?Q2 Consider the following set of functional dependencies{(Eid, pno) hours,Eid Ename,Pno (Pnam...

298 views

asked Dec 3, 2017

1 votes

0 answers

44

Number of Super keys
Q1) Consider the relation with n attributes if any 2 attribute is a candidate key, then the total number of candidate keys are___ ? Then what will be the generalized formula I) $\sum_{i=2}^{n}C(n,i)$ II) $\sum_{i=2}^{n}C(n,i)*C(i,2)$ ... then ABE is a single superkey. So which one is correct? Q2) Is the answer remains same if use every in place of any in above question?

Q1) Consider the relation with n attributes if any 2 attribute is a candidate key, then the total number of candidate keys are___ ?Then what will be the generalized formu...

764 views

asked Dec 3, 2017

0 votes

1 answer

45

Deadlock: Safe or Unsafe
Consider a system with 12 tape drives with: Process Max Need Allocated P1 10 5 P2 9 3 Is this system is in a safe or unsafe state? If it is not safe then under which condition system leads to deadlock?

Consider a system with 12 tape drives with:ProcessMax Need AllocatedP1105P293Is this system is in a safe or unsafe state? If it is not safe then under which condition sys...

1.6k views

asked Dec 2, 2017

0 votes

0 answers

46

Order of generator of a group
Suppose that G is a cyclic group of order 10 with generator a belongs to G. Order of a^8 is ________.

Suppose that G is a cyclic group of order 10 with generator a belongs to G. Order of a^8 is ________.

980 views

asked Nov 19, 2017

3 votes

1 answer

47

Limit
the value of :- $\lim_{x \rightarrow 0}(\frac{1}{x^2} - \frac{1}{sin^2x})$ Is_______ Answer given is -1\3

the value of :-$\lim_{x \rightarrow 0}(\frac{1}{x^2} - \frac{1}{sin^2x})$Is_______Answer given is -1\3

1.6k views

asked Nov 18, 2017

0 votes

0 answers

48

Equivalence Relation
Which of the above are true. I think only 1st one is true. But the answer given is all are true.

Which of the above are true.I think only 1st one is true. But the answer given is all are true.

459 views

asked Nov 15, 2017

2 votes

2 answers

49

Knight and Knave Problem
Answer given Only II is not possible but I think II and III are not possible.

Answer given Only II is not possible but I think II and III are not possible.

599 views

asked Nov 14, 2017

7 votes

1 answer

50

Graph Theory
Graph G(V,E) is a connected planar graph with no cycle of length less than 4 edges, if |V| = 15 then maximum value of |E| is: The answer given is 26.

Graph G(V,E) is a connected planar graph with no cycle of length less than 4 edges, if |V| = 15 then maximum value of |E| is:The answer given is 26.

1.9k views

asked Nov 13, 2017

4 votes

1 answer

51

CSMA/CD with and without Collision
A network with CSMA/CD protocol in the MAC layer is running at 1 Gbps over a 1 km cable with no repeaters. The signal speed in the cable is 2 x 108 m/sec. The frame size for this network 10000 bits what is the total time requires to send this frame completely:- 1) when there is no collision in the channel. 2) when there is collision in the channel.

A network with CSMA/CD protocol in the MAC layer is running at 1 Gbps over a 1 km cable with no repeaters. The signal speed in the cable is 2 x 108 m/sec. The frame size ...

1.1k views

asked Nov 12, 2017

2 votes

2 answers

52

Congest oSlow start
What is the effective throughput for transferring a 1600 KB file when TCP using slow start congestion control technique. Given round trip time 20 ms and Maximum segment size 800 bytes. Assume there are no packet losses, unlimited bandwidth, and receiver window size. Assume slow start begins initially with a congestion window size of 1. Answer given = 8MBPS.

What is the effective throughput for transferring a 1600 KB file when TCP using slow start congestion control technique. Given round trip time 20 ms and Maximum segment s...

944 views

asked Nov 11, 2017

0 votes

1 answer

53

Exponential Back off Algorithm
Assume that X and Y are the only two stations on an ethernet. Each has a steady queue of frames to send. Both X and Y attempt to transmit a frame, collide and Y wins the first backoff race. At the end of this successful transmission by Y, both X and Y ... X wins the second backoff race is I think it should be 0.03125 or 1/32. But the answer given is 0.125 or 1/8.

Assume that X and Y are the only two stations on an ethernet. Each has a steadyqueue of frames to send. Both X and Y attempt to transmit a frame, collide and Ywins the fi...

2.0k views

asked Nov 10, 2017

4 votes

1 answer

54

Dependency VS Hazard
Consider following program is executed on a 5 stage RISC pipeline and stages are IF, ID, EX, MA, WB. IF = Instruction Fetch ID = Instruction Decode and fetch register EX = Execution Stage MA = Memory Access WB = Write back register file Program: ... and Hazards.(There is no Structural Dependency) My Answers -> Dependencies = 6, hazards = 3. Someone verify these answer.

Consider following program is executed on a 5 stage RISC pipeline and stages are IF, ID, EX, MA, WB.IF = Instruction FetchID = Instruction Decode and fetch register EX =...

2.4k views

asked Nov 8, 2017

3 votes

3 answers

55

Hardware requirement in 16-way Set Associative Cache
Cache size 32 KB Block size = 32 Bytes Address size = 28 bit. Associativity of Cache = 16 Determine what is the hardware requirement to design the 16-way set associative cache. Hardware requirement -> Mux, Comparator, Demux, Decoder, Encoder ... lines are 5. 4) 64 And gates 5) 1 OR gate input line = 64 Someone, please verify these attributes??

Cache size 32 KBBlock size = 32 BytesAddress size = 28 bit.Associativity of Cache = 16Determine what is the hardware requirement to design the 16-way set associative cach...

3.2k views

asked Nov 6, 2017

0 votes

1 answer

56

Call by name, by refrence, by need and by value
void main() { int i = 10, j = 20; evaluate(i+j); } void evaluate(int x) { print(x); x = 2 * 10; // in this I think call-by-name give lvalue error. print(x); } I think call-by-reference will also give an error, ... -reference needs an address to point. Evaluate the result using 1. call-by-reference 2. call-by-name 3. call-by-need 4. call-by-value.

void main() { int i = 10, j = 20; evaluate(i+j); } void evaluate(int x) { print(x); x = 2 * 10; // in this I think call-by-name give lvalue error. print(x); }I think call...

2.1k views

asked Nov 4, 2017

1 votes

0 answers

57

Static Single Assignment
Consider below two question :- https://gateoverflow.in/39675/gate-2016-1-19 https://gateoverflow.in/8365/gate2015-1_55 Q1 >> Consider the following code segment. x = u - t; y = x * v; x = y + w; y = t - z; y = x * ... temp variable to "r", whereas in Solution 1 we have allocated temp variable to u and t both. Even both are using static single assignment?

Consider below two question :-https://gateoverflow.in/39675/gate-2016-1-19https://gateoverflow.in/8365/gate2015-1_55Q1 > Consider the following code segment.x = u - t; y ...

813 views

asked Nov 4, 2017

4 votes

4 answers

58

Tokens, Lexeme and Pattern
There are 40 tokens in this question. But I have doubt that what should be the wording of the question "The number of LEXEMES generated by the Lexical Analyzer in the above program is _______ " OR "The number of ... - Keyword, Operators, Identifiers, Constant, Punctuation Symbol and String Constants. How token and lexeme are different from each other?

There are 40 tokens in this question.But I have doubt that what should be the wording of the question "The number of LEXEMES generated by the Lexical Analyzer in the abov...

5.5k views

asked Nov 2, 2017

0 votes

3 answers

59

Class of Language and Decidability
Question 1 >> Consider the following two languages: Which of the following statement is true? a. L1 is CSL and L2 is CFL but not CSL b. Both L1 and L2 are CSL but not CFL c. Both L1 and L2 are CSL but not CFL d. Both L1 and L2 ... language is CSL but not CFL, but I think it should be D) both language is CFL but not regular. is there something I am missing.

Question 1 > Consider the following two languages:Which of the following statement is true?a. L1 is CSL and L2 is CFL but not CSLb. Both L1 and L2 are CSL but not CFLc. B...

356 views

asked Nov 1, 2017

1 votes

0 answers

60

Grammar For symbol at position i and i+2
L = {x belongs to {0,1}* ||x| >1 and symbol at position i is same as at position i+2} The fourth option is None of these I think such grammar we cannot achieve until we have bound on i. Consider the n length string, in this string ... C seems to be true. But if the language not have bound on i then it will be D) none of these. Is this correct observation?

L = {x belongs to {0,1}* ||x| >1 and symbol at position i is same as at position i+2}The fourth option is None of theseI think such grammar we cannot achieve until we hav...

325 views

asked Nov 1, 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