Register
Filter

Answers by Prashant.

2 votes
83
Test by Bikram | Digital Logic | Test 2 | Question: 18
How many flip flops are required to construct a decade counter? $10$ $3$ $4$ $2$
How many flip flops are required to construct a decade counter?$10$$3$$4$$2$
4 votes
84
Test by Bikram | Digital Logic | Test 2 | Question: 8
Shifting a register content to left by one bit position is equivalent to: Division by two. Addition by two. Multiplication by two. Subtraction by two.
Shifting a register content to left by one bit position is equivalent to:Division by two.Addition by two.Multiplication by two.Subtraction by two.
6 votes
85
Test by Bikram | Digital Logic | Test 2 | Question: 30
The excess $3$ code of decimal number $26$ is: $0100 1001$ $01011001$ $1000 1001$ $01001101$
The excess $3$ code of decimal number $26$ is:$0100 1001$$01011001$$1000 1001$$01001101$
2 votes
86
Test by Bikram | Digital Logic | Test 2 | Question: 19
How many select lines will a $32:1$ multiplexer have? $5$ $8$ $9$ $11$
How many select lines will a $32:1$ multiplexer have?$5$$8$$9$$11$
3 votes
87
Test by Bikram | Digital Logic | Test 2 | Question: 15
The number of control lines for $16$ to $1$ multiplexer is ___. $2$ $4$ $3$ $5$
The number of control lines for $16$ to $1$ multiplexer is ___.$2$$4$$3$$5$
2 votes
88
Test by Bikram | Digital Logic | Test 2 | Question: 13
Which of the following combinations is sufficient to build a half adder? EX-OR gate and NOR gate. EX-OR gate and OR gate. EX-OR gate and AND gate. Four NAND gates.
Which of the following combinations is sufficient to build a half adder?EX-OR gate and NOR gate.EX-OR gate and OR gate.EX-OR gate and AND gate.Four NAND gates.
5 votes
89
Test by Bikram | Digital Logic | Test 2 | Question: 10
How many minimum number of two input AND gates and two input OR gates are required to realize $Y = BD+CE+AB$ ? $2, 2$ $4, 2$ $3, 2$ $2, 3$
How many minimum number of two input AND gates and two input OR gates are required to realize $Y = BD+CE+AB$ ?$2, 2$$4, 2$$3, 2$$2, 3$
2 votes
90
Test by Bikram | Digital Logic | Test 2 | Question: 23
Convert decimal $153$ to octal. Which of the following will be the equivalent in octal? $( 231)_8$ $( 331)_8$ $( 431)_8$ none of these
Convert decimal $153$ to octal. Which of the following will be the equivalent in octal?$( 231)_8$$( 331)_8$$( 431)_8$none of these
4 votes
91
Pointers
16 votes
92
DMA transfer rate
An 8-bit DMA device is operating is cycle stealing mode (single transfer mode). Each DMA cycle is of 6 clock states and DMA clock is 2MHz. Intermediate CPU machine cycle takes 2 microsecond, determine the DMA data transfer rate.
An 8-bit DMA device is operating is cycle stealing mode (single transfer mode). Each DMA cycle is of 6 clock states and DMA clock is 2MHz. Intermediate CPU machine cycle ...
2 votes
94
DMA madeeasy
Here device transfer rate is 416.7 us and cpu executing an instruction in .5 us. So how to decide the clock cycle time, to calculate the fraction of cpu slows down?
Here device transfer rate is 416.7 us and cpu executing an instruction in .5 us.So how to decide the clock cycle time, to calculate the fraction of cpu slows down?
2 votes
97
question bank
Consider the following statements: S1: Infinite union of regular languages can be context-free. S2: Language obtained after applying Kleen closure on a regular language will always be regular and infinite. Which of the above statement is true?
Consider the following statements:S1: Infinite union of regular languages can be context-free.S2: Language obtained after applying Kleen closure on a regular language wil...
2 votes
98
Eigen Vector
The number of linearly independent eigen vector of matrix A(3$\times$3) given as following a11=a22=2, a12=1, a13=a21=a23=a31=a32=0, a33=3
The number of linearly independent eigen vector of matrix A(3$\times$3) given as following a11=a22=2, a12=1, a13=a21=a23=a31=a32=0, a33=3
31 votes
99
GATE CSE 2007 | Question: 5
Consider the DAG with $V = \{1,2,3,4,5,6\}$ shown below. Which of the following is not a topological ordering? $1$ $2$ $3$ $4$ $5$ $6$ $1$ $3$ $2$ $4$ $5$ $6$ $1$ $3$ $2$ $4$ $6$ $5$ $3$ $2$ $4$ $1$ $6$ $5$
Consider the DAG with $V = \{1,2,3,4,5,6\}$ shown below.Which of the following is not a topological ordering?$1$ $2$ $3$ $4$ $5$ $6$$1$ $3$ $2$ $4$ $5$ $6$$1$ $3$ $2$ $4$...
7 votes
100
GATE CSE 1989 | Question: 3-v
Which of the following well-formed formulas are equivalent? $P \rightarrow Q$ $\neg Q \rightarrow \neg P$ $\neg P \vee Q$ $\neg Q \rightarrow P$
Which of the following well-formed formulas are equivalent?$P \rightarrow Q$$\neg Q \rightarrow \neg P$$\neg P \vee Q$$\neg Q \rightarrow P$
38 votes
102
GATE CSE 1989 | Question: 3-ii
Context-free languages and regular languages are both closed under the operation (s) of : Union Intersection Concatenation Complementation
Context-free languages and regular languages are both closed under the operation (s) of :UnionIntersectionConcatenationComplementation
4 votes
103
Find output
39 votes
104
GATE CSE 1989 | Question: 2-ii
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{Base addressing} & \text{(p)} & \text{Reentranecy} \\\hline \text{(B)} & \text...
27 votes
105
GATE CSE 1989 | Question: 2-iv
Match the pairs in the following: ...
Match the pairs in the following:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{Virtual memory} & \text{(p)} & \text{ Temporal Locality} \\\hline \text{(B)} & \text{Sha...
7 votes
106
GATE CSE 1989 | Question: 2-iii
Match the pairs in the following: ... 2)$} &\text{(s)} & \text{Selection of the $k^{th}$ smallest element in a set of $n$ elements} \\\hline \end{array}$
Match the pairs in the following:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(p)} & \text{Heapsort} \\\hline \text{(B)} & \text{$O (n)$} & \tex...
24 votes
107
GATE CSE 1990 | Question: 1-viii
The condition for overflow in the addition of two $2's$ complement numbers in terms of the carry generated by the two most significant bits is ___________.
The condition for overflow in the addition of two $2's$ complement numbers in terms of the carry generated by the two most significant bits is ___________.
15 votes
108
GATE CSE 1989 | Question: 1-iv
The transitive closure of the relation $\left\{(1, 2), (2, 3), (3, 4), (5, 4)\right\}$ on the set $\left\{1, 2, 3, 4, 5\right\}$ is ___________.
The transitive closure of the relation $\left\{(1, 2), (2, 3), (3, 4), (5, 4)\right\}$ on the set $\left\{1, 2, 3, 4, 5\right\}$ is ___________.
Page: