Register
Filter

Answers by varunraj

0 votes
2
Digital Logic: GATE 2013 EE
The clock frequency applied to the digital circuit shown in the figure below is 1 kHz. If the initial state of the output Q of the flip-flop is ‘0’, then the frequency of the output waveform Q in kHz is 0.25 0.5 1 2
The clock frequency applied to the digital circuit shown in the figure below is 1 kHz. If the initial state of the output Q of the flip-flop is ‘0’, then the frequenc...
11 votes
4
GATE CSE 1987 | Question: 12-a
The Boolean expression $A \oplus B \oplus A$ is equivalent to $AB + \overline {A}\;\;\overline B$ $\overline{A}\;B+A\;\overline{B}$ $B$ $\overline{A}$
The Boolean expression $A \oplus B \oplus A$ is equivalent to$AB + \overline {A}\;\;\overline B$$\overline{A}\;B+A\;\overline{B}$$B$$\overline{A}$
5 votes
5
GATE CSE 1987 | Question: 16-a
A Boolean function $f$ is to be realized only by $\text{NOR}$ gates. Its $K$-map is given below: The realization is
A Boolean function $f$ is to be realized only by $\text{NOR}$ gates. Its $K$-map is given below:The realization is
13 votes
6
GATE CSE 2012 | Question: 12
What is the complement of the language accepted by the NFA shown below? Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string. $\phi$ $\{\epsilon\}$ $a^*$ $\{a , \epsilon\}$
What is the complement of the language accepted by the NFA shown below?Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string.$\phi$$\{\epsilon\}$$a^*$$\{a , \epsilon...
1 votes
10
which one is correct ?
Consider R1 and R2 are two regular expression then equality of two regular expression compute in A) polynomial time  B) Exponential time C) logarithmic Polynomial time  D) Constant Time
Consider R1 and R2 are two regular expression then equality of two regular expression compute inA) polynomial time  B) Exponential timeC) logarithmic Polynomial time  D...
1 votes
11
GATE CSE 1998 | Question: 1.12
The string $1101$ does not belong to the set represented by $110^*(0 + 1)$ $1(0 + 1)^*101$ $(10)^*(01)^*(00 + 11)^*$ $(00 + (11)^*0)^*$
The string $1101$ does not belong to the set represented by$110^*(0 + 1)$$1(0 + 1)^*101$$(10)^*(01)^*(00 + 11)^*$$(00 + (11)^*0)^*$
27 votes
12
GATE CSE 2014 Set 1 | Question: 36
Which of the regular expressions given below represent the following DFA? $0^*1(1+00^*1)^* $ $0^*1^*1+11^*0^*1 $ $(0+1)^*1$ I and II only I and III only II and III only I, II and III
Which of the regular expressions given below represent the following DFA?$0^*1(1+00^*1)^* $$0^*1^*1+11^*0^*1 $$(0+1)^*1$I and II onlyI and III onlyII and III onlyI, II an...
21 votes
13
GATE CSE 1997 | Question: 6.4
Which one of the following regular expressions over $\{0,1\}$ denotes the set of all strings not containing $\text{100}$ as substring? $0^*(1+0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$
Which one of the following regular expressions over $\{0,1\}$ denotes the set of all strings not containing $\text{100}$ as substring?$0^*(1+0)^*$$0^*1010^*$$0^*1^*01^*$$...