Fundamentals
Simplification Techniques
Data processing Ckts
flip flops & Registers
sequential ckts:Counters
10

If V1=0 Volts  V2= -5Volts , in Positive logic system the voltage value of logic 1 is 

0 Volts

10

Tabular method of simplification is also called 

Quine MacKlusky ( QM ) Method

10

Multiplexer is also called 

Universal logic ckt

10

The even parity bit generated for the input :10011 is

1

10

Synchronous counter is faster in operation compared to ripple counter ( T/F)

False

20

Demorgans first law states that 

complement of product is equal to sum of complements

20

It is group of 8 adjacent ones in the K Map 

Octate

20

Decoder is same as demux except the

data input

20

In SR FF this state is forbidden 

S=R=1

20

Mod 7 counter has these many states

7 states

30

Basic gates are 

AND, OR and NOT gates

30

Magnitude comparator is combinational ckt(True/False)

True

30

The even parity bit generated for the input :10011 is

1

30

When T input is 1 output of T FF 

Toggles

30

The number of FF required to count from 0 to 8 is 

4

40

This gate is also called equivalence gate

Exnor gate

40

First step in QM method is determination of prime implicants and second step is to find 

essential prime implicants

40

To realize 16X 1 Mux  the number of 2X1 Mux required is

15

40

By shorting both J and K equal to 1  we get this flipflop

 Toggle FF

40

Frequency divider is an application of 

counter

50

Dual of Relation  A= A + 0  is 

A= A.1

50

Quad  in K Map eliminates 

2 variables

50

16 X 1 Multiplexer has these many control lines

4

50

Flip flops having single input other than clock are 

Toggle   FF and Data FF

50

clock is nothing but 

square waveform

M
e
n
u