Register
Filter

Recent activity by varunraj

3 answers
3
GATE IT 2005 | 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$ $0$ $1$ $0$ $0$ -$1$ $0$ $0$ $1$
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$ ...
1 answer
5
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...
1 answer
8
About 90+ marks in gate cs
Why hasn't anyone got 90+ marks in the GATE-CS till now ?Is there any possibility to score more than 90+ marks in CS ?what are the ways to achieve it ,while other branch people are achieving?
Why hasn't anyone got 90+ marks in the GATE-CS till now ?Is there any possibility to score more than 90+ marks in CS ?what are the ways to achieve it ,while other branch ...
1 answer
10
theory of computation
$\text{Recursive languages are also called type 0 languages. state true or false with explanation}$
$\text{Recursive languages are also called type 0 languages. state true or false with explanation}$
1 answer
11
theory of computation
Let $L=\{w \in \{0,1\}^∗\mid \text{number of occurences of }(110)=\text{number of occurences of } (011)\}$ What is $L$?
Let $L=\{w \in \{0,1\}^∗\mid \text{number of occurences of }(110)=\text{number of occurences of } (011)\}$What is $L$?
1 answer
12
Gate2018_model_paper
What's is correct answer and how did u find it?
What's is correct answer and how did u find it?
3 answers
13
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}$
3 answers
14
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
2 answers
15
finite automata
Draw the DFA for (a*b +b*a)
Draw the DFA for (a*b +b*a)
2 answers
16
theory of computation
Let L = {anbn : n ≥ 0}...Is complement of the language L , DCFL or not ??? please explain your answer ...I feel it is a DCFL ...
Let L = {anbn : n ≥ 0}...Is complement of the language L , DCFL or not ??? please explain your answer ...I feel it is a DCFL ...
14 answers
17
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...
6 answers
21
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...
7 answers
22
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)^*$
4 answers
23
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...
8 answers
24
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^*$$...