Recent questions tagged digital-logic

+2 votes

3 answers

1

GATE2020-CS-19
A multiplexer is placed between a group of $32$ registers and an accumulator to regulate data movement such that at any given point in time the content of only one register will move to the accumulator. The number of select lines needed for the multiplexer is ______.

asked Feb 12 in Digital Logic by Arjun Veteran (436k points) | 890 views

+2 votes

4 answers

2

GATE2020-CS-20
If there are $m$ input lines $n$ output lines for a decoder that is used to uniquely address a byte addressable $1$ KB RAM, then the minimum value of $m+n$ is ________ .

asked Feb 12 in Digital Logic by Arjun Veteran (436k points) | 1.2k views

+2 votes

3 answers

3

GATE2020-CS-28
Consider the Boolean function $z(a,b,c)$. Which one of the following minterm lists represents the circuit given above? $z=\sum (0,1,3,7)$ $z=\sum (1,4,5,6,7)$ $z=\sum (2,4,5,6,7)$ $z=\sum (2,3,5)$

asked Feb 12 in Digital Logic by Arjun Veteran (436k points) | 884 views

+1 vote

1 answer

4

TIFR2020-B-3
Consider the (decimal) number $182,$ whose binary representation is $10110110.$ How many positive integers are there in the following set?$\{n\in \mathbb{N}:n\leq 182\:\text{and n has exactly four ones in its binary representation}\}$ $91$ $70$ $54$ $35$ $27$

asked Feb 11 in Digital Logic by Lakshman Patel RJIT Veteran (61.4k points) | 75 views

+3 votes

2 answers

5

ISRO2020-66
The following circuit compares two $2$-bit binary numbers, $X$ and $Y$ represented by $X_1X_0$ and $Y_1Y_0$ respectively. ($X_0$ and $Y_0$ represent Least Significant Bits) Under what conditions $Z$ will be $1$? $X>Y$ $X<Y$ $X=Y$ $X!=Y$

asked Jan 13 in Digital Logic by Satbir Boss (25.5k points) | 469 views

+1 vote

1 answer

6

ISRO2020-52
To send same bit sequence, NRZ encoding require Same clock frequency as Manchester encoding Half the clock frequency as Manchester encoding Twice the clock frequency as Manchester encoding A clock frequency which depends on number of zeroes and ones in the bit sequence

asked Jan 13 in Digital Logic by Satbir Boss (25.5k points) | 225 views

+1 vote

1 answer

7

ISRO2020-80
A new flipflop with inputs $X$ and $Y$ ... $(X\wedge \overline{Q })\vee (Y \wedge Q)$ $(X\wedge \overline{Q })\vee (\overline{Y } \wedge Q)$

asked Jan 13 in Digital Logic by Satbir Boss (25.5k points) | 199 views

+2 votes

3 answers

8

ISRO2020-12
If $ABCD$ is a $4$-bit binary number, then what is the code generated by the following circuit? BCD code Gray code $8421$ code Excess-$3$ code

asked Jan 13 in Digital Logic by Satbir Boss (25.5k points) | 247 views

+1 vote

2 answers

9

ISRO2020-11
Minimum number of NAND gates required to implement the following binary equation $Y = (\bar{A}+\bar{B})(C+D)$ $4$ $5$ $3$ $6$

asked Jan 13 in Digital Logic by Satbir Boss (25.5k points) | 311 views

+1 vote

3 answers

10

ISRO2020-77
Consider the following circuit The function by the network above is $\overline{AB}E+EF+\overline{CD}F$ $(\overline{E}+AB\overline{F})(C+D+\overline{F})$ $(\overline{AB}+E)(\overline{E}+\overline{F})(C+D+\overline{F})$ $(A+B)\overline{E} +\overline{EF}+CD\overline{F}$

asked Jan 13 in Digital Logic by Satbir Boss (25.5k points) | 225 views

+1 vote

2 answers

11

ISRO2020-10
Following Multiplexer circuit is equivalent to Sum equation of full adder Carry equation of full adder Borrow equation for full subtractor Difference equation of a full subtractor

asked Jan 13 in Digital Logic by Satbir Boss (25.5k points) | 201 views

+1 vote

2 answers

12

ISRO2020-9
In a $8$-bit ripple carry adder using identical full adders, each full adder takes $34$ns for computing sum. If the time taken for $8$-bit addition is $90$ ns, find time taken by each full adder to find carry. $6$ ns $7$ ns $10$ ns $8$ ns

asked Jan 13 in Digital Logic by Satbir Boss (25.5k points) | 232 views

+3 votes

3 answers

13

ISI2017-DCG-10
The value of the Boolean expression (with usual definitions) $(A’BC’)’ +(AB’C)’$ is $0$ $1$ $A$ $BC$

asked Sep 18, 2019 in Digital Logic by gatecse Boss (17.7k points) | 175 views

+3 votes

1 answer

14

Digital logic- nptel assignment
Suppose we are using 4-bit carry lookahead adder modules to build a 64- bit adder with two-level carry lookahead, with ripple carry between the modules. If the delay of a basic gate (AND, OR, NOT) is 2 nanoseconds, the worst-case delay of the 64-bit adder will be ……….. nanoseconds.

asked Aug 13, 2019 in Digital Logic by ajaysoni1924 Boss (11.1k points) | 255 views

+2 votes

1 answer

15

Logic Gates and switching circuits
The gates G1 & G2 in the figure have propagation delays of 10ns and 20ns respectively. If the input Vi makes an abrupt change from logic 0 to 1 at time t=t0 , then what's the output waveform V0 is ? Also please explain how to handle such kinds of questions of waveform?

