Paper Tayyari

Final Term PreparationFinal term ki tayyari

Syllabus: lectures 23–45. Past-paper MCQs are shown first.Syllabus: lecture 23–45. Past paper ki MCQs pehle dikhai gayi hain.

188 MCQs · 78 short · 42 long questions · 188 MCQs from past papers188 MCQs · 78 short · 42 long sawal · 188 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/188
– correctsahi
1.
★ Final term past paperLecture 23

At S = 0 and R = 1, an active-HIGH SR latch is in __________ condition.

  1. ASET
  2. BRESET
  3. CInvalid
  4. DNo change

R = 1 with S = 0 resets an active-HIGH latch so Q = 0.

2.
★ Final term Spring 2011Lecture 25

The _____________ input overrides the ________ input

  1. AAsynchronous, synchronous
  2. BSynchronous, asynchronous
  3. CPreset input (PRE), Clear input (CLR)
  4. DClear input (CLR), Preset input (PRE)

Asynchronous inputs (PRE, CLR) act immediately and override the synchronous, clocked inputs.

3.
★ Final term Spring 2011Lecture 25

___________ is one of the examples of synchronous inputs.

  1. AJ-K input
  2. BEN input
  3. CPreset input (PRE)
  4. DClear Input (CLR)

J-K inputs affect the output only on the clock edge, so they are synchronous inputs.

4.
★ Final term past paperLecture 25

What will be output state when J = 1, K = 0 and CLR input is active?

  1. AQ = 1
  2. BQ = 0
  3. CRetains previous output state
  4. DToggle output

The asynchronous clear overrides J and K and forces Q = 0.

5.
★ Final term past paperLecture 25

When PRE' = 0 and CLR' =1, Qt = 0 then Q(t+1) will be __________

  1. AOutput of flip-flop will be set (Logic 1)
  2. BOutput of flip-flop will be reset (Logic 0)
  3. COutput of flip-flop will be invalid
  4. DFlip-flop will change output on Clock transition

Active-LOW PRE' = 0 with CLR' inactive asynchronously sets Q = 1.

6.
★ Final term past paperLecture 29

A 4-bit UP/DOWN counter is in DOWN mode and in the 1010 state. On the next clock pulse, to what state does the counter go?

  1. A1001
  2. B1011
  3. C0011
  4. D1100

Counting down from 1010 (10) gives 1001 (9).

7.
★ Final term past paperLecture 29

A 4-bit binary up/down counter is in the binary state of zero. The next state in the DOWN mode is:

  1. A0001
  2. B1000
  3. C1110
  4. D1111

Counting down from 0000 wraps around to 1111.

8.
★ Final term past paperLecture 29

A 4-bit binary up/down counter is in the binary state of zero. The next state in the UP mode is

  1. A0001
  2. B1000
  3. C1110
  4. D1111

Counting up from 0000 gives 0001.

9.
★ Final term Spring 2011Lecture 29

Consider an up/down counter that counts between 0 and 15, if external input(X) is “0” the counter counts upward (0000 to 1111) and if external input (X) is “1” the counter counts downward (1111 to 0000), now suppose that the present state is “1100” and X=1, the next state of the counter will be ___________

  1. A0000
  2. B1101
  3. C1011
  4. D1111

X = 1 means count down, so 1100 (12) goes to 1011 (11).

10.
★ Final term Spring 2011Lecture 30

The divide-by-60 counter in digital clock is implemented by using two cascading counters:

  1. AMod-6, Mod-10
  2. BMod-50, Mod-10
  3. CMod-10, Mod-50
  4. DMod-50, Mod-6

A divide-by-60 is a Mod-10 counter cascaded with a Mod-6 counter (10 x 6 = 60).

11.
★ Final term Spring 2010Lecture 30

THE HOURS COUNTER IS IMPLEMENTED USING __________

  1. AONLY A SINGLE MOD-12 COUNTER IS REQUIRED
  2. BMOD-10 AND MOD-6 COUNTERS
  3. CMOD-10 AND MOD-2 COUNTERS
  4. DA SINGLE DECADE COUNTER AND A FLIP-FLOP

The hours counter (1-12) is a decade counter plus one flip-flop for the tens digit.

12.
★ Final term Spring 2011Lecture 33

________ is used to simplify the circuit that determines the next state.

  1. AState diagram
  2. BNext state table
  3. CState reduction
  4. DState assignment

Good state assignment simplifies the next-state logic; state reduction only cuts the number of states.

13.
★ Final term Spring 2010Lecture 33

The best state assignment tends to ___________.

  1. AMaximizes the number of state variables that don’t change in a group of related states
  2. BMinimizes the number of state variables that don’t change in a group of related states
  3. CMinimize the equivalent states
  4. DNone of given options

A good assignment keeps as many state variables as possible unchanged in related states.

14.
★ Final term Spring 2010Lecture 42

The high density FLASH memory cell is implemented using ______________

  1. A1 floating-gate MOS transistor
  2. B2 floating-gate MOS transistors
  3. C4 floating-gate MOS transistors
  4. D6 floating-gate MOS transistors

A high-density flash cell is a single floating-gate MOS transistor.

15.
★ Final term past paper

A stage in the shift register consists of

  1. Aa latch
  2. Ba flip flop
  3. Ca byte of storage
  4. Dfour bits of storage

Each stage of a shift register is one flip-flop that stores one bit.

16.
★ Final term past paper

When an eight bit serial in / serial out shift register is used for a 24 micro seconds time delay, the clock frequency must be

  1. A41.67 KHz
  2. B333 KHz
  3. C125 KHz
  4. D8 MHz

An 8-stage register delays data by 8 clock periods, so T = 24 us / 8 = 3 us and f = 1/3 us = 333 kHz.

17.
★ Final term past paper

Divide-by-160 counter is achieved by using

  1. AFlip-Flop and DIV 10
  2. BFlip-Flop and DIV 16
  3. CDIV 16 and DIV 32
  4. DDIV 16 and DIV 10

Cascading a divide-by-16 and a divide-by-10 counter gives 16 x 10 = 160.

18.
★ Final term past paper

In moore machine the output depends on

  1. Athe current state and the output of previous flip flop
  2. Bonly inputs
  3. Cthe current state
  4. Dthe current state and inputs

In a Moore machine the outputs are a function of the present state only.

19.
★ Final term past paper

A divide-by-10 Johnson counter requires

  1. Aten flip-flops
  2. Bfour flip-flops
  3. Cfive flip-flops
  4. Dtwelve flip-flops

An n-bit Johnson counter has 2n states, so divide-by-10 needs 5 flip-flops.

20.
★ Final term past paper

Three cascaded modulus-10 counters have an overall modulus of

  1. A30
  2. B100
  3. C1000
  4. D10000

Cascaded moduli multiply: 10 x 10 x 10 = 1000.

21.
★ Final term past paper

