# Recent questions and answers in Digital Logic

If some T FFs are connected in series. The 1st FF is supplied by a clock with frequency 1 MHz and the last FF signal out is 31.25 KHz. Find the number of the Flip Flops are used in the circuit.
Consider the following counter. If the initial states of Q0(MSB) and Q1(LSB) are 0. What is the sequence Q0 Q1 given by the following diagram?
A ⊕ B can be represented using 4 NAND gates as well as 5 NAND gates. Is there any predefined procedure to find the minimum number of NAND gate required by an expression?
F(A,B,C)= A’+BC’ is functionally complete but how to derive AND(.) without using 1 or 0.
Maximum how many number of functions are possible so that F(x,y,z) = F(x,y’,z) ?
1 vote
Is the number of min terms always equal to the number of max terms , for a boolean function? Can we say that for a boolean function to be self dual, should satisfy the above condition as well as no mutual exclusive terms should be present?
For implementing Boolean function F (A, B, C, D) = Σm (0, 1, 2, 4, 6, 9, 12, 14) using 8:1 multiplexer with select lines as B, C and D. Which of the following is correct? I0 and I2 are A̅ I0 and I2 are A I1, I3, and I4 are connected to A̅ I5, I6, and I7 are connected to 0
how did the range of 2’s complement is -2^(n-1) to (2^(n-1) -1)? particularly for the lower limit?
Design a synchronous binary counter having the repeated binary sequence 0,2,4,6, 8, 10, 12, 14 using D flip-flops.
"GATE CSE 2000 | Question: 1.6 - GATE Overflow" https://gateoverflow.in/629/gate-cse-2000-question-1-6 In question above we understood that positive number and unsigned is represented same as in 2's complement. here in question below the hex number is unsigned because sign ... will be same as number given is positive(bcoz msb is not 7). Determine 8's compliment of an octal number 2670? Right??
is mod 1 counter possible?
What will be the dual of the following expression? A + B’.[C’+D(E+F’)]
WHICH OF THE FOLLOWING INDICATES 8`s COMPLEMENT OF $[70700]_8$ IN SIX DIGIT? $[707100]_8$ $[007100]_8$ $[707078]_8$ $[007078]_8$
1 vote
Consider the following Boolean valued function on n Boolean variables: f(x1, ,xn)=x1+⋯+xn(mod 2), where addition is over integers, mapping FALSE' to 0 and TRUE' to 1. Consider Boolean circuits (with no feedback) that use only logical AND and OR gates, and where each gate has two input bits, each ... n) is : 2^o(logn) n^c, for some fixed constant c n^ω(1), but n^O(logn) 2^Θ(n) None of the others
The format of the single-precision floating point representation of a real number as per the $\text{IEEE 754}$ ... $=00000000$ and mantissa $=0000000000000000000000001$ exponent $=00000001$ and mantissa $=0000000000000000000000000$ exponent $=00000001$ and mantissa $=0000000000000000000000001$
Which one of the following circuits implements the Boolean function given below? $f(x,y,z) = m_0+m_1+m_3+m_4+m_5+m_6$, where $m_i$ is the $i^{\text{th}}$ minterm.
If $x$ and $y$ are two decimal digits and $(0.1101)_2 = (0.8xy5)_{10}$, the decimal value of $x+y$ is ___________
If the numerical value of a $2$-byte unsigned integer on a little endian computer is $255$ more than that on a big endian computer, which of the following choices represent(s) the unsigned integer on a little endian computer? $0\text{x}6665$ $0\text{x} 0001$ $0\text{x} 4243$ $0\text{x} 0100$
Consider a Boolean function $f(w,x,y,z)$ such that $\begin{array}{lll} f(w,0,0,z) & = & 1 \\ f(1,x,1,z) & =& x+z \\ f(w,1,y,z) & = & wz +y \end{array}$The number of literals in the minimal sum-of-products expression of $f$ is _________
1 vote
Let the representation of a number in base $3$ be $210$. What is the hexadecimal representation of the number? $15$ $21$ $\text{D}2$ $528$
Consider the following representation of a number in $\text{IEEE 754}$ single-precision floating point format with a bias of $127$.$S: 1\quad\quad E:\; 10000001\quad\quad F:\;11110000000000000000000$ Here $S, \;E$ and $F$ denote the ... components of the floating point representation. The decimal value corresponding to the above representation (rounded to $2$ decimal places) is ____________.
1 vote
Consider a $3$-bit counter, designed using $T$ flip-flops, as shown below: Assuming the initial state of the counter given by $\text{PQR}$ as $000$, what are the next three states? $011,101,000$ $001,010,111$ $011,101,111$ $001,010,000$
Consider the following Boolean expression. $F=(X+Y+Z)(\overline X +Y)(\overline Y +Z)$ Which of the following Boolean expressions is/are equivalent to $\overline F$ (complement of $F$)? $(\overline X +\overline Y +\overline Z)(X+\overline Y)(Y+\overline Z)$ $X\overline Y + \overline Z$ $(X+\overline Z)(\overline Y +\overline Z)$ $X\overline Y +Y\overline Z + \overline X \overline Y \overline Z$
Explain me this question with boolean function form.(not k map)
Explain me this question.
How can we minimize this function? Ans(d)
1 vote
This question is from GATE 2019- Instrumentation branch (Digital logic) Can anyone solve this and can explain what is meant by steady state? Ans: 4
1 vote
Let A=1111 10101010 and B=0000 10101010 be two 8-bit 2′s complement numbers. Their product in 2′s complement is
Consider the unsigned 8-bit fixed point binary number representation below b7 b6 b5 b4 b3 . b2 b1 b0 where the position of the binary point is between b3 and b2. Assume b7 is the most significant bit. Some of the decimal numbers listed below cannot be represented exactly in the above representation: (i) 31.500 (ii) 0.875 (iii) 12.100 (iv) 3.001
1 vote
MSQ Type question.
A flipflop has 3 ns delay from the time the clock edge occurs to the time the output is complemented. What is the maximum frequency at which mod-1024 counter can operate reliably? 33 MHz 40 MHz 33.3 MHz 10 MHz
#digital ckts number system GRE QUESTION Given ans is D... Post the detailed solution
2’s complement representation for (12121) base 3 ? 10010111 base 2 01011011 base 2 01011111 base 2 01011010 base 2