asked Jun 14, 2019 in Digital Logic by Gitika Babbar (157 points) | 366 views

0 votes

4 answers

16

Minimization doubt in DIGITAL LOGIC

asked Jun 14, 2019 in Digital Logic by Gitika Babbar (157 points) | 139 views

0 votes

2 answers

17

Gray Code (Self Doubt)
Was solving the GO 2019 pdf when I encountered this question asked in TIFR 2017. Although I have understood this question, I have one doubt- It is mentioned in the question that for a 3-bit number, the ordering (000, 100, 101, 111, 110, 010, 011, 001) is one of the possible Gray codes. Then, how many such orders are there for an n-bit number?

asked Jun 13, 2019 in Digital Logic by Debargha Bhattacharj Junior (867 points) | 156 views

0 votes

0 answers

18

MADE EASY ELECTRONICS
The number of Essential Prime implicants are ______________.

asked May 25, 2019 in Digital Logic by Hirak Active (3.7k points) | 161 views

0 votes

1 answer

19

carry look ahead adder vs ripple carry
$Exclusive-OR$ gate has a propagation delay of $10$ ns and that the $AND$ or $OR$ gates have a propagation delay of $5$ ns.What is the total propagation delay time in the four-bit adder.Assume $FAN-IN =2$ $1)$ ripple adder $2)$ carry look ahead adder

asked May 16, 2019 in Digital Logic by val_pro20 Active (1.2k points) | 168 views

+1 vote

1 answer

20

Made Easy Test Series:Flip-Flop
A Finite State Machine(FSM) is implemented using the D-FFs A and B with logic gates as shown below. The four possible states of FSM are $Q_{A}Q_{B}=00,01,10,11$. Assume that $X_{in}$ is held at constant logic level throughout the operation of FSM. ... states if $X_{in}=0$ How do we check $X_{in}$ here? Can we check it arbitrarily, or checked with prev states??

asked May 16, 2019 in Digital Logic by srestha Veteran (120k points) | 154 views

+4 votes

3 answers

21

GateBook Test Series: Digital Logic - Boolean Algebra
What is the time complexity for checking whether an assignment of truth values to variables $x_1,\dots ,x_n$ satisfies a given formula $f(x_1\dots,x_n)$? $O(2^n)$ $O(g(n))$ where $g$ is a polynomial $O(log(n))$ None of the above

asked May 15, 2019 in Digital Logic by val_pro20 Active (1.2k points) | 290 views

0 votes

1 answer

22

Made Easy Test Series: Digital Logic- Master Slave FF
$1)$ Master-Slave FF is designed to avoid race around condition $2)$ Master-Slave FF is used to store $2$ bit information Which of the following statement is correct? What is meaning of $2-bit $ information??

asked May 15, 2019 in Digital Logic by srestha Veteran (120k points) | 179 views

+1 vote

2 answers

23

Made Easy Test Series: Digital Logic
A $3\times 8$ decoder with $2$ enable inputs is used to address $8$ block of memory. What will be the size of each memory block when addressed from a $16$ bit bus with $2$ MSB’s used to enable the decoder?

asked May 15, 2019 in Digital Logic by srestha Veteran (120k points) | 182 views

+2 votes

1 answer

24

Boolean algebra-digital logic
$(a) A = 101010$ and $B = 011101$ are $1’s$ complement numbers. Perform the following operations and indicate whether overflow occurs. $(i) A + B$ $(ii) A − B$ $(b)$ Repeat part $(a)$ assuming the numbers are $2’s$ complement numbers.

asked May 11, 2019 in Digital Logic by val_pro20 Active (1.2k points) | 163 views

0 votes

1 answer

25

BOOLEAN FUNCTION (Morris Mano)

asked May 6, 2019 in Digital Logic by altamash (453 points) | 72 views

+2 votes

4 answers

26

Boolean algebra expression Floyd Digital Logic
Simplify the following expression AB’C + A’BC + A’B’C Solution given is A’C + B’C can someone show me how?

asked May 2, 2019 in Digital Logic by vupadhayayx86 Active (1.7k points) | 243 views

0 votes

1 answer

27

Test Book digital logic
I think option A is also correct ! if we take minterm and complement it to get POS then option A can also be the answer

asked Apr 9, 2019 in Digital Logic by Shawn Frost (35 points) | 96 views

0 votes

0 answers

28

Morris Mano Edition 3 Exercise 9 Question 24 (Page No. 396)
The boolean functions for the input of SR latch are as follows. Obtain the circuit diagram using a minimum number of NAND gates. $S = x _1’x _2’x _3 + x _1x _2x _3$. $R = x _1x _2’ + x _2x _3’$

asked Apr 8, 2019 in Digital Logic by ajaysoni1924 Boss (11.1k points) | 64 views

0 votes

0 answers

29

Morris Mano Edition 3 Exercise 9 Question 23 (Page No. 396)
Draw the logic diagram of the product of sum expression $ Y = (x _1 + x _2’)(x _2 + x _3)$ Show that there is a static 0 hazard when $x _1$ and $x _3$ is equal to zero and $x _2$ goes from 0 to 1.Find a way to remove hazard by adding one more OR gate.

asked Apr 8, 2019 in Digital Logic by ajaysoni1924 Boss (11.1k points) | 36 views

0 votes

0 answers

30

Morris Mano Edition 3 Exercise 9 Question 22 (Page No. 396)
Find a circuit that has no static hazard and implements the boolean function: F(A,B,C,D) = $\sum(0,2,6,7,8,10,12)$

asked Apr 8, 2019 in Digital Logic by ajaysoni1924 Boss (11.1k points) | 44 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged digital-logic

Recent Posts

Recent Blog Comments