A divide-by-10 ring counter requires a minimum of

  1. Aten flip-flops
  2. Bfive flip-flops
  3. Cfour flip-flops
  4. Dtwelve flip-flops

A ring counter has one state per flip-flop, so divide-by-10 needs ten flip-flops.

22.
★ Final term past paper

Number of states in an 8-bit Johnson counter sequence are:

  1. A8
  2. B12
  3. C14
  4. D16

An n-bit Johnson counter has 2n states, so 8 bits give 16 states.

23.
★ Final term past paper

In designing any counter the transition from a current state to the next sate is determined by

  1. ACurrent state and inputs
  2. BOnly inputs
  3. COnly current state
  4. Dcurrent state and outputs

The next state is a function of the present state and the external inputs.

24.
★ Final term past paper

In a 4-bit binary counter, the next state after the terminal count in the DOWN mode is __________

  1. A0000
  2. B1111
  3. C0001
  4. D10000

In DOWN mode the terminal count is 0000, and the next count wraps around to 1111.

25.
★ Final term past paper

Divide-by-32 counter can be achieved by using

  1. AFlip-Flop and DIV 10
  2. BFlip-Flop and DIV 16
  3. CFlip-Flop and DIV 32
  4. DDIV 16 and DIV 32

A flip-flop divides by 2, so 2 x 16 = 32.

26.
★ Final term past paper

Design of state diagram is one of many steps used to design

  1. Aa clock
  2. Ba truncated counter
  3. Can UP/DOWN counter
  4. Dany counter

Drawing the state diagram is the first step in designing any (synchronous) counter.

27.
★ Final term past paper

An Astable multivibrator is known as a(n) _____

  1. AOscillator
  2. BBooster
  3. COne-shot
  4. DDual-shot

An astable multivibrator has no stable state and runs freely as an oscillator.

28.
★ Final term past paper

A decade counter is ________

  1. AMod-3 counter
  2. BMod-5 counter
  3. CMod-8 counter
  4. DMod-10 counter

A decade counter has ten states, so it is a Mod-10 counter.

29.
★ Final term past paper

The terminal count of a 4-bit binary counter in the DOWN mode is __________

  1. A0000
  2. B0011
  3. C1100
  4. D1111

Counting down, the last state before wrap-around is 0000.

30.
★ Final term past paper

The Synchronous counters are also known as Ripple Counters:

  1. ATrue
  2. BFalse

Ripple counters are asynchronous; in synchronous counters all flip-flops share the clock.

31.
★ Final term past paper

__________ occurs when the same clock signal arrives at different times at different clock inputs due to propagation delay.

  1. ARace condition
  2. BClock Skew
  3. CRipple Effect
  4. DNone of given options

Clock skew is the difference in arrival time of the same clock at different flip-flops.

32.
★ Final term past paper

When the number of states are reduced during the design any counter

  1. Aoutput changes and Input remain unchanged
  2. BInput changes and output remain unchanged
  3. CInput and output bith change
  4. DInput and output remain unchanged

State reduction removes equivalent states without changing the input-output behaviour.

33.
★ Final term past paper

To parallel load a byte of data into a shift register, there must be

  1. Aone clock pulse
  2. Bone clock pulse for each 1 in the data
  3. Ceight clock pulse
  4. Done clock pulse for each 0 in the data

In parallel load all bits enter at the same time on a single clock pulse.

34.
★ Final term past paper

With a 100 KHz clock frequency, eight bits can be serially entered into a shift register in

  1. A80 micro seconds
  2. B8 micro seconds
  3. C80 mili seconds
  4. D10 micro seconds

Each clock period is 10 us, so 8 bits need 8 x 10 us = 80 us.

35.
★ Final term past paper

Once the state diagram is drawn for any sequential circuit the next step is to draw

  1. ATransiation table
  2. BKarnaugh map
  3. CNext-state table
  4. DLogic expression

After the state diagram, the next-state table is written from it.

36.
★ Final term past paper

A modulus-14 counter has fourteen states requiring _____________

  1. A14 Flip Flops
  2. B14 Registers
  3. C4 Flip Flops
  4. D4 Registers

4 flip-flops give 16 states, the fewest that cover 14.

37.
★ Final term Spring 2011

A 8-bit serial in / parallel out shift register contains the value “8”, _____ clock signal(s) will be required to shift the value completely out of the register.

  1. A1
  2. B2
  3. C4
  4. D8

Each clock pulse shifts one bit out, so all 8 bits of the register need 8 clock pulses.

38.
★ Final term Spring 2011

In a sequential circuit the next state is determined by ________ and _______

  1. AState variable, current state
  2. BCurrent state, flip-flop output
  3. CCurrent state and external input
  4. DInput and clock signal applied

The next state is a function of the present state and the external inputs.

39.
★ Final term Spring 2011

In NOR gate based S-R latch if both S and R inputs are set to logic 0, the previous output state is maintained.

  1. ATrue
  2. BFalse

With S = R = 0 a NOR-based S-R latch is in its no-change (hold) condition.

40.
★ Final term Spring 2011

74HC163 has two enable input pins which are _______ and _________

  1. AENP, ENT
  2. BENI, ENC
  3. CENP, ENC
  4. DENT, ENI

The 74HC163 counter has two count-enable inputs, ENP and ENT.

41.
★ Final term Spring 2011

____________ is said to occur when multiple internal variables change due to change in one input variable

  1. AClock Skew
  2. BRace condition
  3. CHold delay
  4. DHold and Wait

A race condition is when several internal variables change because of a change in one input.

42.
★ Final term Spring 2011

In asynchronous transmission when the transmission line is idle, _________

  1. AIt is set to logic low
  2. BIt is set to logic high
  3. CRemains in previous state
  4. DState of transmission line is not used to start transmission

In asynchronous serial transmission the line idles at logic high until a start bit (low) is sent.

43.
★ Final term Spring 2011

A Nibble consists of _____ bits

  1. A2
  2. B4
  3. C8
  4. D16

A nibble is half a byte, 4 bits.

44.
★ Final term Spring 2011

Excess-8 code assigns _______ to “-8”

  1. A1110
  2. B1100
  3. C1000
  4. D0000

Excess-8 adds 8 to the value, so -8 + 8 = 0 = 0000.

45.
★ Final term Spring 2011

The voltage gain of the Inverting Amplifier is given by the relation ________

  1. AVout / Vin = - Rf / Ri
  2. BVout / Rf = - Vin / Ri
  3. CRf / Vin = - Ri / Vout
  4. DRf / Vin = Ri / Vout

For an inverting op-amp amplifier the gain is Vout/Vin = -Rf/Ri.

46.
★ Final term Spring 2011

LUT is acronym for _________

  1. ALook Up Table
  2. BLocal User Terminal
  3. CLeast Upper Time Period
  4. DNone of given options

LUT stands for Look Up Table.

47.
★ Final term Spring 2011

