GATE CS 2010 — Question 35
Let \(L = \{w \in (0+1)^* \mid w\) has an even number of 1s\(\}\), i.e. \(L\) is the set of all bit strings with an even number of 1s. Which one of the regular expressions below represents \(L\)?
Year-wise GATE papers
GATE 2010
6 questions and papers
GATE CS 2010 — Question 35
The following C function takes a singly linked list as an input argument. It modifies the list by moving the last element to the front of the list…
GATE CS 2010 — Question 26
Consider a company that assembles computers. The probability of a faulty assembly of any computer is \(p\). The company therefore subjects each computer to a testing process. This…
GATE CS 2010 – Question 42
A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in…
GATE CS 2010 — Question 22
What is the value of \(\displaystyle\lim_{n \to \infty}\left(1 - \frac{1}{n}\right)^{2n}\) ?
GATE CS 2010 — Question 6
The minterm expansion of \(f(P,Q,R) = PQ + Q\overline{R} + P\overline{R}\) is:
Answers and explanations unlock on sign-in
Every question here is free to read. A free account adds the verified key, the worked solution and your progress.