## Gate IT 2005

Please wait while the activity loads.

If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

Question 1 |

A bag contains 10 blue marbles, 20 green marbles and 30 red marbles. A marble is drawn from the bag, its colour recorded and it is put back in the bag. This process is repeated 3 times. The probability that no two of the marbles drawn have the same colour is

1/36 | |

1/6 | |

1/4 | |

1/3 |

**Probability**

**Gate IT 2005**

**Discuss it**

Question 1 Explanation:

As number of colors is 3,Possible combinations -> 3! = 6
Probability of Blue marble: 10/60
Probability of Green marble: 20/60
Probability of Red marble: 30/60
Probability that no two of the marbles drawn have the same colour is = 6 * (10/60 * 20/60 * 30/60) = 1/6

**Therefore B is the Answer**Question 2 |

If the trapezoidal method is used to evaluate the integral obtained

_{0}∫^{1}x^{2}dx ,then the value obtainedis always > (1/3) | |

is always < (1/3) | |

is always = (1/3) | |

may be greater or lesser than (1/3) |

**Numerical Methods and Calculus**

**Gate IT 2005**

**Discuss it**

Question 3 |

-1 | |

0 | |

1 | |

2 |

**Numerical Methods and Calculus**

**Gate IT 2005**

**Discuss it**

Question 3 Explanation:

Matrices don’t have value associated with them, but determinant have value associated with them. Determinant of a matrix can be find out by taking any one row or one column, in this row or column, multiplying each element with its cofactor and summing the value up.
This solution is contributed by

**Sandeep Pandey.**Question 4 |

Let L be a regular language and M be a context-free language, both over the alphabet Σ. Let Lc and Mc denote the complements of L and M respectively. Which of the following statements about the language Lc∪ Mc is TRUE

It is necessarily regular but not necessarily context-free | |

It is necessarily context-free. | |

It is necessarily non-regular. | |

None of the above |

**Regular languages and finite automata**

**Gate IT 2005**

**Discuss it**

Question 4 Explanation:

**Proposition:**L is a regular language M is a context free language

**Derivation:**L_c union M_c = complement{L intersection M} Now, L intersection M is a CFL according to closure laws of CFLs, i.e. intersection of a CFL with RL is always a CFL. But, complement{L intersection M} might not be a CFL because complement over CFL doesn't guarantee a CFL. It can even be a RL or it might even lie outside the CFL circle. It will be a context-sensitive language certainly, but nothing else can be said about it. Conclusion: Considering the above derivation, none of the statements are true. Hence correct answer would be (D) None of the above. Related article : http://quiz.geeksforgeeks.org/theory-of-computation-closure-properties-of-context-free-languages/ This solution is contributed by

**Vineet Purswani**.

Question 5 |

Which of the following statements is TRUE about the regular expression 01*0?

It represents a finite set of finite strings. | |

It represents an infinite set of finite strings. | |

It represents a finite set of infinite strings. | |

It represents an infinite set of infinite strings |

**Regular languages and finite automata**

**Gate IT 2005**

**Discuss it**

Question 5 Explanation:

First of all,

**A string can never be infinite**because String is a finite sequence of symbols over Σ So option (c) and (d) are eliminated. And because of star(*) it can generate infinite set. So**Option (B) is CORRECT.**This solution is contributed by**Abhishek Agrawal**.Question 6 |

The language {0

^{n}1^{n}2^{n}| 1 ≤ n ≤ 10^{6}} isregular | |

context-free but not regular. | |

context-free but its complement is not context-free. | |

not context-free |

**Regular languages and finite automata**

**Gate IT 2005**

**Discuss it**

Question 6 Explanation:

The value of ‘n’ is finite. So, only finite number of strings can be part of given language. Therefore, we can construct a finite state automata for this language.

Thus, option (A) is correct.

Please comment below if you find anything wrong in the above post.

Question 7 |

Which of the following expressions is equivalent to (A⊕B)⊕C

(A+B+C)(A¯+B¯+C¯) | |

(A+B+C)(A¯+B¯+C) | |

ABC+A¯(B⊕C)+B¯(A⊕C) | |

None |

**Digital Logic & Number representation**

**Gate IT 2005**

**Discuss it**

Question 7 Explanation:

(A ⊕ B) ⊕ C By Solving, We get = (A ⊕ B)′ C + (A ⊕ B) C′ The above expression can be written as: = (A ⊙ B) C + (A ⊕ B) C′ Now, = (AB + A′B′) C + (A ⊕ B) C′ = ABC + A′B′C + AB′C′ + A′BC′ [As: X + X = X] [So, A′B′C + A′B′C = A′B′C] = ABC + (A′B′C + A′B′C) + AB′C′ + A′BC′ This can be written as: = ABC + A′ (B ⊕ C) + B′ (A ⊕ C)This explanation has been provided by

**Saksham Seth.**

Question 8 |

Using Booth's Algorithm for multiplication, the multiplier -57 will be recoded as

0 -1 0 0 1 0 0 -1 | |

1 1 0 0 0 1 1 1 | |

0 -1 0 0 1 0 0 0
(A+B+C)(A¯+B¯+C)
ABC+A¯(B⊕C)+B¯(A⊕C) | |

0 1 0 0 -1 0 0 1 |

**Digital Logic & Number representation**

**Gate IT 2005**

**Discuss it**

Question 9 |

A dynamic RAM has a memory cycle time of 64 nsec. It has to be refreshed 100 times per msec and each refresh takes 100 nsec. What percentage of the memory cycle time is used for refreshing?

10 | |

6.4 | |

1 | |

.64 |

**Computer Organization and Architecture**

**Gate IT 2005**

**Discuss it**

Question 9 Explanation:

Memory cycle time = 64 ns Memory is refreshed 100 times per msec.

Number of refreshes in 1 memory cycle (i.e in 64 ns) = (100 * 64 * 10

^{-9}) / 10

^{-3}= 64 * 10

^{-4}.

Time taken for each refresh = 100 ns Time taken for 64 * 10

^{-4}refreshes = 64 * 10

^{-4}* 100 * 10

^{-9}sec = 64 * 10

^{-11}sec.

Percentage of the memory cycle time used for refreshing : = (Time taken to refresh in 1 memory cycle / Total time) * 100 = (64 * 10

^{-11}/ 64 * 10

^{-9}) * 100 = 1 %

Thus, option (C) is correct.

Please comment below if you find anything wrong in the above post.

Question 10 |

A two-way switch has three terminals a, b and c. In ON position (logic value 1), a is connected to b, and in OFF position, a is connected to c. Two of these two-way switches S1 and S2 are connected to a bulb as shown below.
Which of the following expressions, if true, will always result in the lighting of the bulb ?

S1.S2' | |

S1+S2 | |

(S1⊕S2)' | |

S1⊕S2 |

**Memory Management**

**Gate IT 2005**

**Discuss it**

Question 10 Explanation:

If we draw truth table of the above circuit,it'll be

**S1 S2 Bulb**0 0 On 0 1 Off 1 0 Off 1 1 On = (S1⊕ S2)'**Therefore answer is C**
There are 90 questions to complete.