The total amount of memory that is supported by any digital system depends upon ______

  1. AThe organization of memory
  2. BThe structure of memory
  3. CThe size of decoding unit
  4. DThe size of the address bus of the microprocessor

An n-bit address bus can address 2^n locations, which sets the maximum memory size.

48.
★ Final term Spring 2011

Stack is an acronym for _________

  1. AFIFO memory
  2. BLIFO memory
  3. CFlash Memory
  4. DBust Flash Memory

A stack is Last In, First Out (LIFO) memory.

49.
★ Final term Spring 2011

Addition of two octal numbers “36” and “71” results in ________

  1. A213
  2. B123
  3. C127
  4. D345

6+1 = 7; 3+7 = 10 decimal = 12 octal, so the octal sum is 127.

50.
★ Final term Spring 2011

In a state diagram, the transition from a current state to the next state is determined by

  1. ACurrent state and the inputs
  2. BCurrent state and outputs
  3. CPrevious state and inputs
  4. DPrevious state and outputs

The next state in a state diagram depends on the current state and the inputs.

51.
★ Final term Spring 2011

Assume that a 4-bit serial in/serial out shift register is initially clear. We wish to store the nibble 1100. What will be the 4-bit pattern after the second clock pulse? (Right-most bit first.)

  1. A1100
  2. B0011
  3. C0000
  4. D1111

Right-most bit first, the first two bits entered are 0 and 0, so the register still holds 0000.

52.
★ Final term Spring 2011

The operation of J-K flip-flop is similar to that of the SR flip-flop except that the J-K flip-flop ___________

  1. ADoesn’t have an invalid state
  2. BSets to clear when both J = 0 and K = 0
  3. CIt does not show transition on change in pulse
  4. DIt does not accept asynchronous inputs

With J = K = 1 the J-K flip-flop toggles, so it has no invalid state unlike the S-R flip-flop.

53.
★ Final term Spring 2011

A multiplexer with a register circuit converts _________

  1. ASerial data to parallel
  2. BParallel data to serial
  3. CSerial data to serial
  4. DParallel data to parallel

The multiplexer, stepped by the register/counter, puts parallel bits out one at a time as serial data.

54.
★ Final term Spring 2011

A GAL is essentially a ________.

  1. ANon-reprogrammable PAL
  2. BPAL that is programmed only by the manufacturer
  3. CVery large PAL
  4. DReprogrammable PAL

A GAL is an electrically erasable, reprogrammable PAL.

55.
★ Final term Spring 2011

in ____________, all the columns in the same row are either read or written.

  1. ASequential Access
  2. BMOS Access
  3. CFAST Mode Page Access
  4. DNone of given options

In fast page mode access a whole row is opened and its columns are read or written in turn.

56.
★ Final term Spring 2011

In order to synchronize two devices that consume and produce data at different rates, we can use _________

  1. ARead Only Memory
  2. BFist In First Out Memory
  3. CFlash Memory
  4. DFast Page Access Mode Memory

A FIFO buffer lets a fast producer and a slow consumer exchange data at different rates.

57.
★ Final term Spring 2011

A positive edge-triggered flip-flop changes its state when ________________

  1. ALow-to-high transition of clock
  2. BHigh-to-low transition of clock
  3. CEnable input (EN) is set
  4. DPreset input (PRE) is set

A positive edge-triggered flip-flop responds to the low-to-high clock transition.

58.
★ Final term Spring 2010

A frequency counter ______________

  1. ACounts pulse width
  2. BCounts no. of clock pulses in 1 second
  3. CCounts high and low range of given clock pulse
  4. DNone of given options

A frequency counter counts the number of pulses in one second.

59.
★ Final term Spring 2010

Flip flops are also called _____________

  1. ABi-stable dualvibrators
  2. BBi-stable transformer
  3. CBi-stable multivibrators
  4. DBi-stable singlevibrators

Flip-flops have two stable states, so they are bistable multivibrators.

60.
★ Final term Spring 2010

DRAM stands for __________

  1. ADynamic RAM
  2. BData RAM
  3. CDemoduler RAM
  4. DNone of given options

DRAM stands for Dynamic RAM.

61.
★ Final term Spring 2010

The expression F=A+B+C describes the operation of three bits _____ Gate.

  1. AOR
  2. BAND
  3. CNOT
  4. DNAND

A + B + C is the OR of three inputs.

62.
★ Final term Spring 2010

The ANSI/IEEE Standard 754 defines a __________Single-Precision Floating Point format for binary numbers.

  1. A8-bit
  2. B16-bit
  3. C32-bit
  4. D64-bit

IEEE 754 single precision uses 32 bits (1 sign, 8 exponent, 23 mantissa).

63.
★ Final term Spring 2010

The decimal “17” in BCD will be represented as _________

  1. A11101
  2. B11011
  3. C10111
  4. D11110

17 = 0001 0111 in BCD, which is 10111 without the leading zeros.

64.
★ Final term Spring 2010

The basic building block for a logical circuit is _______

  1. AA Flip-Flop
  2. BA Logical Gate
  3. CAn Adder
  4. DNone of given options

Logic gates are the basic building blocks of digital circuits.

65.
★ Final term Spring 2010

The output of the expression F=A.B.C will be Logic ________ when A=1, B=0, C=1.

  1. AUndefined
  2. BOne
  3. CZero
  4. DNo Output as input is invalid.

B = 0 makes the product A.B.C equal to 0.

66.
★ Final term Spring 2010

________ is used to minimize the possible no. of states of a circuit.

  1. AState assignment
  2. BState reduction
  3. CNext state table
  4. DState diagram

State reduction removes equivalent states to minimise the number of states.

67.
★ Final term Spring 2010

5-bit Johnson counter sequences through ____ states

  1. A7
  2. B10
  3. C32
  4. D25

An n-bit Johnson counter has 2n states, so 5 bits give 10 states.

68.
★ Final term Spring 2010

The address from which the data is read, is provided by _______

  1. ADepends on circuitry
  2. BNone of given options
  3. CRAM
  4. DMicroprocessor

The microprocessor puts the address of the location to be read on the address bus.

69.
★ Final term Spring 2010

FIFO is an acronym for __________

  1. AFirst In, First Out
  2. BFly in, Fly Out
  3. CFast in, Fast Out
  4. DNone of given options

FIFO means First In, First Out.

70.
★ Final term Spring 2010

______ of a D/A converter is determined by comparing the actual output of a D/A converter with the expected output.

  1. AResolution
  2. BAccuracy
  3. CQuantization
  4. DMissing Code

Accuracy compares the actual DAC output with the expected output.

71.
★ Final term Spring 2010

The sequence of states that are implemented by a n-bit Johnson counter is

  1. An+2 (n plus 2)
  2. B2n (n multiplied by 2)
  3. C2^n (2 raise to power n)
  4. Dn^2 (n raise to power 2)

A Johnson counter of n flip-flops goes through 2n states.

72.
★ Final term Spring 2010

