Explore topic-wise InterviewSolutions in .

A clock is a periodic train of pulses or square waves which acts as a control signal. The output changes state only when clock makes transition.

A flip flop is a bistable multivibrator which has two stable states. It is a basic memory element which can store one bit information.

Yes Flip flop is a bistable device.

Combinational logic circuits are circuits whose output level at any instant of time is dependent only on present levels of inputs at that time. These circuits do not have memory.

Sequential logic circuits are those circuits whose output levels at any instant of time depend not only on the present input state but also on previous input states. These circuits have memory.

Sequential logic circuits are those circuits whose output level depends on present levels of input and previous input levels.

(i) Transfer and storage of data.

(ii) Frequency division.

(iii) Counters

(iv) Detection of input sequence of data.

The logic gate whose output is high only when odd number of inputs are high is known as an XOR gate.

Three variables.

NOR gate is the universal gate used to realize OR-AND logic.

Extended Binary Coded Decimal Interchange Code.

NAND gate is the universal gate used to realize AND-OR logic.

(i) SR flip flop

(ii) D flip flop

(iii) JKflip flop

(iv) Master-Slave JK flip flop.

Excess-3 code is a non-weighted self complementing code. It is obtained by adding 3 to each digit in decimal number. BCD code is a weighted code. Each decimal number is represented by a separate group of four bits.

The truth table for the expression Y = A\(\bar B\) + \(\bar A\)B:

There are four zone bits in EBCDIC.

Half adder is a logic circuit which adds two bits and gives to outputs sum and carry.

The Boolean expression for the carry of half adder is AB.

A ⊕ B ⊕ C_in.

\(A\,\oplus\,B=A\bar B\,+\,\bar AB\)

Full adder is a combinational logic circuit that performs arithmetic sum of three input bits and gives as output sum and carry.

An octet is a group of eight adjacent Is either in two rows or two columns in a K map.

Two variables.

C_o = AB + BC_in + C_in A.

Half subtractor is a combinational logic circuit which performs the subtraction of two bits and gives difference and borrow.

The Boolean expression for difference of half subtractor is A ⊕ B.

Quad is a group of four adjacent 1 s in a K-map.

One variable.

Karnaugh map is a graphical method of simplification of Boolean expression.

The Boolean expression for borrow of half subtractor is \(\bar AB\).

Y = AB + \(\bar C\) = AB(C + \(\bar C\)) + \(\bar C\)(A + \(\bar A\))(B + \(\bar B\))

= ABC + AB\(\bar C\) + (\(\bar C\)A + \(\bar C\)\(\bar A\))(B + \(\bar B\))

= ABC + AB\(\bar C\) + \(\bar C\)AB + \(\bar C\)A\(\bar B\) + \(\bar C\)\(\bar A\)B + \(\bar C\)\(\bar B\)\(\bar A\)

= \(\bar A\)\(\bar B\)\(\bar C\) + \(\bar A\)B\(\bar C\) + A\(\bar B\)\(\bar C\) + AB\(\bar C\) + ABC.

The Boolean expression containing all the input variables either in complemented or uncomplemented form in each of sum term is known as canonical POS expression.

Excess-3 code, Gray code.

Digital codes are used to represent analog information.

The Boolean expression containing all input variables in each of product term either in complemented or uncomplemented form is known as canonical sum of products expression.

It is an equation containing all input variables either in complemented or uncomplemented form in each of sum term.

It is an equation containing all input variables in each of product term either in complemented or uncomplemented form.

SOP equation is equation containing all the input variables in each of product term either in complemented or uncomplemented form.

POS equation is the equation containing all the input variables either in complemented or uncomplemented form in each of sum term.

BCD is a numeric code in which each digit of a decimal number is represented by a four bit binary number.

The answer is Two.

8421 code, 2421 code.

Full adder is combinational circuit which adds three bits and gives sum and carry. Half adder adds two bits and gives sum and carry.

Excess-3 code.

ASCII code, EBCDIC code.

Max term is a special case sum (OR) term containing all the input variables that make up a Boolean expression.

Min term is a special case product (AND) term containing all the input variables that make up a Boolean expression.

Y = (A + C)(B + \(\bar C\))

= (A + O + C)(O + B + \(\bar C\))

= (A + B\(\bar B\) + C)(A\(\bar A\) + B + \(\bar C\))

= (A + B + C)(A + \(\bar B\) + C)(A + B + \(\bar C\))(\(\bar A\) + B + \(\bar C\))

The answer is Three.