The range of Excess-8 code is from ______ to ______
- A+7 to -8
- B+8 to -7
- C+9 to -8
- D-9 to +8
With 4 bits and an offset of 8, codes 0000 to 1111 represent -8 to +7.
Syllabus: lectures 1–22. Past-paper MCQs are shown first.Syllabus: lecture 1–22. Past paper ki MCQs pehle dikhai gayi hain.
160 MCQs · 94 short · 46 long questions · 160 MCQs from past papers160 MCQs · 94 short · 46 long sawal · 160 MCQs past papers se
The range of Excess-8 code is from ______ to ______
With 4 bits and an offset of 8, codes 0000 to 1111 represent -8 to +7.
The Gray code is different from the unsigned binary code because ________
Adjacent Gray code values change in only one bit.
Two 2-bit comparator circuits can be connected to form a single 4-bit comparator
With external logic two 2-bit comparators can be cascaded into a 4-bit comparator.
The output A < B is set to 1 when the input combination is __________
Only A=01 (1) and B=10 (2) has A less than B.
A comparator circuit has multiple inputs and ______ outputs
A magnitude comparator gives three outputs: A>B, A=B and A<B.
The function to be performed by the processor is selected by a set of inputs known as ________
An ALU's operation is chosen by its function select inputs.
3-to-8 decoder can be used to implement Standard SOP and POS Boolean expressions
Each decoder output is a minterm, so ORing (or NORing/NANDing) selected outputs gives standard SOP or POS functions.
How many data select lines are required for selecting eight inputs?
2^3 = 8, so three select lines are needed.
Using a multiplexer as a parallel to serial converter requires ___________ connected to the multiplexer
A counter drives the select lines so the parallel inputs are output one after another.
The main use of the Multiplexer is to
A multiplexer selects one of several inputs and sends it to one output.
Two 2-input, 4-bit multiplexers 74X157 can be connected to implement a ____ multiplexer.
With a common select line, two 4-bit units side by side switch two 8-bit inputs.
8-bit parallel data can be converted into serial data by using ________ multiplexer
An 8-to-1 multiplexer with a counter on its select lines outputs the 8 bits one at a time.
________ Dual, 4-input multiplexer can be connected to form a 16-input multiplexer.
A 16-input MUX needs four 4-input MUXes, which is two dual 4-input (74X153) chips.
A multiplexer circuit has ______ input(s) and ______ output(s).
A MUX selects one of many data inputs onto a single output.
A demultiplexer has
A demultiplexer routes one data input to one of several outputs.
Demultiplexer has
A demultiplexer routes one data input to one of several outputs.
The ABEL symbol for OR operation is
In ABEL # is OR, & is AND, ! is NOT and $ is XOR.
All the ABEL equations must end with ________
Every ABEL equation is terminated by a semicolon.
In ABEL the variable 'A' is treated separately from variable 'a'
ABEL is case sensitive.
Which of the following is a symbol of OR operation in ABEL?
In ABEL # is OR, & is AND and ! is NOT.
If an active-HIGH S-R latch has a 0 on the S input and a 1 on the R input and then the R input goes to 0, the latch will be ________.
S=0, R=1 resets the latch and S=R=0 then holds the reset state.
An S-R latch can be implemented by using _________ gates
S-R latches are built from cross-coupled NOR gates or NAND gates.
The maximum number that can be represented using the unsigned octal system is _______
Octal digits run from 0 to 7, so the largest digit is 7.
The 3-variable Karnaugh Map (K-Map) has _______ cells for min or max terms
A K-map has 2^n cells, so 3 variables give 8 cells.
A particular Full Adder has
A full adder takes A, B and carry-in and gives sum and carry-out.
For a 3-to-8 decoder how many 2-to-4 decoders will be required?
Two 2-to-4 decoders, enabled by the third input and its complement, give 8 outputs.
GAL is an acronym for ________.
GAL stands for Generic Array Logic.
The Quad Multiplexer has _____ outputs
A quad multiplexer contains four multiplexers, each with one output.
A.(B.C) = (A.B).C is an expression of __________
Regrouping the variables of an AND operation is the associative law.
2's complement of any binary number can be calculated by
The 2's complement is the 1's complement plus 1.
The binary value 1010110 is equivalent to decimal __________
64 + 16 + 4 + 2 = 86.
A NOR gate's output is HIGH if
NOR is the complement of OR, so it is 1 only when all inputs are 0.
The difference of 111 - 001 equals
7 - 1 = 6 = 110.
Which gate is best used as a basic comparator?
An XOR gate outputs 1 only when its two input bits differ, so it compares bits.
The Extended ASCII Code (American Standard Code for Information Interchange) is a _____ code
Extended ASCII adds an eighth bit to the 7-bit ASCII code.
The AND Gate performs a logical __________ function
AND is Boolean multiplication.
NOR gate is formed by connecting _________
NOR is an OR gate followed by an inverter.
Generally, the Power dissipation of _______ devices remains constant throughout their operation.
TTL power is nearly constant, while CMOS power rises with switching frequency.
The GAL22V10 has ____ inputs
The 22 in GAL22V10 is the maximum number of inputs.
Sum-of-Weights method is used __________
Sum of weights converts a number to decimal by adding digit values times positional weights.
Circuits having a bubble at their outputs are considered to have an active-low output.
A bubble on an output means the output is active-low.
Which one is true:
CMOS draws very little static power, so TTL consumes more.
A SOP expression is equal to 1 ______________
An OR of product terms is 1 when any product term is 1.
High level Noise Margin (VNH) of CMOS 5 volt series circuits is _____________
VNH = VOH(min) - VIH(min) = 4.4 V - 3.5 V = 0.9 V.
The output of the expression F=A+B+C will be Logic ________ when A=0, B=1, C=1. The symbol '+' here represents OR Gate.
An OR output is 1 when any input is 1.
3.3 V CMOS series is characterized by __________ and _________ as compared to the 5 V CMOS series.
The lower-voltage 3.3 V CMOS series switches faster and dissipates less power.
The _______ Encoder is used as a keypad encoder.
A decimal-to-BCD priority encoder converts the pressed key 0-9 into its BCD code.
NOT gate level, AND gate level, OR gate level: the diagram above shows the general implementation of ________ form
Inverters feeding AND gates whose outputs feed an OR gate implement a sum of products.
The expression _________ is an example of Commutative Law for Multiplication.
Swapping the order of ANDed variables is the commutative law of multiplication.
In the binary number 10011 the weight of the most significant digit is ____
The MSB of a 5-bit number is in position 4, weight 2^4 = 16.
A latch has _____ stable states
A latch is bistable: set and reset.
Sequential circuits have storage elements
Sequential circuits use memory elements (latches, flip-flops).
GAL can be reprogrammed because instead of fuses _______ logic is used in it
GALs use electrically erasable CMOS (E2CMOS) cells instead of fuses.
If 1110 is applied at the input of a BCD-to-Decimal decoder which output pin will be activated:
1110 is not a valid BCD code, so no decimal output is activated.
Half-Adder Logic circuit contains 2 XOR Gates
A half adder has one XOR gate (sum) and one AND gate (carry).
A Karnaugh map is similar to a truth table because it presents all the possible values of input variables and the resulting output of each value.
Each K-map cell corresponds to one row of the truth table.
The 4-variable Karnaugh Map (K-Map) has _______ cells for min or max terms
2^4 = 16 cells.
The decimal 8 is represented as _________ using Gray-Code.
Binary 1000 converts to Gray 1100 (MSB kept, then XOR of adjacent bits).
(A+B).(A+C) = ___________
By the distributive rule, (A+B)(A+C) = A + BC.
A.(B + C) = A.B + A.C is the expression of _________________
Multiplying A over the sum is the distributive law.
NOR Gate can be used to perform the operation of AND, OR and NOT Gate
NOR is a universal gate.
The ASCII Code (American Standard Code for Information Interchange) is a _____ code
Standard ASCII is a 7-bit code (128 characters).
Which of the numbers is not a representative of the hexadecimal system
H is not a hexadecimal digit (only 0-9 and A-F).
The Unsigned Binary representation can only represent positive binary numbers
Unsigned binary has no sign bit, so it represents only non-negative values.
The values that exceed the specified range can not be correctly represented and are considered as ________
A result outside the representable range is an overflow.
The 4-bit 2's complement representation of -7 is _____________
+7 = 0111; inverting gives 1000 and adding 1 gives 1001.
The output of an AND gate is one when _______
AND outputs 1 only when every input is 1.
A BCD to 7-Segment decoder has
It takes a 4-bit BCD digit and drives seven segments a-g.
The PROM consists of a fixed non-programmable ____________ Gate array configured as a decoder.
A PROM has a fixed AND array (a decoder) and a programmable OR array.
The binary value "11011" is equivalent to __________
11011 = 0001 1011 = 1B hex (27 decimal).
An important application of AND Gate is its use in counter circuit
An AND gate acts as an enable gate that passes pulses to a counter only during a set interval (frequency counter).
The OR Gate performs a Boolean _______ function
OR is Boolean addition.
TTL based devices work with a dc supply of ____ Volts
Standard TTL operates from a +5 V supply.
A standard POS form has __________ terms that have all the variables in the domain of the expression.
A standard POS is a product of sum terms each containing every variable.
A SOP expression having a domain of 3 variables will have a truth table having ____ combinations of inputs and corresponding output values.
Three variables give 2^3 = 8 combinations.
Consider a circuit consisting of two consecutive NOT gates, the entire circuit belongs to a CMOS 5 Volt series, if certain voltage is applied on the input, the output voltage of Logic high signal (VoH) will be in the range of _______ volts.
CMOS 5 V outputs a high level close to the supply, between about 4.4 V and 5 V.
The 4-bit 2's complement representation of "+5" is _____________
A positive number in 2's complement is its plain binary value, 0101.
The ABEL notation equivalent to Boolean expression A+B is:
# is the ABEL OR operator.
A NAND gate's output is LOW if
NAND is the inverse of AND, so it is LOW only when all inputs are HIGH.
One advantage TTL has over CMOS is that TTL is
CMOS inputs can be damaged by static charge while TTL is not sensitive to it.
Fan-out is specified in terms of
Fan-out is the number of standard (unit) loads an output can drive.
The power dissipation, PD, of a logic gate is the product of the
PD = VCC x ICC(average).
To get the answer “1” in Boolean addition of three variables, ________
Boolean addition (OR) gives 1 when at least one variable is 1.
________ is invalid number of cells in a single group formed by the adjacent cells in K-map
K-map groups must contain a power of 2 cells, and 12 is not a power of 2.
Consider A=1, B=0, C=1. A, B and C represent the input of three bit NAND gate the output of the NAND gate will be _____
A.B.C = 0 because B = 0, so the NAND output is 1.
The Binary number 1011.101 has an Integer part represented by _____ and a fraction part ____ separated by a decimal point.
Digits left of the point (1011) are the integer part and digits right of it (101) are the fraction.
1011 + 101 = ______
1011 (11) + 101 (5) = 16 = 10000 in binary.
Adding two octal numbers “36” and “71” result in ________
6+1 = 7; 3+7 = 10 decimal = 12 octal, so the sum is 127 (octal).
The first Least Most digit in decimal number system has
The least significant decimal digit is at position 0 with weight 10^0 = 1.
Sum term (Max term) is implemented using ________ gates
A sum term is a Boolean sum (OR) of literals.
The three fundamental gates are ___________
NOT, OR and AND are the basic gates from which all others are built.
The 4-variable K-Map has ________ rows and ___________ columns of cells.
A 4-variable map has 16 cells in 4 rows and 4 columns.
NAND gate is form by connecting _________
NAND is an AND gate whose output is inverted by a NOT gate.
2's complement of 5 is
5 = 0101; inverting gives 1010 and adding 1 gives 1011.
The Decimal-to-BCD Encoder has _______ outputs
It has 10 inputs (digits 0-9) and 4 outputs (the BCD code).
In a 4-variable K-map, a 2-variable product term is produced by
A 4-cell group of 1s eliminates 2 of the 4 variables, leaving a 2-variable term.
A 5-variable karnaugh map has
A 5-variable map has 2^5 = 32 cells.
The boolean expression (A + C)(AB' + AC)(A'C' + B') can be simplified to
(A+C)(AB'+AC) = AB'+AC, and multiplying by (A'C'+B') leaves AB'.
On a Karnaugh map, grouping the 0s produces
Grouping 0s gives sum terms, i.e. a POS expression.
Adjacent 1s detector circuit will have active high output for the input
0011 is the only option with two adjacent 1s.
The bolean expression A + BC equals
By the distributive law (A+B)(A+C) = A + BC.
The number "1259" may belong to _______ number system.
The digits 2, 5 and 9 rule out binary and octal, leaving decimal or hexadecimal.
If two numbers in BCD representation generate an invalid BCD number then the binary ________ is added to the result
Adding 6 (0110) skips the six invalid codes and corrects the BCD sum.
"1101" in signed representation is equivalent to _______
In sign-magnitude the MSB 1 means negative and 101 = 5, so 1101 = -5.
In decimal value "275" the weight of the digit "7" is ___________
7 is in the tens position, so its weight is 10.
The decimal "10" will have an octal equivalent ________
10 = 1 x 8 + 2, so it is 12 in octal.
Sum = A XOR B XOR C, CarryOut = C(A XOR B) + AB are the Sum and CarryOut expression of
These are the full adder sum and carry equations with carry-in C.
The first Least Significant digit in decimal number system has
The LSD is at position 0 with weight 10^0 = 1.
The decimal equivalent of the binary number "10011" is
16 + 2 + 1 = 19.
"74ALS" stands for ______
ALS is the Advanced Low-power Schottky TTL family.
An adder circuit can be used to perform subtraction operation
Subtraction is done by adding the 2's complement of the subtrahend.
The Programmable Array Logic (PAL) has ______ AND array and a ______ OR array
A PAL has a programmable AND array feeding a fixed OR array.
The complement of a variable is always
Complementing a variable gives its inverse (A becomes A').
The boolean expression X = AB + CD represents
AB and CD are AND terms whose outputs are ORed.
An example of SOP expression is
A'B + AC' + AB'C is a sum of product terms; A + B(C + D) has a sum term inside a product, so it is not SOP.
The domain of the expression AB'CD + AB' + C'D + B is
The domain is the set of all variables appearing in the expression: A, B, C and D.
Which one of the following is NOT a valid rule of Boolean algebra?
A variable never equals its own complement; the other three are valid rules.
The boolean expression A + B' + C is
Literals joined by OR form a sum term.
The boolean expression AB'CD' is
Literals joined by AND form a product term.
Which of the following rules states that if one input of an AND gate is always 1, the output is equal to the other input?
ANDing with 1 leaves the other input unchanged: A.1 = A.
Don't care conditions are marked as _________ in the output column of the function table
Don't care outputs are written as X.
The cell marked 6 in 4-variable K-Map represent minterm 6 or the maxterm 6 having the following binary value of variables A, B, C and D.
6 in binary is 0110, so A = 0, B = 1, C = 1, D = 0.
For a Standard SOP expression, a ____ is placed in the cell corresponding to the product term (Minterm) present in the expression.
Each minterm present in an SOP expression is marked with a 1 on the K-map.
A 3-variable karnaugh map has
Three variables give 2^3 = 8 cells.
2's complement of hexadecimal number B70A is
FFFF - B70A = 48F5 (1's complement); adding 1 gives 48F6.
The minterm expansion for F(A,B,C) = (A + B + C)(A + B' + C')(A' + B + C')(A' + B' + C) is
The sum terms are maxterms 0, 3, 5 and 6, so the minterms are the remaining 1, 2, 4 and 7.
The maximum value, represented by a single hexadecimal digit is ________
Hexadecimal digits run from 0 to F (15).
In 32-bit Single-Precision Floating Point format representation the range of exponent value is from ________ to ________
The biased 8-bit exponent gives actual exponents from -126 to +127.
The hexadecimal value "FD" is equivalent to binary value ________
F = 1111 and D = 1101, giving 11111101.
Suppose we want to transmit the data "10001101", and an "Odd-Parity" bit scheme is used to detect errors, the parity bit added to this data will be ____
The data has four 1s, so a 1 is added to make the count odd.
________ is the example of Commutative Law for Multiplication
The commutative law for multiplication swaps the order of ANDed variables.
Consider A=1, B=0, C=1. A, B and C represent the input of three bit NAND gate the output of the NAND gate will be ________
NAND gives 1 unless all inputs are 1.
The decimal value "20" is equivalent to binary value ________
20 = 16 + 4, which is 10100.
1011 - 101 = ________
11 - 5 = 6 = 0110.
The 4-variable Karnaugh Map (K-Map) has ______ rows and ______ columns
A 4-variable map has 16 cells arranged 4 by 4.
For a Standard SOP expression, a ______ is placed in the cell corresponding to the product term (Minterm) present in the expression.
Each minterm of an SOP expression is a 1 in the K-map.
A standard interface for programming the In-System PLD consists of __________.
In-system programming uses the 4-wire JTAG interface (TDI, TDO, TMS, TCK).
A product term is 0 when_______________.
A product (AND) term is 0 if any one of its literals is 0.
What will be the output of a 3-input NAND gate for the input values: A=1, B=0, C=1
With one input at 0 the AND part is 0, so the NAND output is 1.
__________ is not a valid hexadecimal number.
H is not a hexadecimal digit (valid digits are 0-9 and A-F).
A BCD to 7-Segment decoder has _________ inputs and ________ outputs.
It takes a 4-bit BCD digit and drives 7 segment lines a-g.
Which of the following simplification method is intended to be used for Boolean expressions having more than four variables?
The tabular Quine-McCluskey method suits functions with many variables where K-maps become impractical.
What are the values of sum and carry out when two 4-bit binary numbers (1011 and 1111) are applied to a 4-bit parallel adder and carry input is 1.
1011 + 1111 + 1 = 11 + 15 + 1 = 27 = 11011, so sum 1011 and carry out 1.
A particular half-adder has ______ inputs and ________ output(s).
A half adder adds two bits and gives a sum and a carry.
Determine the binary values of the variables for the following standard POS expression. (A + B' + C)(A' + B + C')
A+B'+C is 0 for A=0,B=1,C=0 and A'+B+C' is 0 for A=1,B=0,C=1.
Consider the binary number "100101", its 2's complement will be _________
1's complement is 011010; adding 1 gives 011011.
According to Demorgan's theorem: (A + B + C)' = ________
DeMorgan: the complement of a sum is the product of the complements.
The expression F=A+B+C describes the operation of 3-bit _____ gate.
The + operator is OR, so F is a 3-input OR gate.
What are the sum (Σ) and the carry (Cout) for full adder circuit when A = 1, B = 1 and Cin = 0?
1 + 1 + 0 = 10 in binary, so sum 0 and carry 1.
The carry propagation can be expressed as ________.
In the course's carry look-ahead treatment, carry propagate is Cp = A + B (carry generate is Cg = AB).
In the binary number "1100.111", the first bit at the right of decimal point has the weight
The first fractional binary position has weight 2^-1 = 1/2.
An equivalent ABEL notation of Boolean expression A+B is _____________
In ABEL, # is OR, & is AND, ! is NOT and $ is XOR.
Which circuit has the following Sum and CarryOut expressions? Sum = A⊕B⊕C, CarryOut = C(A⊕B) + AB
These are the sum and carry equations of a one-bit full adder with carry-in C.
The Boolean expression for the logic circuit is ______________ [Circuit: A and B into an OR gate; its output ANDed with C, that result ANDed with D, and that result ANDed with E.]
The OR gives A+B and the chain of AND gates multiplies it by C, D and E.
The output of the expression F=A+B+C will be Logic ________ when A=0, B=1, C=1.
+ is logical OR, so 0 OR 1 OR 1 = 1, not an arithmetic sum.
A quantity having continuous values is a/an _______________ quantity.
Analog quantities vary continuously; digital ones take discrete values.
Identify the Boolean expression that is in standard POS form.
Standard POS needs every variable in every sum term; only (A+B'+C')(A+B+C) qualifies.
Simplifying POS (Product of sum) expression requires the grouping of _____________
POS minimization groups the 0s of the K-map.
In the following Karnaugh map, which group has "legal grouping"? [Map: columns AB = 00,01,11,10; rows CD: 00 -> 1 1 1 0; 01 -> 1 0 0 1; 11 -> 0 1 1 1; 10 -> 0 1 1 0. Group A is an L-shape (row CD=00, AB=00..11, plus cell AB=00,CD=01); group B is a diagonal pair (AB=11,CD=00 and AB=10,CD=01); group C is the square AB=01,11 x CD=11,10; group D is the three cells AB=01,11,10 in row CD=11.]
Only C is a rectangular group of 4 adjacent 1s; A is L-shaped, B diagonal, D has 3 cells.
The Boolean expression for the logic circuit is ______________ [circuit: A and B into an OR gate, its output ANDed with C, then with D, then with E]
The OR output A+B passes through three cascaded AND gates with C, D and E.
No MCQs match this filter.Is filter mein koi MCQ nahi.
How can a D flip-flop be made to toggle?
Connect the inverted output Q' back to the D input. On every active clock edge the flip-flop then stores the complement of its present state, so it toggles.
What is the difference between a counter and a shift register?
A counter steps through a specified sequence of states on clock pulses (it counts), whereas a shift register stores data bits and moves them one position per clock pulse; it has no specified count sequence of its own.
How many outputs and inputs does the GAL22V10 have?
The number 22 is the maximum number of inputs (dedicated inputs plus I/O pins usable as inputs) and 10 is the number of outputs (OLMCs); the V means variable (programmable) output configuration.
What is an equivalent representation for the Boolean expression A' + 1?
By the rule X + 1 = 1 with X = A', A' + 1 = 1.
What is a K-map and why do we use it?
A Karnaugh map is a special arrangement of a truth table in which adjacent cells differ in only one variable. Grouping adjacent 1s (or 0s) in powers of two eliminates variables and gives a minimal SOP (or POS) expression without lengthy algebra.
Each stage in a shift register represents how much storage capacity?
One bit; each stage is one flip-flop.
What are PLDs? How are they classified?
Programmable logic devices are ICs containing arrays of AND and OR gates (and in some types flip-flops) whose connections are programmed by the user to implement logic functions, replacing many SSI/MSI chips. Simple PLDs are classified as PROM (fixed AND array, programmable OR array), PLA (both arrays programmable), PAL (programmable AND array, fixed OR array, one-time programmable) and GAL (like a PAL but electrically erasable/reprogrammable, with programmable OLMCs). Larger devices are CPLDs and FPGAs.
What are flip-flops?
Flip-flops are clocked bistable memory elements used in sequential circuits. Each stores one bit and has two complementary outputs, Q and Q'. The output changes only at the triggering edge of the clock, according to the synchronous inputs (S-R, D or J-K).
If an S-R latch has a 0 on the S input and a 1 on the R input and then the R input goes to 0, what will the latch be?
S=0, R=1 resets the latch (Q=0). When R returns to 0 (S=R=0) the latch holds its previous state, so it remains reset (Q=0).
In a 4-bit Johnson counter sequence there are a total of how many states, or bit patterns?
8 states; an n-bit Johnson counter has 2n states.
What is the difference between asynchronous and synchronous counters?
In a synchronous counter all flip-flops are driven by the same clock, so they change state at the same time. In an asynchronous (ripple) counter the clock drives only the first flip-flop and each following flip-flop is clocked by the output of the previous one, so changes ripple through and accumulate propagation delay.
What is meant by D in the gated D latch and what is the function of this D input? What is the basic difference between latches and flip-flops?
D stands for Data. It is the single data input; while the enable input is active the output Q follows D, and when enable goes inactive the last D value is stored. A latch is level-sensitive (it responds to its inputs throughout the time the enable is active, or at any time if it has no enable), while a flip-flop is edge-triggered and changes state only at the triggering edge of the clock.
I cannot understand the timing diagram for the master-slave flip-flop.
A master-slave flip-flop has two latches: a master enabled when the clock is high and a slave enabled when the clock is low (through an inverter). While the clock is high the master follows the inputs and the slave is locked, so the output does not change. When the clock goes low the master is locked and the slave copies the master, so the output changes at the negative clock transition and reflects the inputs present just before that edge.
Explain in detail the truth table and timing diagram of the S-R edge-triggered flip-flop, D edge-triggered flip-flop and J-K edge-triggered flip-flop.
Edge-triggered flip-flops change state only at the triggering (rising or falling) clock edge; S, R, J, K and D are synchronous inputs. S-R: S=0,R=0 no change; S=1,R=0 set; S=0,R=1 reset; S=1,R=1 invalid. J-K: same as S-R except J=1,K=1 toggles, so there is no invalid state. D: Q takes the value of D at each triggering edge (D=1 set, D=0 reset). Asynchronous preset/clear inputs override the clock and must be inactive for synchronous operation. In timing diagrams the output changes only at the triggering edges, using input values present just before each edge.
What is a multiplexer, what are its applications and how is expression simplification done using a multiplexer?
A multiplexer (data selector) has several data inputs, select inputs and one output; the binary value on the select lines routes one data input to the output (2^n inputs need n select lines). Applications: time-division multiplexing of several signals onto one line (e.g. telephone lines), routing register contents to an ALU, row/column address multiplexing for dynamic memory, parallel-to-serial conversion and implementing logic functions. To implement a function, apply the input variables to the select lines and connect each data input to 0 or 1 according to the truth table; with one variable fed to the data inputs (as 0, 1, X or X'), an n-variable function needs only a mux with n-1 select lines.
Explain the S-R latch. What do you mean by bistable devices?
A bistable device has two stable states (set Q=1, reset Q=0) and stays in either indefinitely until an input changes it, so it stores one bit. An S-R latch is the simplest bistable, built from two cross-coupled NOR (or NAND) gates. For the active-high NOR latch: S=1,R=0 sets; S=0,R=1 resets; S=R=0 holds; S=R=1 is invalid because both outputs go to 0. The NAND latch has active-low inputs: S'=R'=1 holds and S'=R'=0 is invalid.
What is meant by triggering or the triggering edge of a clock pulse and synchronous? Also what is the triggering transition of the clock?
Synchronous means that output changes occur in step with the clock. The triggering edge (transition) is the point of the clock waveform at which an edge-triggered device samples its inputs and changes state: the positive (rising, 0 to 1) edge or the negative (falling, 1 to 0) edge.
For BCD numbers that add up to an invalid BCD number or generate a carry, the number 6 (0110) is added to the invalid number. Why?
A 4-bit binary sum counts in base 16, but a BCD digit must carry at 10. Codes 1010-1111 are invalid, and a carry out of a digit means the sum exceeded 15. Adding 6 skips the six unused codes so the digit wraps correctly and produces the decimal carry. Example: 15 + 9: 0001 0101 + 0000 1001 = 0001 1110 (invalid); adding 0110 to the low digit gives 0010 0100 = 24.
Why do we use +0V and +5V instead of +0V and +1V in DLD, when it is always '0' and '1'?
0 and 1 are logic levels, not voltages. Standard TTL and many CMOS ICs run from a +5 V supply, so a high is a voltage near 5 V (within a valid range) and a low is near 0 V. A larger voltage swing also gives good noise margins between the valid low and high ranges.
What is BCD and how do we write it?
Binary Coded Decimal (8421 code) represents each decimal digit 0-9 separately by its 4-bit binary code (0000-1001); codes 1010-1111 are unused. Example: decimal 12 = 0001 0010 in BCD.
What is Gray code and how do we write it?
Gray code is an unweighted code in which successive values differ in only one bit, which avoids errors in shaft encoders. To convert binary to Gray, keep the MSB and XOR each pair of adjacent binary bits for the remaining bits. A reflected Gray code for n bits is built from the n-1 bit code prefixed with 0, followed by the same code in reverse order prefixed with 1, e.g. 3-bit: 000, 001, 011, 010, 110, 111, 101, 100.
Define decoder, encoder, multiplexer, demultiplexer.
Decoder: a circuit that detects a binary code on its inputs and activates the one output corresponding to that code (n inputs, up to 2^n outputs). Encoder: the opposite of a decoder; it accepts an active level on one of its inputs and outputs the binary or BCD code of that input. Multiplexer (data selector): routes one of several data inputs to a single output under control of select lines. Demultiplexer (data distributor): routes a single data input to one of several outputs selected by the select lines.
Draw the function table of a 2-input 4-bit multiplexer.
74x157: inputs G' (active-low enable), S (select), 4-bit inputs A and B, 4-bit output Y. G'=1: Y=0000 (disabled). G'=0, S=0: Y=A (1Y=1A ... 4Y=4A). G'=0, S=1: Y=B (1Y=1B ... 4Y=4B).
Explain the S-R latch in your own words.
An S-R latch is a bistable memory element made of two cross-coupled NOR or NAND gates that stores one bit. With NOR gates (active-high inputs): S=1 sets Q to 1, R=1 resets Q to 0, S=R=0 keeps the stored value and S=R=1 is invalid. With NAND gates the inputs are active-low: S'=0 sets, R'=0 resets, both 1 holds and both 0 is invalid. It is used, for example, for switch debouncing.
Provide some of the inputs for which the adjacent 1s detector circuit has an active high output.
The output is high when the 4-bit input has at least two adjacent 1s: 0011, 0110, 0111, 1011, 1100, 1101, 1110 and 1111.
Draw the truth table of the NOR based S-R latch.
S=0,R=0: Q = previous Q (no change); S=0,R=1: Q=0, Q'=1 (reset); S=1,R=0: Q=1, Q'=0 (set); S=1,R=1: Q=Q'=0, invalid.
For a two bit comparator circuit specify the inputs for which A > B.
Writing A1A0 B1B0: 01 00, 10 00, 10 01, 11 00, 11 01 and 11 10.
Write a note on the comparator.
A comparator compares two binary numbers A and B and activates one of three outputs: A>B, A=B or A<B. A 2-bit comparator has 4 inputs (A1A0, B1B0) and 3 outputs; for example A=B is 1 for 0000, 0101, 1010, 1111. Equality of each bit pair is detected with XNOR gates and the outputs are derived from a function table or K-maps. The 74x85 is a 4-bit magnitude comparator with cascading inputs for comparing longer numbers.
Draw the circuit diagram of the NOR based S-R latch.
Two 2-input NOR gates are cross-coupled: R and the output of the second gate (Q') feed the first gate, whose output is Q; S and Q feed the second gate, whose output is Q'.
Explain combinational function devices.
Combinational function devices are MSI circuits that perform a specific function with outputs depending only on the present inputs, for example comparators, adders, decoders, encoders, code converters, multiplexers and demultiplexers.
Differentiate between hexadecimal and octal number systems.
Octal is base 8 with digits 0-7; each octal digit corresponds to 3 binary bits. Hexadecimal is base 16 with digits 0-9 and A-F (10-15); each hex digit corresponds to 4 binary bits. Both are compact ways to write binary; hex suits byte-oriented data (2 digits per byte).
How is SOP converted into POS?
Write the standard SOP in minterm form. The equivalent standard POS consists of the maxterms for every input combination not present in the SOP: list the binary values not covered by the SOP terms and write a sum term for each (variable uncomplemented for 0, complemented for 1), then AND them.
Write the NOR gate table.
A B : X = 00:1, 01:0, 10:0, 11:0.
Write the NAND gate table.
A B : X = 00:1, 01:1, 10:1, 11:0.
Write the XOR gate table.
A B : X = 00:0, 01:1, 10:1, 11:0.
Write the uses of the multiplexer.
Routing the contents of one of several registers to an ALU input, time-division multiplexing of signals (e.g. telephone lines), multiplexing row and column addresses of dynamic memory, parallel-to-serial conversion and implementing logic functions.
Write any two advantages of Boolean expressions.
The function of a logic circuit can be determined from its Boolean expression without building the circuit, and an expression can be simplified so that the same function is implemented with fewer gates.
Draw the diagram of the odd parity generator circuit.
For 4-bit data A, B, C, D: two XOR gates compute A XOR B and C XOR D and their outputs feed an XNOR gate whose output is the parity bit P, so the five bits always contain an odd number of 1s.
What does an 8-bit adder/subtracter circuit do?
It adds or subtracts two 8-bit numbers. Two cascaded 4-bit parallel adders (74LS283) form the 8-bit adder, with the carry-out of the lower adder fed to the carry-in of the upper adder. An Add/Subtract control selects whether B or its 1's complement is applied to the B inputs and is also fed to the first carry-in, so subtraction is done by 2's complement addition (A + B' + 1).
Draw the function table of the 3 to 8 decoder.
74x138: enables G1 (active-high), G2A' and G2B' (active-low); outputs Y0'-Y7' active-low. If G1=0 or G2A'=1 or G2B'=1 all outputs are high. When enabled (G1=1, G2A'=G2B'=0), input CBA = 000..111 drives only the matching output Y0'..Y7' low; all others stay high.
Why is a 2-bit comparator called a parallel comparator?
Because all bits of the two numbers are compared simultaneously rather than one bit at a time.
Explain at least two advantages of a circuit having low power consumption.
Low-power circuits can run from batteries, so they suit portable devices, and they dissipate less heat, so devices can be packed tightly without extra cooling.
Explain Test Vector in the context of ABEL.
A test vector specifies a set of input values and the expected output values. The ABEL software simulates the design by applying the test vectors and checking the outputs, verifying the logic before the device is programmed; test vectors are essentially a truth table (e.g. for a 2-bit comparator).
For a two bit comparator circuit specify the inputs for which the output A < B is set to 1.
Writing A1A0 B1B0: 00 01, 00 10, 00 11, 01 10, 01 11 and 10 11.
How can a PLD be programmed?
Using a computer running development/programming software: the design is entered (e.g. ABEL), compiled into a fuse map (JEDEC file) and downloaded to a programmer socket holding the PLD, or to a device installed on the circuit board through in-system programming.
How many input and output bits does a half-adder contain?
Two input bits (A, B) and two output bits (Sum and Carry).
Explain the difference between a 1-to-4 demultiplexer and a 2-to-4 binary decoder.
The circuits are almost the same. In the 1-to-4 demultiplexer the two inputs act as select lines and an extra data input is routed to the selected output; in the 2-to-4 decoder that line serves as the enable input, so the selected output is simply activated.
How can standard Boolean expressions be converted into truth table format?
For each term of a standard SOP expression, write the binary value that makes the term 1 and put a 1 in the output column for those rows (0 elsewhere). For standard POS, put a 0 in the rows whose binary value makes each sum term 0 and 1 elsewhere.
Briefly state the basic principle of the Repeated Multiplication-by-2 method.
To convert a decimal fraction to binary, repeatedly multiply the fraction by 2, record the integer part (0 or 1) of each product and continue with the fractional part until it is zero (or enough bits are obtained); the integer parts read from first to last give the binary fraction. Example: 0.625 -> 1.25, 0.5, 1.0 -> 0.101.
Add -13 and +7 by converting them into the binary system; your result must be in binary.
Using 8-bit 2's complement: +13 = 00001101, so -13 = 11110011; +7 = 00000111. 11110011 + 00000111 = 11111010. The sign bit is 1, so the result is negative; its 2's complement is 00000110 = 6, so the result 11111010 = -6.
Which device performs an operation which is the opposite of the Decoder function?
The encoder.
Define a decoder
A decoder is a combinational circuit that detects a particular binary code at its inputs and activates the one output that corresponds to it; an n-input binary decoder has up to 2^n outputs, one for each input combination (e.g. 2-to-4, 3-to-8, BCD-to-decimal).
How can we use the 3-to-8 decoder to implement SOP expressions
Each output of a 3-to-8 decoder is active for exactly one input combination, i.e. it represents one minterm of the three input variables. To implement a standard SOP function, connect the variables to the decoder inputs and OR together the outputs for the minterms where the function is 1; with active-low outputs (74138) a NAND gate is used instead of the OR gate. Example: F = sum(1,3,5) uses outputs 1, 3 and 5.
Considering the table below, explain the first step of Quine-McCluskey method. Table (minterm: A B C D E): 1: 00001; 3: 00011; 5: 00101; 7: 00111; 11: 01011; 13: 01101; 17: 10001; 19: 10011; 23: 10111; 29: 11101; 31: 11111
The first step of the Quine-McCluskey method is to arrange the minterms in groups according to the number of 1s in their binary representation (the index), so that only adjacent groups need to be compared later. For this table: one 1: m1 (00001); two 1s: m3 (00011), m5 (00101), m17 (10001); three 1s: m7 (00111), m11 (01011), m13 (01101), m19 (10011); four 1s: m23 (10111), m29 (11101); five 1s: m31 (11111). Next, each minterm is compared with those of the next group to combine pairs differing in one bit.
Explain at least two advantages of the circuit having low power consumption
Less heat is produced, so the circuit needs less cooling and more gates can be packed on a chip; batteries last longer in portable equipment; a smaller and cheaper power supply is needed; reliability improves because components run cooler.
Provide some of the inputs for which the adjacent 1s detector circuit have active high output?
The output is 1 whenever two neighbouring bits of the 4-bit input are both 1: 0011, 0110, 0111, 1011, 1100, 1101, 1110 and 1111.
What does a 8-bit adder/subtracter circuit do?
It adds or subtracts two 8-bit numbers with one parallel adder. A control input selects the operation: for addition B passes unchanged and carry-in is 0; for subtraction XOR gates invert every bit of B and carry-in is set to 1, which adds the 2's complement of B, giving A - B. The output is the 8-bit result with carry/overflow.
Briefly state the basic principle of Repeated Division-by-2 method.
To convert a decimal integer to binary, divide it by 2 repeatedly, noting each remainder (0 or 1) and dividing the quotient again, until the quotient becomes 0. The remainders read from the last to the first give the binary number (first remainder = LSB). Dividing by another base converts to that base.
Add -13 and +7 by converting them in binary system your result must be in binary.
Use 8-bit 2's complement: +13 = 00001101, so -13 = 11110010 + 1 = 11110011; +7 = 00000111. Sum: 11110011 + 00000111 = 11111010. The sign bit is 1, so the result is negative; its 2's complement is 00000110 = 6, so the result 11111010 = -6.
How standard Boolean expressions can be converted into truth table format.
List all input combinations; for a standard SOP expression write 1 in the output column for each combination whose binary value equals a product term (minterm) and 0 elsewhere; for a standard POS expression write 0 for each combination equal to a sum term (maxterm) and 1 elsewhere.
How many input and output bits do a Half-Adder contain?
Two input bits (A, B) and two output bits (Sum and Carry).
Explain the function of BCD adder using a block diagram
A BCD adder adds two BCD digits and gives a BCD result. Block diagram: a first 4-bit binary adder adds the digits (and carry-in); correction logic detects an invalid result, C = K + Z3Z2 + Z3Z1 (carry out, or sum greater than 9); when C = 1 a second 4-bit adder adds 0110 (6) to the sum, and C is the decimal carry to the next digit. If the sum is 9 or less, 0000 is added and the sum passes unchanged.
Draw a function table of full adder
Full adder inputs A, B, Cin; outputs S, Cout: 000->00, 001->10, 010->10, 011->01, 100->10, 101->01, 110->01, 111->11. S = A xor B xor Cin, Cout = AB + Cin(A xor B).
Why can't the inputs of an S-R latch be active (low) at the same time?
In the active-LOW (NAND) S'-R' latch, S'=R'=0 forces both Q and Q' to 1, which breaks the rule that the outputs are complements; when both inputs then return to 1 together the final state is unpredictable (race). So this input condition is invalid and not used.
How decoder is used as demultiplexer.
A decoder that has an enable input (for example the 74HC138 or 74HC154) can be used as a demultiplexer. The decoder's input lines are used as the data-select lines, and the data signal is connected to the enable input. Only the selected output is active, and it follows the data on the enable line, while all other outputs stay inactive, so the data is routed to the selected output.
Two-bit iterative comparator circuit for comparison A=B. Explain functionality of the Circuit.
An iterative comparator compares the numbers one bit pair at a time using identical stages. Each stage receives an equality input Ein from the previous stage (the first stage gets Ein = 1) and produces Eout = Ein AND (Ai XNOR Bi). So a stage passes 1 only if all previous bits were equal and its own two bits are equal. For two bits, A = B output = (A1 XNOR B1)(A0 XNOR B0), which is 1 only when both bit pairs match. Because each stage only passes its result to the next, stages can be cascaded for longer numbers without extra logic.
Draw function table of a half adder circuit?
Inputs A, B; outputs Sum S and Carry C: A=0, B=0: S=0, C=0. A=0, B=1: S=1, C=0. A=1, B=0: S=1, C=0. A=1, B=1: S=0, C=1. So S = A XOR B and C = AB.
What is difference b/w BCD to decimal decoder and binary 4-to-16 bit decoder?
Both have four inputs. A binary 4-to-16 decoder has 16 outputs and activates one output for every input combination 0000 to 1111. A BCD-to-decimal decoder has only 10 outputs (0 to 9); it decodes only the valid BCD codes 0000 to 1001, and the six codes 1010 to 1111 are invalid and activate no output.
Explain major use of decoder circuits?
A decoder activates one output for each input code. Major uses: address decoding to select a memory chip, memory location or I/O port; converting codes such as BCD to decimal or BCD to 7-segment to drive displays; selecting one of several devices or instructions in a processor; acting as a demultiplexer when the data is applied to the enable input; and implementing Boolean functions by ORing the required minterm outputs.
Define Sequential Circuit.
A sequential circuit is a digital circuit whose output depends on the present inputs and on previously stored information (its present state). It contains memory elements such as latches or flip-flops, unlike a combinational circuit whose output depends only on the present inputs.
Define JEDEC file
A JEDEC file is a standard-format text file (defined by the Joint Electron Device Engineering Council) produced by PLD software such as ABEL. It holds the fuse map, the state of every programmable link, and is loaded into the device programmer to program the PLD.
What is 2's complement of 0011 1001?
1's complement: 1100 0110. Adding 1 gives the 2's complement 1100 0111.
What is the opposite of the decoder?
An encoder. A decoder converts a binary code into one active output line, while an encoder converts one active input line into a binary code.
What is comparator?
A comparator is a combinational circuit that compares two binary numbers A and B and shows their relation on outputs A > B, A = B and A < B. The basic one-bit comparator is an XOR (or XNOR) gate.
Draw the function table of 2-to-4 decoder
Inputs I1 I0, outputs O0 to O3, one output active for each input: I1I0 = 00: O0=1, others 0. 01: O1=1. 10: O2=1. 11: O3=1. (O0 = I1'I0', O1 = I1'I0, O2 = I1I0', O3 = I1I0.)
Explain BCD to Decimal Decoder
A BCD-to-decimal decoder has four inputs that receive a BCD digit and ten outputs, 0 to 9. It works like a 4-to-16 binary decoder except that it has only ten outputs: each valid BCD code 0000 to 1001 activates the one matching output. The invalid codes 1010, 1011, 1100, 1101, 1110 and 1111 do not activate any output. (In the 74x42 the outputs are active low.)
What is meant by ABEL?
ABEL (Advanced Boolean Expression Language) is a hardware description language used to describe logic designs that are implemented in programmable logic devices (PLDs). The design is entered as equations, truth tables or state diagrams, and the ABEL software compiles it into a JEDEC fuse map for programming the device.
Why is it preferable to use another method than the 5-variable K-Map?
A K-map becomes hard to manage when the number of variables is more than four. A 5-variable map needs two 4-variable maps whose adjacent cells are not side by side, so grouping and finding redundant terms is not obvious and mistakes are easy. A systematic method such as the Quine-McCluskey tabular method compares every minterm with every other to remove variables, works for any number of variables and can be programmed on a computer.
Draw circuit diagram of 2-input 8-bit multiplexer?
A 2-input 8-bit multiplexer selects one of two 8-bit words A7-A0 and B7-B0 and passes it to outputs Y7-Y0. It is made of eight 2-to-1 multiplexers that share one select line S (and an enable G): for every bit i, Yi = S'Ai + SBi, built with an inverter on S, two AND gates and an OR gate. When S = 0 the outputs follow A; when S = 1 they follow B. In practice two 74x157 quad 2-input multiplexers with common select and enable lines form the 8-bit multiplexer.
Draw the half adder graph.
The half adder circuit has inputs A and B. A 2-input XOR gate gives the Sum, S = A XOR B, and a 2-input AND gate gives the Carry, C = AB. Its function table is: 00 -> S=0, C=0; 01 -> S=1, C=0; 10 -> S=1, C=0; 11 -> S=0, C=1.
Draw NOR gate based S-R (set reset) Latch.
Two 2-input NOR gates are cross-coupled. R goes to one input of the first NOR gate, whose output is Q. S goes to one input of the second NOR gate, whose output is Q'. Q is fed back to the second input of the second gate and Q' is fed back to the second input of the first gate. The inputs are active high: S=1 sets Q to 1, R=1 resets Q to 0, S=R=0 holds the state and S=R=1 is invalid.
Two bit comparator? Explain by at least one example
A 2-bit comparator compares two 2-bit numbers A = A1A0 and B = B1B0 and has three outputs: A>B is set to 1 if A > B, A=B is set to 1 if A = B and A<B is set to 1 if A < B; only one output is 1 at a time. Example: A = 10 (2) and B = 01 (1) gives A>B = 1, A=B = 0, A<B = 0. A = 11 and B = 11 gives A=B = 1.
Explain PLDs
Programmable Logic Devices (PLDs) are ICs containing arrays of AND gates and OR gates whose connections can be programmed (for example by fuses) to perform a required logic function. They replace many logic gates and MSI chips, saving circuit board space and component cost, and a design can be changed by reprogramming. Types include PROM (fixed AND, programmable OR), PLA (both arrays programmable), PAL (programmable AND, fixed OR) and GAL (reprogrammable PAL-type device with OLMCs).
Comparator: all possibilities for A = B.
For a 2-bit comparator the A=B output is 1 for the input combinations A B = 00 00, 01 01, 10 10 and 11 11.
Draw one diagram for a PLD array with its fuses connecting columns to rows
In the array each input and its complement (from a buffer and an inverter) runs on a column line, and each AND gate input runs on a row line. A fuse sits at every row-column crossing. An intact fuse connects that input literal to the AND gate; a blown fuse disconnects it. The AND outputs (product terms) feed OR gates, so blowing selected fuses programs the required sum-of-products function.
Why S and R input of NAND based latch should not be at logic high at same time
The NAND-based S-R latch has active-low inputs, so S = R = 1 (both high) is actually its no-change state and is allowed. The forbidden condition for a NAND latch is S = R = 0, which forces both Q and Q' to 1, so the outputs are no longer complements, and when both inputs return to 1 together the final state is unpredictable. The same reasoning applies to the active-high NOR-based latch, where S = R = 1 forces both outputs to 0 and must not be applied.
2 input 4 bit multiplexer function table
For the 2-input 4-bit multiplexer (such as the 74x157) with enable G and select S: G = 1, S = X: all outputs 1Y to 4Y = 0. G = 0, S = 0: 1Y to 4Y = 1A to 4A. G = 0, S = 1: 1Y to 4Y = 1B to 4B.
Write down the ABEL symbols that are used for NOT, AND, OR and XOR operations.
NOT = !, AND = &, OR = #, XOR = $.
How many possible outputs does a decoder of 3 inputs contain?
A 3-input (3-to-8) decoder has 2^3 = 8 outputs; each output is active for exactly one of the 8 input combinations.
For a two bit comparator circuit, specify all the inputs for which A > B is set to 1.
With A = A1A0 and B = B1B0, A > B = 1 for: A=01,B=00; A=10,B=00; A=10,B=01; A=11,B=00; A=11,B=01; A=11,B=10 (six combinations). Expression: A>B = A1B1' + A0B1'B0' + A1A0B0'.
Write down four uses of multiplexers.
1) Data selection/routing: choosing one of several input lines onto one output. 2) Parallel-to-serial conversion, with a counter driving the select lines. 3) Implementing (generating) logic functions: variables on select lines, 0/1 on data inputs. 4) Time-division multiplexing, sharing one line or display among several sources (e.g. multiplexed displays).
For a two bit comparator circuit, specify all the inputs for which the output A = B is set to 1.
A = B is 1 only when A1 = B1 and A0 = B0, i.e. for the four combinations A1A0 B1B0 = 00 00, 01 01, 10 10 and 11 11. Expression: (A=B) = (A1 XNOR B1)(A0 XNOR B0).
Draw the Truth-Table of NAND based S-R Latch.
NAND (active-low) S'-R' latch: S'=1, R'=1 -> no change (Q holds); S'=0, R'=1 -> set, Q=1, Q'=0; S'=1, R'=0 -> reset, Q=0, Q'=1; S'=0, R'=0 -> invalid (both Q and Q' = 1).
Draw the block diagram of 4-bit BCD Adder.
Blocks: (1) a 4-bit binary adder adds BCD digits A3-A0 and B3-B0 with carry-in, giving S3-S0 and carry C4. (2) Correction logic produces Cout = C4 + S3S2 + S3S1 (sum > 9). (3) A second 4-bit binary adder adds 0110 (Cout on the 2^2 and 2^1 inputs, 0 on the others) to S3-S0 when Cout = 1, giving the corrected BCD sum digit; Cout is the decimal carry to the next BCD stage.
Explain the half adder: its function table, Boolean expression and circuit diagram.
A half adder adds two bits A and B and produces Sum and Carry. Table: 00 -> S0 C0; 01 -> S1 C0; 10 -> S1 C0; 11 -> S0 C1. Expressions: Sum = A XOR B = A'B + AB'; Carry = AB. Circuit: one XOR gate for Sum and one AND gate for Carry, both fed by A and B.
One of the ABEL entry methods uses logic equations; explain it with at least a single example.
In the equation method each output is defined by a Boolean equation using ABEL operators: & (AND), # (OR), ! (NOT), $ (XOR); each equation ends with a semicolon and identifiers are case sensitive. Example: F = AB' + AC + B'D' is written F = A & !B # A & C # !B & !D;
Explain carry propagation in a parallel binary adder.
In a parallel (ripple-carry) adder made of cascaded full adders, the carry-out of each stage is the carry-in of the next stage. The sum bit of a stage is not final until its carry-in arrives, so the carry may ripple from the LSB to the MSB; the worst-case addition time is the propagation delay of one full adder multiplied by the number of stages. Look-ahead carry generation computes the carries directly from generate (AB) and propagate (A+B or A XOR B) terms to remove this delay.
Explain the Sum-of-Weights method for hexadecimal to decimal conversion with at least one example.
Multiply each hex digit by its positional weight (16^0, 16^1, 16^2, ...) and add the products. Example: 1B7 (hex) = 1 x 256 + 11 x 16 + 7 x 1 = 256 + 176 + 7 = 439 (decimal).
Draw the function table of the two-bit comparator circuit, map it to a K-map and derive the expression for (A > B).
A>B is 1 for A1A0B1B0 = 0100, 1000, 1001, 1100, 1101, 1110. From the K-map: A>B = A1 B1' + A0 B1' B0' + A1 A0 B0'.
Draw the S-R latch diagram.
NOR latch: two cross-coupled NOR gates; R and Q' feed the gate producing Q, S and Q feed the gate producing Q'. NAND latch: two cross-coupled NAND gates with active-low inputs; S' and Q' feed the gate producing Q, R' and Q feed the gate producing Q'.
Explain the 8 to 3 bit encoder.
An 8-to-3 binary encoder has 8 inputs (D0-D7), only one active at a time, and outputs the 3-bit code of the active input. Expressions: A0 = D1+D3+D5+D7, A1 = D2+D3+D6+D7, A2 = D4+D5+D6+D7, implemented with three 4-input OR gates (D0 is not needed). A priority encoder (e.g. 74x148) outputs the code of the highest-numbered active input when several are active.
Describe the 16 bit ALU.
A 16-bit ALU is built by cascading four 4-bit ALUs (74x181/74x381). Each 4-bit ALU has internal look-ahead carry, but rippling the carry between the units adds delay, so a look-ahead carry generator (74x182) uses the group carry generate and propagate outputs of each unit to produce the carries for all units at once. The function select inputs choose the arithmetic or logic operation.
Describe latches in your own words.
Latches are level-sensitive bistable memory elements that store one bit. The S-R latch uses cross-coupled NOR (active-high inputs) or NAND (active-low inputs) gates: set, reset, hold, and an invalid input combination. A gated latch adds an enable input so the latch responds only while enable is active, and the gated D latch has a single D input so Q follows D while enabled and holds when disabled, removing the invalid state.
Explain the operation of the odd-parity generator circuit with the help of a timing diagram.
For a 4-bit data value A, B, C, D, two XOR gates give A XOR B and C XOR D and an XNOR gate combines them into the parity bit P, which is 1 when the data has an even number of 1s so that data plus parity has odd parity. In the timing diagram the data changes in successive intervals: for 0000 both XOR outputs are 0 and P=1; for 0001 the XOR outputs are 0 and 1 and P=0; for 0011 P=1, and so on, P going high whenever the count of 1s is even.
Explain with an example how noise affects the operation of a CMOS AND gate circuit.
Two 5 V CMOS AND gates are connected in series. The first gate has both inputs high, so its output is high, say 4.6 V, which is within the valid VOH range (4.4-5 V). A valid high input for the second gate must be at least VIH = 3.5 V, so the noise margin is 4.4 - 3.5 = 0.9 V. If noise of up to about 1.1 V is subtracted from 4.6 V, the voltage stays above 3.5 V and the second gate still reads a high; a larger noise spike pushes the voltage into the invalid region (between 1.5 V and 3.5 V) or below, and the second gate may give a wrong or unpredictable output.
Explain the SOP based implementation of the adjacent 1s detector circuit.
The detector takes a 4-bit input ABCD and outputs 1 when two adjacent bits are 1: minterms 0011, 0110, 0111, 1011, 1100, 1101, 1110, 1111. A direct SOP implementation needs eight 4-input AND gates (one per minterm), an 8-input OR gate and NOT gates for the complemented inputs. A K-map simplifies the function to AB + BC + CD, implemented with three 2-input AND gates and one 3-input OR gate, reducing cost, size and power, with a propagation delay of two gate levels.
Explain the AND gate and some of its uses.
An AND gate outputs 1 only when all its inputs are 1 (X = AB). Uses: enabling/inhibiting a signal (passing a clock or data only when an enable input is high), detecting that several conditions are true at once, forming product terms in SOP circuits, decoders and PLD AND arrays, and frequency-counter gating.
Write down different situations where we need sequential circuits.
Sequential circuits are needed whenever the output depends on past inputs as well as the present ones, so memory is required: storing data (registers, memory), counting events or time (counters, digital clocks, timers), shifting and serial data transfer (shift registers), controllers that go through steps (state machines such as traffic-signal and elevator controllers, washing machines, vending machines) and synchronising operations to a clock.
Explain the Sum of Weights method with an example for octal to decimal conversion.
Multiply each octal digit by its positional weight (8^0, 8^1, 8^2, ...) and add the products. Example: 237 (octal) = 2 x 64 + 3 x 8 + 7 x 1 = 128 + 24 + 7 = 159 (decimal).
Explain the OR gate and some of its uses.
An OR gate outputs 1 when at least one input is 1 and 0 only when all inputs are 0 (X = A + B). Uses: detecting that any of several conditions is true (e.g. any door open raises an alarm), combining product terms in SOP circuits (the OR array of PLDs), and encoder outputs.
Explain Half adder by drawing its function table, circuit diagram and boolean expression
A half adder adds two bits A and B. Function table: A B -> S C : 0 0 -> 0 0; 0 1 -> 1 0; 1 0 -> 1 0; 1 1 -> 0 1. Expressions: Sum S = A xor B = A'B + AB', Carry C = AB. Circuit: one XOR gate gives S and one AND gate gives C, both fed by A and B.
Explain Decimal-to-BCD Encoder
A decimal-to-BCD encoder has 10 inputs (decimal digits 0-9) and 4 outputs giving the BCD code of the active input. Outputs: A0 = 1+3+5+7+9, A1 = 2+3+6+7, A2 = 4+5+6+7, A3 = 8+9, so it can be built from four OR gates (input 0 needs no connection because it gives 0000). A priority version (e.g. 74147) outputs the code of the highest-numbered active input and is used as a keypad encoder.
Describe in your own words about latches
A latch is a bistable memory element: it has two stable states (Q=1 SET, Q=0 RESET) and holds its state until its inputs change it. The basic S-R latch is made from two cross-coupled NOR gates (active-HIGH inputs) or NAND gates (active-LOW inputs). NOR latch: S=1 sets, R=1 resets, S=R=0 holds, S=R=1 is invalid. NAND (S'-R') latch: S'=0 sets, R'=0 resets, both 1 holds, both 0 is invalid. A gated latch adds an enable input so the latch responds only while enable is active; the gated D latch removes the invalid state by using D and D' as S and R. Latches are used for storing bits, switch debouncing and as the basis of flip-flops.
Explain the Implementation of an Odd-Parity Generator Circuit i.e by drawing function table, mapping it to K-map and then simplifying the expression.
For 4-bit data A B C D the odd-parity generator output P must make the total number of 1s odd, so P = 1 for data with an even number of 1s (0000, 0011, 0101, 0110, 1001, 1010, 1100, 1111) and P = 0 for the other eight combinations. On a 4-variable K-map these 1s form a checkerboard pattern: no two 1s are adjacent, so no grouping is possible and the SOP form cannot be reduced by the map. Instead the pattern is recognized as an XOR/XNOR function: P = (A xor B xor C xor D)' , which is implemented with three XOR gates (A xor B, C xor D, then their XOR) followed by an inverter, i.e. an XNOR in the last stage.
Explain latches in your own words
A latch is a bistable memory element: it has two stable states (Q=1 SET, Q=0 RESET) and holds its state until its inputs change it. The basic S-R latch is made from two cross-coupled NOR gates (active-HIGH inputs) or NAND gates (active-LOW inputs). NOR latch: S=1 sets, R=1 resets, S=R=0 holds, S=R=1 is invalid. NAND (S'-R') latch: S'=0 sets, R'=0 resets, both 1 holds, both 0 is invalid. A gated latch adds an enable input so the latch responds only while enable is active; the gated D latch removes the invalid state by using D and D' as S and R. Latches are used for storing bits, switch debouncing and as the basis of flip-flops.
Convert decimal numbers 79 and 83 into binary. Using binary addition, add the two numbers and convert the binary result back into decimal and verify the answer.
79 = 64+8+4+2+1 = 1001111; 83 = 64+16+2+1 = 1010011. Adding: 1001111 + 1010011 = 10100010. Back to decimal: 10100010 = 128 + 32 + 2 = 162, and 79 + 83 = 162, so the answer is verified.
Use Karnaugh map to find the minimum SOP form for following expression F = sum(3, 5, 7, 8, 10, 12, 13, 14, 15)
On a 4-variable map (ABCD) the 1s are 0011, 0101, 0111, 1000, 1010, 1100, 1101, 1110, 1111. Essential groups: AD' (8, 10, 12, 14), BD (5, 7, 13, 15) and A'CD (3, 7). These cover all minterms (the AB quad 12-15 is then redundant). Minimum SOP: F = AD' + BD + A'CD.
Write the Boolean expression and draw the truth table representing the function of a 4x2 Encoder. Draw the circuit diagram of the Encoder.
A 4-to-2 encoder has inputs D0-D3 (one active at a time) and outputs A1 A0. Truth table: D0 -> 00, D1 -> 01, D2 -> 10, D3 -> 11. Expressions: A0 = D1 + D3, A1 = D2 + D3. Circuit: two 2-input OR gates, one fed by D1 and D3 giving A0 and one fed by D2 and D3 giving A1; D0 is not connected because it produces 00.
Write uses of demultiplexer.
1) Data distributor: routes one input line to any one of several output lines selected by the select inputs. 2) Serial-to-parallel conversion: with a counter on the select lines, serial bits are sent to separate outputs. 3) Receiving end of time-division multiplexed links: the shared line is split back into separate channels. 4) Working as a decoder: if the data input is held active, the select lines act as the address and one output is activated, so it can be used for address decoding and chip selection in memory systems. 5) Implementing Boolean functions together with OR gates, and distributing clock or control signals to selected circuits.
(a) Convert the decimal number 6789.8 to octal correct to 3 decimal places. (b) Draw the truth table for the following expression F = xy + x'z
(a) Integer part by repeated division by 8: 6789 = 848 r5, 848 = 106 r0, 106 = 13 r2, 13 = 1 r5, 1 = 0 r1, giving 15205. Fraction by repeated multiplication by 8: 0.8 x 8 = 6.4 (6), 0.4 x 8 = 3.2 (3), 0.2 x 8 = 1.6 (1), so 6789.8 = 15205.631 (octal). (b) xyz -> F: 000 0, 001 1, 010 0, 011 1, 100 0, 101 0, 110 1, 111 1.
Use Quine-McCluskey method to find all prime implicants for the given expression f(a, b, c, d) = Σm(3,7,9,14) + Σd(1,4,6,11)
List minterms and don't cares 1, 3, 4, 6, 7, 9, 11, 14 grouped by number of 1s. First combination: (1,3) 00-1, (1,9) -001, (4,6) 01-0, (3,7) 0-11, (3,11) -011, (6,7) 011-, (6,14) -110, (9,11) 10-1. Second combination: (1,3,9,11) -0-1. Prime implicants: b'd (1,3,9,11), a'bd' (4,6), a'cd (3,7), a'bc (6,7) and bcd' (6,14). A minimal cover of the required minterms is f = b'd + bcd' + a'cd (or a'bc instead of a'cd).
Implement f(A, B, C, D) = AC'D' + B'D using a 4-to-1 multiplexer. Choose the appropriate control inputs
f = Σm(1, 3, 8, 9, 11, 12). Use C and D as the select inputs (S1 = C, S0 = D). Then CD = 00 gives f = A, CD = 01 gives f = B', CD = 10 gives f = 0, CD = 11 gives f = B'. So connect I0 = A, I1 = B', I2 = 0, I3 = B'.
PALs come in different configurations and are identified by a unique number, identify parts of this number?
A PAL part number such as PAL16L8 has three parts. The first number (16) is the number of inputs to the AND array. The letter shows the output type: L = active-low combinational, H = active-high combinational, P = programmable polarity, R = registered outputs. The last number (8) is the number of outputs. Example: PAL16L8 has 16 array inputs and 8 active-low outputs; PAL16R4 has 16 inputs and 4 registered outputs.
One of the ABEL entry methods uses logic equations, explain at least two examples?
In the equation entry method the outputs are written as Boolean equations in the EQUATIONS section of the ABEL source file, after the module, device and pin declarations. Operators: & (AND), # (OR), ! (NOT), $ (XOR). Example 1, an AND-OR function: equations Y = A & B # !C; which gives Y = AB + C'. Example 2, a 2-to-1 multiplexer with select S: equations Z = (!S & D0) # (S & D1); so Z follows D0 when S=0 and D1 when S=1. The compiler converts the equations into the fuse map of the PLD.
Simplify the Boolean function using k-map and draw the circuit diagram. F(x, y, z) = Σ(1,3,5,6,7)
Minterms 1, 3, 5, 7 (001, 011, 101, 111) all have z = 1 and form a group of four giving z. Minterms 6 and 7 (110, 111) form a pair giving xy. So F = z + xy. Circuit: one 2-input AND gate with inputs x and y, and one 2-input OR gate whose inputs are the AND output and z; the OR output is F.
Draw the circuit diagram of the 4x1 Multiplexer. Also write down its truth table?
A 4x1 multiplexer has data inputs D0 to D3, select inputs S1 and S0 and one output Y. Truth table: S1=0, S0=0: Y = D0; S1=0, S0=1: Y = D1; S1=1, S0=0: Y = D2; S1=1, S0=1: Y = D3. Y = S1'S0'D0 + S1'S0D1 + S1S0'D2 + S1S0D3. Circuit: two inverters give S1' and S0'; four 3-input AND gates form the four product terms (each with one data input and the matching select combination); a 4-input OR gate combines the AND outputs into Y.
Answer the following questions briefly: a. What is current sourcing? b. Define noise margin?
a. Current sourcing: when a gate output is HIGH it supplies current to the input of the load gate connected to it; current flows out of the driving gate into the load. (Current sinking is the opposite case, with a LOW output taking current from the load.) b. Noise margin is the largest noise voltage that can be added to a valid logic level without causing the receiving gate to misread it. High-level noise margin VNH = VOH(min) - VIH(min); low-level noise margin VNL = VIL(max) - VOL(max).
Convert (-7A)16 into Binary number system and then take 2's complement of the resultant binary number. (Show all necessary steps.)
Each hex digit becomes 4 bits: 7 = 0111 and A = 1010, so (7A)16 = 0111 1010 (decimal 122). The minus sign is represented by taking the 2's complement: 1's complement 1000 0101, plus 1 gives 1000 0110. So -7A16 in 8-bit 2's complement form is 1000 0110 (-122).
Implement a logic circuit for the truth table given below: A B C | X: 000 | 1, 001 | 0, 010 | 1, 011 | 0, 100 | 1, 101 | 0, 110 | 1, 111 | 1
X is 1 for minterms 0, 2, 4, 6 and 7. X = A'B'C' + A'BC' + AB'C' + ABC' + ABC. Minterms 0, 2, 4, 6 all have C = 0 and group to C'; minterms 6 and 7 group to AB. So X = C' + AB. Circuit: an inverter gives C', a 2-input AND gate gives AB, and a 2-input OR gate combines them into X.
Draw a 4-variable K-map and label each cell according to its binary value. (Hint: for a 2-variable K-map, row A=0 has cells 00, 01 and row A=1 has cells 10, 11.)
Rows are AB = 00, 01, 11, 10 and columns are CD = 00, 01, 11, 10 (Gray code order). Row AB=00: 0000, 0001, 0011, 0010. Row AB=01: 0100, 0101, 0111, 0110. Row AB=11: 1100, 1101, 1111, 1110. Row AB=10: 1000, 1001, 1011, 1010. These are minterms 0, 1, 3, 2 / 4, 5, 7, 6 / 12, 13, 15, 14 / 8, 9, 11, 10.
Draw a truth table and circuit diagram of 4 bit parallel adder?
A 4-bit parallel adder is four full adders connected in a chain. Stage i adds Ai, Bi and the carry Ci from the previous stage and gives Si and C(i+1); C0 is the input carry (0 for plain addition) and C4 is the output carry. Each stage follows the full-adder truth table (A B Cin | S Cout): 000|00, 001|10, 010|10, 011|01, 100|10, 101|01, 110|01, 111|11, with S = A XOR B XOR Cin and Cout = AB + Cin(A XOR B). Example: 1011 + 0110 with C0 = 0 gives S = 0001 and C4 = 1 (11 + 6 = 17).
Explain 8-input Multiplexer with the help of circuit Diagram and Function Table.
An 8-input (8-to-1) multiplexer has data inputs D0 to D7, three select inputs C, B, A, an enable input and the output Y. Function table (enabled): CBA = 000: Y = D0; 001: Y = D1; 010: Y = D2; 011: Y = D3; 100: Y = D4; 101: Y = D5; 110: Y = D6; 111: Y = D7; when disabled Y = 0. Y = C'B'A'D0 + C'B'AD1 + C'BA'D2 + C'BAD3 + CB'A'D4 + CB'AD5 + CBA'D6 + CBAD7. Circuit: inverters give C', B', A'; eight 4-input AND gates (plus the enable) each combine one data input with its select combination; an 8-input OR gate combines them into Y. The 74x151 is such a multiplexer and also gives the complemented output.
Uses of Demultiplexer?
A demultiplexer connects a single data source to one of several destinations chosen by the select lines. Uses: 1) at the output of an ALU, to route the result to the selected register or storage unit; 2) reconstructing parallel data from a serial data stream: a counter drives the select inputs so that successive serial bits go to successive outputs where they are stored, and the bits are then read out in parallel; 3) distributing time-multiplexed signals to separate lines in communication systems; 4) with the data input held active, working as a decoder.
Half adder explanation, its function table, Boolean expression and circuit diagram
A half adder adds two single bits A and B and gives a Sum bit and a Carry Out bit; it has 2 inputs and 2 outputs and no carry input. Function table (A B | S C): 00 | 0 0, 01 | 1 0, 10 | 1 0, 11 | 0 1. From the table Sum = A'B + AB' = A XOR B and Carry = AB. Circuit: a 2-input XOR gate gives the Sum and a 2-input AND gate gives the Carry, both fed by A and B.
Consider a logical circuit for 4-bit binary number. The circuit gives output 0 for adjacent 0s in a binary number. Draw the karnauph map of such circuit and derive simplified POS expression.
Let the number be ABCD. The output is 0 when any two adjacent bits are both 0: AB=00, BC=00 or CD=00. Place 0s in the K-map at m0, m1, m2, m3 (AB=00), m8, m9 (BC=00, with m0, m1) and m4, m12 (CD=00, with m0, m8); all other cells are 1. Grouping the 0s: row AB=00 gives (A+B), the BC=00 cells give (B+C), the column CD=00 gives (C+D). Simplified POS: F = (A+B)(B+C)(C+D).
Multiplexers can be used as a "Logic Function Generator". Draw only circuit diagram and function table based on three variables.
Use an 8-input (74X151) multiplexer. Connect the three variables A, B, C to the select lines S2, S1, S0. Tie each data input Di to logic 1 or 0 equal to the function value for minterm i, and enable the MUX. Function table: for ABC = 000 to 111 the MUX selects D0 to D7 in turn, so output Y = F(A,B,C) (Y = 1 exactly for the minterms whose Di is tied to 1).
Using Karnaugh map minimize the following POS expression: (B + C + D)(A + B + C' + D)(A' + B + C + D')(A + B' + C + D)(A' + B' + C + D)
Zeros (maxterms): B+C+D gives 0000 and 1000 (M0, M8); A+B+C'+D = M2 (0010); A'+B+C+D' = M9 (1001); A+B'+C+D = M4 (0100); A'+B'+C+D = M12 (1100). Zeros at 0, 2, 4, 8, 9, 12. Groups: M0, M4, M12, M8 (column CD = 00) gives (C + D); M0, M2 gives (A + B + D); M8, M9 gives (A' + B + C). Minimum POS: F = (C + D)(A + B + D)(A' + B + C).
Draw the function table of 8-to-3 Encoder.
Inputs D0-D7 (only one active at a time), outputs A2 A1 A0: D0 -> 000, D1 -> 001, D2 -> 010, D3 -> 011, D4 -> 100, D5 -> 101, D6 -> 110, D7 -> 111. Equations: A0 = D1+D3+D5+D7, A1 = D2+D3+D6+D7, A2 = D4+D5+D6+D7.
Map the following POS expression on a karnaugh map: (A' + B' + C + D)(A' + B + C' + D')(A + B + C' + D)(A' + B' + C' + D')(A + B + C' + D')
Each sum term is 0 where its uncomplemented variables are 0 and complemented variables are 1. (A'+B'+C+D) -> ABCD = 1100 (cell 12); (A'+B+C'+D') -> 1011 (cell 11); (A+B+C'+D) -> 0010 (cell 2); (A'+B'+C'+D') -> 1111 (cell 15); (A+B+C'+D') -> 0011 (cell 3). Place 0s in cells 2, 3, 11, 12 and 15 of the 4-variable K-map (rows AB, columns CD in Gray order) and 1s in all other cells. With AB rows 00,01,11,10 and CD columns 00,01,11,10: AB=00: 1 1 0 0; AB=01: 1 1 1 1; AB=11: 0 1 0 1; AB=10: 1 1 0 1.
Simplify the following Boolean expressions, using Boolean Algebraic rules: (i) (A+B)(A+B') (ii) (A+B)'(A'+B')'
(i) (A+B)(A+B') = A + BB' (distributive rule) = A + 0 = A. (ii) By DeMorgan, (A+B)' = A'B' and (A'+B')' = AB, so the product is A'B'AB = (AA')(BB') = 0.