"A + B = B + A" is __________

  1. ADemorgan’s Law
  2. BDistributive Law
  3. CCommutative Law
  4. DAssociative Law

Changing the order of OR-ed variables does not change the result: the commutative law.

73.
★ Final term Spring 2010

An alternate method of implementing Comparators which allows the Comparators to be easily cascaded without the need for extra logic gates is _______

  1. AUsing a single comparator
  2. BUsing Iterative Circuit based Comparators
  3. CConnecting comparators in vertical hierarchy
  4. DExtra logic gates are always required.

Iterative comparators pass results stage to stage, so they cascade without extra gates.

74.
★ Final term Spring 2010

Demultiplexer is also called

  1. AData selector
  2. BData router
  3. CData distributor
  4. DData encoder

A demultiplexer distributes one input to one of many outputs, so it is a data distributor.

75.
★ Final term Spring 2010

A flip-flop is connected to +5 volts and it draws 5 mA of current during its operation, the power dissipation of the flip-flop is

  1. A10 mW
  2. B25 mW
  3. C64 mW
  4. D1024

P = V x I = 5 V x 5 mA = 25 mW.

76.
★ Final term Spring 2010

____________ counters as the name indicates are not triggered simultaneously.

  1. AAsynchronous
  2. BSynchronous
  3. CPositive-Edge triggered
  4. DNegative-Edge triggered

In asynchronous (ripple) counters the flip-flops are not clocked at the same time.

77.
★ Final term Spring 2010

A synchronous decade counter will have _______ flip-flops

  1. A3
  2. B4
  3. C7
  4. D10

Ten states need 4 flip-flops (2^4 = 16 >= 10).

78.
★ Final term Spring 2010

The alternate solution for a demultiplexer-register combination circuit is _________

  1. AParallel in / Serial out shift register
  2. BSerial in / Parallel out shift register
  3. CParallel in / Parallel out shift register
  4. DSerial in / Serial Out shift register

A serial in/parallel out shift register does the same serial-to-parallel job as a demultiplexer with a register.

79.
★ Final term Spring 2010

The storage cell in SRAM is

  1. Aa flip –flop
  2. Ba capacitor
  3. Ca fuse
  4. Da magnetic domain

An SRAM cell is a flip-flop (latch); a capacitor is the DRAM storage cell.

80.
★ Final term Spring 2010

What is the difference between a D latch and a D flip-flop?

  1. AThe D latch has a clock input.
  2. BThe D flip-flop has an enable input.
  3. CThe D latch is used for faster operation.
  4. DThe D flip-flop has a clock input.

A D latch is level-enabled, while a D flip-flop has an edge-triggered clock input.

81.
★ Final term Spring 2010

For a positive edge-triggered J-K flip-flop with both J and K HIGH, the outputs will______ if the clock goes HIGH.

  1. Atoggle
  2. Bset
  3. Creset
  4. Dnot change

With J = K = 1 the J-K flip-flop toggles on each active clock edge.

82.
★ Final term Spring 2010

The OR gate performs Boolean ___________.

  1. Amultiplication
  2. Bsubtraction
  3. Cdivision
  4. Daddition

The OR operation is Boolean addition.

83.
★ Final term Spring 2010

If an S-R latch has a 1 on the S input and a 0 on the R input and then the S input goes to 0, the latch will be

  1. Aset
  2. Breset
  3. Cinvalid
  4. Dclear

S = 1, R = 0 sets the latch; when S returns to 0 (S = R = 0) it stays set.

84.
★ Final term Spring 2010

Determine the values of A, B, C, and D that make the sum term A(bar) + B+C(bar)+D equal to zero.

  1. AA = 1, B = 0, C = 0, D = 0
  2. BA = 1, B = 0, C = 1, D = 0
  3. CA = 0, B = 1, C = 0, D = 0
  4. DA = 1, B = 0, C = 1, D = 1

The sum term is 0 only if every literal is 0: A' = 0, B = 0, C' = 0, D = 0, so A = 1, B = 0, C = 1, D = 0.

85.
★ Final term Spring 2010

AT T0 THE VALUE STORED IN A 4-BIT LEFT SHIFT WAS “1”. WHAT WILL BE THE VALUE OF REGISTER AFTER THREE CLOCK PULSES?

  1. A2
  2. B4
  3. C6
  4. D8

Each left shift doubles the value: 1, 2, 4, 8 after three pulses.

86.
★ Final term Spring 2010

WHEN BOTH THE INPUTS OF EDGE-TRIGGERED J-K FLOP-FLOP ARE SET TO LOGIC ZERO _________

  1. ATHE FLOP-FLOP IS TRIGGERED
  2. BQ=0 AND Q’=1
  3. CQ=1 AND Q’=0
  4. DTHE OUTPUT OF FLIP-FLOP REMAINS UNCHANGED

J = K = 0 is the no-change condition, so the output stays the same.

87.
★ Final term Spring 2010

If S=1 and R=0, then Q(t+1) = _________ for positive edge triggered flip-flop

  1. A0
  2. B1
  3. CInvalid
  4. DInput is invalid

S = 1, R = 0 sets the flip-flop, so Q(t+1) = 1.

88.
★ Final term Spring 2010

If S=1 and R=1, then Q(t+1) = _________ for negative edge triggered flip-flop

  1. A0
  2. B1
  3. CInvalid
  4. DInput is invalid

S = R = 1 is the invalid (not allowed) condition of an S-R flip-flop.

89.
★ Final term Spring 2010

A counter is implemented using three (3) flip-flops, possibly it will have ________ maximum output status.

  1. A3
  2. B7
  3. C8
  4. D15

Three flip-flops give at most 2^3 = 8 states.

90.
★ Final term Spring 2010

In ________ Q output of the last flip-flop of the shift register is connected to the data input of the first flip-flop of the shift register.

  1. AMoore machine
  2. BMeally machine
  3. CJohnson counter
  4. DRing counter

In a ring counter the true Q output of the last stage feeds the first stage's data input.

91.
★ Final term Spring 2010

The _________ of a ROM is the time it takes for the data to appear at the Data Output of the ROM chip after an address is applied at the address input lines

  1. AWrite Time
  2. BRecycle Time
  3. CRefresh Time
  4. DAccess Time

Access time is the delay from applying an address to valid data at the output.

92.
★ Final term Spring 2010

Bi-stable devices remain in either of their _________ states unless the inputs force the device to switch its state

  1. ATen
  2. BEight
  3. CThree
  4. DTwo

Bistable devices have two stable states.

93.
★ Final term Spring 2010

The alternate solution for a multiplexer and a register circuit is _________

  1. AParallel in / Serial out shift register
  2. BSerial in / Parallel out shift register
  3. CParallel in / Parallel out shift register
  4. DSerial in / Serial Out shift register

A parallel in/serial out shift register converts parallel data to serial like a multiplexer with a register.

94.
★ Final term Spring 2010

A full-adder has a Cin = 0. What are the sum (Σ) and the carry (Cout) when A = 1 and B = 1?

  1. AΣ = 0, Cout = 0
  2. BΣ = 0, Cout = 1
  3. CΣ = 1, Cout = 0
  4. DΣ = 1, Cout = 1

1 + 1 + 0 = 10 in binary, so Sum = 0 and Cout = 1.

95.
★ Final term Spring 2010

The design and implementation of synchronous counters start from _________

  1. ATruth table
  2. Bk-map
  3. Cstate table
  4. Dstate diagram

Synchronous counter design starts from the state diagram.

96.
★ Final term Spring 2010

Q2 :=Q1 OR X OR Q3 The above ABEL expression will be

  1. AQ2:= Q1 $ X $ Q3
  2. BQ2:= Q1 # X # Q3
  3. CQ2:= Q1 & X & Q3
  4. DQ2:= Q1 ! X ! Q3

In ABEL the OR operator is #.

97.
★ Final term Fall 2009

Demultiplexer converts _______ data to __________ data

  1. AParallel data, serial data
  2. BSerial data, parallel data
  3. CEncoded data, decoded data
  4. DAll of the given options.

A demultiplexer sends serial data on one line to many outputs, giving parallel data.

98.
★ Final term Fall 2009

In asynchronous digital systems all the circuits change their state with respect to a common clock

  1. ATrue
  2. BFalse

In asynchronous systems circuits do not change state with a common clock.

99.
★ Final term Fall 2009

A negative edge-triggered flip-flop changes its state when ________________

  1. AEnable input (EN) is set
  2. BPreset input (PRE) is set
  3. CLow-to-high transition of clock
  4. DHigh-to-low transition of clock

A negative edge-triggered flip-flop responds to the high-to-low clock transition.

100.
★ Final term Fall 2009

A divide-by-50 counter divides the input ______ signal to a 1 Hz signal.

  1. A10 Hz
  2. B50 Hz
  3. C100 Hz
  4. D500 Hz

A 50 Hz signal divided by 50 gives 1 Hz.

101.
★ Final term Fall 2009

Which is not characteristic of a shift register?

  1. ASerial in/parallel in
  2. BSerial in/parallel out
  3. CParallel in/serial out
  4. DParallel in/parallel out

Serial in/parallel in is not a shift register type; the four types are SISO, SIPO, PISO and PIPO.

102.
★ Final term Fall 2009

The output of an XNOR gate is 1 when ____________ I) All the inputs are zero II) Any of the inputs is zero III) Any of the inputs is one IV) All the inputs are one

  1. AI Only
  2. BIV Only
  3. CI and IV only
  4. DII and III only

A 2-input XNOR outputs 1 when the inputs are equal: all 0s or all 1s.

103.
★ Final term Fall 2009

The capability that allows the PLDs to be programmed after they have been installed on a circuit board is called __________

  1. ARadiation-Erase programming method (REPM)
  2. BIn-System Programming (ISP)
  3. CIn-chip Programming (ICP)
  4. DElectronically-Erase programming method(EEPM)

In-System Programming (ISP) lets a PLD be programmed while mounted on the board.

104.
★ Final term Fall 2009

For a gated D-Latch if EN=1 and D=1 then Q(t+1) = _________

  1. A0
  2. B1
  3. CQ(t)
  4. DInvalid

With EN = 1 the gated D latch is transparent, so Q follows D = 1.

105.
★ Final term Fall 2009

In ________ outputs depend only on the combination of current state and inputs.

  1. AMealy machine
  2. BMoore Machine
  3. CState Reduction table
  4. DState Assignment table

In a Mealy machine outputs depend on the current state and the inputs.

106.
★ Final term Fall 2009

In the following statement Z PIN 20 ISTYPE ‘reg.invert’; The keyword “reg.invert” indicates ________

  1. AAn inverted register input
  2. BAn inverted register input at pin 20
  3. CActive-high Registered Mode output
  4. DActive-low Registered Mode output

In ABEL 'reg.invert' declares an active-low registered output.

107.
★ Final term Fall 2009

If the FIFO Memory output is already filled with data then ________

  1. AIt is locked; no data is allowed to enter
  2. BIt is not locked; the new data overwrites the previous data.
  3. CPrevious data is swapped out of memory and new data enters
  4. DNone of given options

When a FIFO is full it is locked and no more data can be entered.

108.
★ Final term Fall 2009

The process of converting the analogue signal into a digital representation (code) is known as ___________

  1. AStrobing
  2. BAmplification
  3. CQuantization
  4. DDigitization

The handout calls converting an analogue value to a digital code quantization.

109.
★ Final term Fall 2009

The output of an XOR gate is zero (0) when __________ I) All the inputs are zero II) Any of the inputs is zero III) Any of the inputs is one IV) All the inputs are one

  1. AI Only
  2. BIV Only
  3. CI and IV only
  4. DII and III only

A 2-input XOR outputs 0 when the inputs are equal: all 0s or all 1s.

110.
★ Final term Fall 2009

The simplest and most commonly used Decoders are the ______ Decoders

  1. An to 2^n
  2. B(n-1) to 2^n
  3. C(n-1) to (2^n-1)
  4. Dn to 2^n-1

The common decoders are n-to-2^n decoders, such as 2-to-4 and 3-to-8.

111.
★ Final term Fall 2009

If the S and R inputs of the gated S-R latch are connected together using a ______gate then there is only a single input to the latch. The input is represented by D instead of S or R (A gated D-Latch)

  1. AAND
  2. BOR
  3. CNOT
  4. DXOR

Feeding R through an inverter from S gives a single D input (gated D latch).

112.
★ Final term Fall 2009

The low to high or high to low transition of the clock is considered to be a(n) ________

  1. AState
  2. BEdge
  3. CTrigger
  4. DOne-shot

A clock transition is called an edge.

113.
★ Final term Fall 2009

RCO Stands for _________

  1. AReconfiguration Counter Output
  2. BReconfiguration Clock Output
  3. CRipple Counter Output
  4. DRipple Clock Output

In the handout RCO stands for Ripple Clock Output.

114.
★ Final term Fall 2009

A transparent mode means _____________

  1. AThe changes in the data at the inputs of the latch are seen at the output
  2. BThe changes in the data at the inputs of the latch are not seen at the output
  3. CPropagation Delay is zero (Output is immediately changed when clock signal is applied)
  4. DInput Hold time is zero (no need to maintain input after clock transition)

A transparent latch passes input changes straight to its output.

115.
★ Final term Fall 2009

In ________ outputs depend only on the current state.

  1. AMealy machine
  2. BMoore Machine
  3. CState Reduction table
  4. DState Assignment table

In a Moore machine outputs depend only on the current state.

116.
★ Final term Fall 2009

Smallest unit of binary data is a ________

  1. ABit
  2. BNibble
  3. CByte
  4. DWord

The bit is the smallest unit of binary data.

117.
★ Final term Fall 2009

Excess-8 code assigns _______ to “+7”

  1. A0000
  2. B1001
  3. C1000
  4. D1111

Excess-8 adds 8, so +7 + 8 = 15 = 1111.

118.
★ Final term Fall 2009

A particular half adder has

  1. A2 INPUTS AND 1 OUTPUT
  2. B2 INPUTS AND 2 OUTPUT
  3. C3 INPUTS AND 1 OUTPUT
  4. D3 INPUTS AND 2 OUTPUT

A half adder has 2 inputs (A, B) and 2 outputs (Sum, Carry).

119.
★ Final term Fall 2009

THE FOUR OUTPUTS OF TWO 4-INPUT MULTIPLEXERS, CONNECTED TO FORM A 16-INPUT MULTIPLEXER, ARE CONNECTED TOGETHER THROUGH A 4-INPUT __________ GATE

  1. AAND
  2. BOR
  3. CNAND
  4. DXOR

The enabled multiplexer outputs are combined with an OR gate to form the single output.

120.
★ Final term Fall 2009

A FIELD-PROGRAMMABLE LOGIC ARRAY CAN BE PROGRAMMED BY THE USER AND NOT BY THE MANUFACTURER.

  1. ATRUE
  2. BFALSE

A field-programmable logic array is programmed by the user.

121.
★ Final term past paper

The counter states or the range of numbers of a counter is determined by the formula. ("n" represents the total number of flip-flops)

  1. A(n raise to power 2 )
  2. B(n raise to power 2 and then minus 1)
  3. C(2 raise to power n)
  4. D(2 raise to power n and then minus 1)

n flip-flops give 2^n distinct counter states.

122.
★ Final term past paper

Asynchronous mean that_____________

  1. AEach flip-flop after the first one is enabled by the output of the preceding flip-flop
  2. BEach flip-flop is enabled by the output of the preceding flip-flop
  3. CEach flip-flop except the last one is enabled by the output of the preceding flip-flop
  4. DEach alternative flip-flop after the first one is enabled by the output of the preceding flip-flop

In an asynchronous counter only the first flip-flop takes the clock; each later one is clocked by the previous output.

123.
★ Final term past paper

A mono-stable device only has a single stable state

  1. ATrue
  2. BFalse

A monostable (one-shot) has one stable state and returns to it after a timed pulse.

124.
★ Final term past paper

When the both inputs of edge-triggered J-K flop-flop are set to logic zero _________

  1. AThe flop-flop is triggered
  2. BQ=0 and Q'=1
  3. CQ=1 and Q'=0
  4. DThe output of flip-flop remains unchanged

J = K = 0 is the no-change (hold) condition.

125.
★ Final term past paper

The terminal count of a 4-bit binary counter in the UP mode is ____________

  1. A1100
  2. B0011
  3. C1111
  4. D0000

Counting up, the last state before wrap-around is 1111.

126.
★ Final term past paper

Each stage of Master-slave flip-flop works at ____ of the clock signal

  1. AEach stage works on complete clock signal
  2. BOne fourth
  3. COne third
  4. DOne half

The master works on one clock level and the slave on the other, each half a cycle.

127.
★ Final term past paper

If a circuit suffers "Clock Skew" problem, the output of circuit can't be guarantied.

  1. ATrue
  2. BFalse

Clock skew makes flip-flops see the clock at different times, so correct output is not guaranteed.

128.
★ Final term past paper

The terminal count of a modulus-13 binary counter is

  1. A0000
  2. B1111
  3. C1101
  4. D1100

A mod-13 counter counts 0 to 12, so its terminal count is 1100.

129.
★ Final term past paper

A Divide-by-20 counter can be acheived by using

  1. AFlip-Flop and DIV 10
  2. BFlip-Flop and DIV 16
  3. CFlip-Flop and DIV 32
  4. DDiv 10 and DIV 16

A flip-flop divides by 2 and with DIV 10 gives 2 x 10 = 20.

130.
★ Final term past paper

To serially shift a byte of data into a shift register, there must be

  1. Aone clock pulse
  2. Bone load pulse
  3. Ceight clock pulses
  4. Done clock pulse for each 1 in the data

Serial shifting moves one bit per clock, so 8 bits need 8 clock pulses.

131.
★ Final term Fall 2006

How many states does a modulus-4 counter have?

  1. A1
  2. B2
  3. C4
  4. D16

The modulus is the number of states, so mod-4 has 4.

132.
★ Final term Fall 2006

How will a serial in/serial out shift register accept data serially?

  1. Aone bit at a time
  2. B8 bits at a time
  3. Conly after a load pulse
  4. Donly after being cleared

Serial input enters one bit per clock pulse.

133.
★ Final term Spring 2006

What is the decimal value of the terminal count of a 4-bit binary counter?

  1. A10
  2. B12
  3. C15
  4. D16

A 4-bit counter counts 0 to 15, so its terminal count is 15.

134.
★ Final term Spring 2006

The 1's complement of 10110111 is __________.

  1. A10110111
  2. B01001011
  3. C01101011
  4. D01001000

Inverting every bit of 10110111 gives 01001000.

135.
★ Final term past paper

For a down counter that counts from (111 to 000), if current state is "101" the next state will be _______

  1. A111
  2. B110
  3. C010
  4. Dnone of given options

The next state after 101 when counting down is 100, which is not listed.

136.
★ Final term past paper

For a gated D-Latch if EN = 1 and D = 1 then Q(t + 1) =

  1. A0
  2. B1
  3. CQ(t)
  4. Dvalid

With the latch enabled, Q follows D, so Q = 1.

137.
★ Final term past paper

The 74HC163 is a 4-bit Synchronous Counter. It has ............ parallel data inputs pins

  1. A2
  2. B4
  3. C6
  4. D8

The 74HC163 has four parallel data inputs D0-D3.

138.
★ Final term past paper

In Synchronous systems, the output of all the digital circuits changes when an enable signal is applied instead of the clock signal.

  1. ATrue
  2. BFalse

In synchronous systems outputs change only with the clock signal.

139.
★ Final term past paper

________ flip-flops are obsolete now.

  1. AEdge-triggered
  2. BMaster-Slave
  3. CT-Flipflop
  4. DD-Flipflop

Master-slave (pulse-triggered) flip-flops have been replaced by edge-triggered types.

140.
★ Final term past paper

If S = 1 and R = 0, then for positive edge triggered flip-flop Q(t + 1) = _________

  1. A0
  2. B1
  3. CInvalid
  4. DInput is invalid

S = 1, R = 0 sets the flip-flop on the clock edge, so Q = 1.

141.
★ Final term past paper

In Master-Slave flip-flop the Clock signal is connected to Slave flip-flop using ________ gate

  1. AAND
  2. BOR
  3. CNOT
  4. DNAND

The slave receives the inverted clock so it acts on the opposite clock level from the master.

142.
★ Final term past paper

An Asynchronous Down-counter is implemented (Using J-K flip-flop) by connecting ______

  1. AQ output of all flip-flops to clock input of next flip-flops
  2. BQ' output of all flip-flops to clock input of next flip-flops
  3. CQ output of all flip-flops to J input of next flip-flops
  4. DQ' output of all flip-flops to K input of next flip-flops

With negative-edge triggered J-K flip-flops, driving each clock from the previous Q' output makes the ripple counter count down.

143.
★ Final term past paper

If S=1 and R=1, for negative edge triggered flip-flop then Q(t+1) = ________

  1. A0
  2. B1
  3. CInvalid
  4. DInput is invalid

S = R = 1 is the invalid condition of an S-R flip-flop.

144.
★ Final term past paper

In Master-Slave flip-flop setup, the master flip flop operates at ________

  1. APositive half cycle of pulse
  2. BNegative half cycle of pulse
  3. CBoth Master-Slave operate simultaneously
  4. DMaster-Slave flip-flop does not operate on pulses, rather it is edge triggered.

The master is enabled while the clock is high; the slave follows on the low half.

145.
★ Final term past paper

When the both inputs of edge-triggered J-K flip-flop are set to logic zero ________

  1. AThe flip-flop is triggered
  2. BQ=0 and Q'=1
  3. CQ=1 and Q'=0
  4. DThe output of flip-flop remains unchanged

J = K = 0 is the no-change condition.

146.
★ Final term past paper

The minimum time required for the input logic levels to remain stable before the clock transition occurs is known as the ________

  1. ASet-up time
  2. BHold time
  3. CPulse Interval time
  4. DPulse Stability time (PST)

Set-up time is the stable interval required before the clock edge.

147.
★ Final term past paper

The 74HC163 is a 4-bit Synchronous Counter. It has ________ data output pins

  1. A2
  2. B4
  3. C6
  4. D8

A 4-bit counter has four outputs QA to QD.

148.
★ Final term past paper

The simplest of the Encoders are the ________ Encoders

  1. A2^(n-1)-to-n
  2. Bn-to-2n
  3. C2^n-to-n
  4. Dn-to-2^(n-1)

A basic encoder converts 2^n input lines into an n-bit code.

149.
★ Final term past paper

The 2's complement method is used to ________

  1. AConvert binary numbers to decimal
  2. BConvert decimal numbers to binary
  3. CRepresent signed numbers
  4. DRepresent positive numbers

2's complement is the standard way to represent signed (positive and negative) binary numbers.

150.
★ Final term past paper

1011 - 101 = ________ (Note: both values are in binary)

  1. A1100
  2. B0110
  3. C0011
  4. D1001

11 - 5 = 6, which is 0110 in binary.

151.
★ Final term past paper

At J = 1, and K = 1, output of JK Flip-flop will be ________

  1. ASet
  2. BReset
  3. CToggle
  4. DInvalid

With J = K = 1 a JK flip-flop changes to the opposite state on each clock.

152.
★ Final term past paper

When one 1 is taken as a group on a Karnaugh map, the number of variables eliminated from the output expression is/are ________

  1. A0
  2. B1
  3. C2
  4. D3

A single cell forms a full minterm, so no variable is eliminated.

153.
★ Final term past paper

Using 15 digits (including the sign digit) notation the largest number that can be represented is ________

  1. A999,999,999,999 x 10^100
  2. B0.999,999,999,999 x 10^100
  3. C999,999,999,999 x 10^99
  4. D0.999,999,999,999 x 10^99

Sign, 12-digit fractional mantissa and a 2-digit exponent use 15 digits, giving at most 0.999999999999 x 10^99.

154.
★ Final term past paper

The ________ output of first 74HC163 counter is connected to ________ and ________ inputs of other 74HC163 counter to form a single cascaded counter

  1. ARCO, ENT, ENP
  2. BENT, RCO, ENP
  3. CENP, RCO, ENT
  4. DRCO, ENI, ENC

The ripple carry output of the first counter enables the ENT and ENP inputs of the next counter.

155.
★ Final term past paper

The Sequential circuit whose output depends on the current state and the input is known as ________

  1. AMoore Machine
  2. BMealy Machine
  3. CCounter
  4. DFlip Flop

In a Mealy machine outputs depend on both the present state and the inputs.

156.
★ Final term past paper

In ________, the Q' output of the last flip-flop of the shift register is connected to the data input of the first flip-flop.

  1. AMoore machine
  2. BMealy machine
  3. CJohnson counter
  4. DRing counter

A Johnson (twisted-ring) counter feeds back the inverted output of the last stage.

157.
★ Final term past paper

The counter states can be determined by the formula: ________ ("n" represents the total number of flip-flops).

  1. An^2 (n raise to power 2)
  2. Bn^2-1 (n raise to power 2 and then minus 1)
  3. C2^n (2 raise to power n)
  4. D2^n-1 (2 raise to power n and then minus 1)

n flip-flops give 2^n possible states.

158.
★ Final term past paper

The Sequential circuit, whose output is determined by the current state only is known as ________.

  1. AMoore Machine
  2. BMealy Machine
  3. CCounter
  4. DFlip Flop

Moore machine outputs depend only on the present state.

159.
★ Final term past paper

Stack is a ________

  1. ABust Flash Memory
  2. BFIFO memory
  3. CLIFO memory
  4. DFlash Memory

A stack returns the last item stored first (last in, first out).

160.
★ Final term past paper

According to the sampling theorem, the sampling frequency should be:

  1. AGreater than the lowest signal frequency
  2. BLess than half the lowest signal frequency
  3. CGreater than twice the highest signal frequency
  4. DLess than half the highest signal frequency

The Nyquist criterion requires sampling faster than twice the highest signal frequency.

161.
★ Final term past paper

In CMOS 5 Volt series, Input voltage for Logic high signal (VIH) is in the range of ________ volts.

  1. A3.5 to 5
  2. B4.5 to 5
  3. C0 to 5
  4. D0 to 3.5

5 V CMOS accepts 3.5 V to 5 V as a valid input high.

162.
★ Final term past paper

A feature that distinguishes JK flip-flop from SR flip-flop is ________

  1. AToggle condition
  2. BPreset input
  3. CType of clock
  4. DClear input

J = K = 1 toggles a JK flip-flop, whereas S = R = 1 is invalid for SR.

163.
★ Final term past paper

Which one of the following expressions is an example of Commutative Law for Multiplication?

  1. AAB+C = A+BC
  2. BA(B+C) = B(A+C)
  3. CAB=BA
  4. DA+B=B+A

The commutative law of multiplication is AB = BA.

164.
★ Final term past paper

The binary values for the standard SOP expression, ABCD' + A'BCD' + A'B'C'D are ________

  1. A1110 + 0110 + 0001
  2. B1011 + 1111 + 1011
  3. C0001 + 1001 + 1110
  4. D1010 + 1110 + 0101

Uncomplemented variables are 1 and complemented are 0: 1110, 0110, 0001.

165.
★ Final term past paper

In a state diagram, the transition from a current state to the next state is determined by ________ and ________

  1. ACurrent state, inputs
  2. BCurrent state, outputs
  3. CPrevious state, inputs
  4. DPrevious state, outputs

Each transition depends on the present state and the applied inputs.

166.
★ Final term past paper

State Machine is a generic name given to ________

  1. ASequential circuits
  2. BCombinational circuits
  3. CFlip-flops
  4. DCounters

Any sequential circuit that moves through defined states is called a state machine.

167.
★ Final term past paper

Sampling of an analog signal produces:

  1. AA series of impulses those are proportional to the frequency of the signal
  2. BA series of impulses those are proportional to the amplitude of the signal
  3. CDigital codes that represent the analog signal amplitude
  4. DDigital codes that represent the time of each sample

Sampling gives pulses whose heights follow the signal amplitude at the sample instants.

168.
★ Final term past paper

In a binary-weighted D/A converter, the resistors on the inputs:

  1. ALimit the power consumption
  2. BPrevent loading on the source
  3. CDetermine the weights of the digital inputs
  4. DDetermine the amplitude of the analog signal

Input resistor values scale by powers of two to weight each binary input.

169.
★ Final term past paper

The Extended ASCII Code (American Standard Code for Information Interchange) represents ________ unique codes

  1. A256
  2. B255
  3. C128
  4. D127

Extended ASCII uses 8 bits, giving 2^8 = 256 codes.

170.
★ Final term past paper

The active high and active low inputs of 3-to-8 Decoder are as follows:

  1. AOne active-high and the remaining two are active-low.
  2. BTwo active-high and the remaining one is active-low.
  3. CAll active high
  4. DAll active low

The 74x138 has three enable inputs: G1 active-high and G2A, G2B active-low.

171.
★ Final term past paper

Which of the following statement is true?

  1. APower consumption of TTL is higher than CMOS
  2. BPower consumption of CMOS is higher than TTL
  3. CBoth TTL and CMOS have same power consumption
  4. DPower consumption of both CMOS and TTL depends on number of gates in the circuit.

CMOS draws almost no static current, so TTL consumes more power.

172.
★ Final term past paper

________ is said to occur when multiple internal variables change due to change in one input variable.

  1. ARace condition
  2. BPropagation delay
  3. CRipple effect
  4. DClock skew

A race occurs when one input change makes several state variables change.

173.
★ Final term past paper

A 5-bit counter has a maximum ________ modulus.

  1. A10
  2. B16
  3. C25
  4. D32

Five flip-flops give at most 2^5 = 32 states.

174.
★ Final term past paper

The power consumed by a flip-flop is defined by ________

  1. AP = Icc x Rcc
  2. BP = Vcc x Rcc
  3. CP = Vcc x Icc
  4. DP = Mcc x Vcc

Power is supply voltage times supply current.

175.
★ Final term past paper

In Single-Precision Floating Point format, "exponent" is represented by _________ bits.

  1. A8-bits
  2. B16-bits
  3. C32-bits
  4. D64-bits

Single precision uses 1 sign bit, 8 exponent bits and 23 mantissa bits (32 bits in total).

176.
★ Final term past paper

A particular Full Adder has _______ inputs and _______ output(s).

  1. A2, 3
  2. B2, 2
  3. C3, 2
  4. D3, 3

A full adder adds A, B and carry-in and produces sum and carry-out.

177.
★ Final term past paper

Programmable Array Logic (PAL) has _________ input(s) and _________ output(s).

  1. ASingle, multiple
  2. BMultiple, single
  3. CSingle, single
  4. DMultiple, multiple

A PAL device has many inputs and many outputs.

178.
★ Final term past paper

The negative edge triggered flip-flop changes state on __________

  1. APositive half cycle of clock
  2. BNegative half of clock
  3. CLow-to-high transition of clock
  4. DHigh-low transition of clock

A negative-edge-triggered flip-flop responds on the HIGH-to-LOW clock transition.

179.
★ Final term past paper

When four 1's are taken as a group on a Karnaugh map, the number of variables eliminated from the output expression is/are ____________

  1. A1
  2. B2
  3. C3
  4. D4

A group of 2^n cells eliminates n variables, so a quad eliminates 2.

180.
★ Final term past paper

Each stage of Master-slave flip-flop works in ___________

  1. AOne complete clock signal
  2. BOne fourth of the clock signal
  3. COne third of the clock signal
  4. DOne half of the clock signal

The master is active during one clock level and the slave during the other, each for half a cycle.

181.
★ Final term past paper

A hold action occurs :

  1. AAfter the analog-to-digital conversion
  2. BDuring each sample
  3. CImmediately after a sample
  4. DBefore each sample

The sample-and-hold circuit holds the sampled value immediately after each sample so the ADC can convert it.

182.
★ Final term past paper

110 / 10 = __________ Note: both values are in binary

  1. A11
  2. B10
  3. C111
  4. D101

110 (6) / 10 (2) = 3 = 11 in binary.

183.
★ Final term past paper

A + A̅B = _______

  1. AA
  2. BB
  3. CAB
  4. DA+B

By the absorption rule A + A̅B = A + B.

184.
★ Final term past paper

Compared to analog systems, digital systems ______________________.

  1. Aare less prone to noise
  2. Bcan represent an infinite number of values
  3. Ccan handle much higher power
  4. Doccupy large space

Digital signals use only two levels, so small noise does not change the value.

185.
★ Final term past paper

Determine the values of A, B, C, and D for the sum term A̅ + B + C̅ + D

  1. AA = 1, B = 0, C = 0, D = 0
  2. BA = 1, B = 0, C = 1, D = 0
  3. CA = 0, B = 1, C = 0, D =1
  4. DA = 1, B = 0, C = 1, D = 1

The sum term is 0 only when every literal is 0: A = 1, B = 0, C = 1, D = 0.

186.
★ Final term past paper

Determine the values of A, B, C, and D for the product term A̅BC̅D

  1. AA = 0, B = 1, C = 0, D = 1
  2. BA = 1, B = 0, C = 1, D = 0
  3. CA = 1, B = 1, C = 1, D = 1
  4. DA = 0, B = 0, C = 1, D = 0

The product term is 1 only when every literal is 1: A = 0, B = 1, C = 0, D = 1.

187.
★ Final term past paper

Invalid state of NOR based SR latch occurs when __________

  1. AS=0, R=0
  2. BS=0, R=1
  3. CS=1, R=0
  4. DS =1, R =1

With S = R = 1 both NOR outputs are forced LOW, which is the invalid condition.

188.
★ Final term past paper

A flip-flop is connected to +5 volts and it draws 5 mA of current during its operation, the power dissipation of the flip-flop is____________

  1. A10 mW
  2. B25 mW
  3. C64 mW
  4. D84 mW

P = V x I = 5 V x 5 mA = 25 mW.