binary.gif (3128 bytes) QUIZ -multiple choice

 

Choose the correct answers in the following questions:

1.  
Which of the following is the primary advantage of using the BCD code instead of  binary code?
Fewer bits are required to represent a decimal number with the BCD code.
The relative ease of converting to and from decimal.
BCD codes are easily converted to hexadecimal codes.
BCD codes are easily converted to straight binary codes.


2.  
How many BCD code bits and how many binary bits would be required to represent the decimal number 643?
12 BCD, 12 binary
12 BCD, 10 binary
12 BCD, 9 binary
16 BCD, 9 binary


3.  
When using the repeated division by 2 method of converting from decimal to binary, one must write the first remainder as the:
MSB
MSB, providing the following sequence of remainders are written in descending order until the final remainder is achieved.
LSB
LSB, providing the final remainder is used to replace the original LSB, which is then moved to the MSB position.


4.  
Which of the following is an invalid BCD code?
0011
1101
0101
1001


5. 

Convert 597210 to BCD.
111011
0101100101110010
11100110
01011001111010


6.  

Convert 5278 to binary.
343
011100111
101010111
111010101


7.  

Convert 11001010110111102 to hexadecimal.
121035
CADE
CAD2
530121


8.  

Convert 8B3F16 to binary.
35647
011010
1011001111100011
1000101100111111


9.  

Convert 45710 to octal.
711
2C7
811
888


10.  

Convert 17318 to decimal.
216.4
985
3D9
1123


11.  

How many binary digits are required to count to 10010?
7
2
3
100


12.  

How many binary digits are required to count to 100010?
9
7
3
10


13.  

Convert 01011100101000002 to hexadecimal.
56240
5CA0
53AC1
530121


14.  

Convert decimal 100 to binary.
01010010
01100100
00110110
01001000


15.  

Convert decimal 64 to binary.
01010010
01000000
00110110
01001000


16.  

Convert decimal 213 to binary.
11001101
11010101
01111001
11100011


17.  

The base of the octal system is:
Eight.
Seven.
Ten.
Two.


18.  

Convert binary 1001 to octal.
98
118
1018
108


19.  

Convert binary 01001110 to octal.
1068
1078
768
1168


20.  

Convert octal 701 to binary.
11000001
1000111
111000100
111000001


21.  

Convert octal 16 to decimal.
1410
1610
1010
2010


22.  

Convert binary 11001111 to hexadecimal.
8F16
CE16
DF16
CF16


23.  

Convert binary 111111110010 to hexadecimal.
EE216
FF216
2FE16
FD216


24.  

Convert hexadecimal CAFE to binary.
1100101010111111
1100000010011110
1100101011111110
1101000010110011
 

25.  
The format used to present the logic output for the various combinations of logic inputs to a gate is called a(n):
Truth Table.
input logic function.
Boolean constant.
Boolean variable.
 

 


26.  
The logic gate that will have HIGH or "1" at its output when any one of its inputs is HIGH is a(n):
NOR gate
OR gate
AND gate
NOT operation
 

 


27.  
Which of the following equations would accurately describe a 4-input OR gate when A = 1, B = 1, C = 0 and D = 0?
1 + 1 + 0 + 0 = 1
1 + 1 + 0 + 0 = 01
1 + 1 + 0 + 0 = 0
1 + 1 + 0 + 0 = 00
 

 


28.  
A NAND gate has:
active low inputs and an active high output.
active low inputs and an active low output.
active high inputs and an active high output.
active high inputs and an active low output.
 

 


29.  
A small circle on the output of a logic gate is used to represent the:
Comparator operation.
OR operation.
NOT operation.
AND operation.
 

 


30.  

Which timing diagram shown in figure is correct for an inverter?

a
b
c
d
 

 


31.  

Which of the symbols shown in figure represents an AND gate?

a
b
c
d
 

 


32.  

For a three-input AND gate, with the input waveforms as shown in figure , which output waveform is correct?

,

a
b
c
d


33.  

Which of the symbols shown in figure represents an OR gate?

a
b
c
d


34.  

For a three-input OR gate, with the input waveforms as shown in figure , which output waveform is correct?
a
b
     none
d


35.  

Which of the symbols shown in figure represents a NAND gate?
a
b
c
d


36.  

For a 3-input NAND gate, with the input waveforms as shown in figure, which output waveform is correct?
     none
b
c
d


37.  

Which of the symbols shown in figure represents a NOR gate?

a
b
c
d


38.  

For a three-input NOR gate, with the input waveforms as shown in figure, which output waveform is correct?

a
b
c
d


39.  

Which of the examples below expresses the associative law of boolean algebra?
A + (B + C) = (A + B) + C
A + (B + C) = A + (B.C)
A.(B.C) = (A..B) + C
A.B.C = A + B + C


40.  

Which of the examples below expresses the distributive law?
(A + B) + C = A + (B + C)
A.(B + C) = A.B + A.C
A + (B + C) = A.B + A.C
A.(B.C) = (A.B) + C


41.  

Which of the following is based on DeMorgan's theorems?


42.  

Which of the figures (a-d) is the DeMorgan equivalent of figure e (NAND gate)?

a
b
c
d


43.  

Simplify the expression using DeMorgan's theorems.
(A + B)C


44.  

The Boolean equation for a NOR function is:


45.  

A NOR gate with one HIGH input and one LOW input:
will output a HIGH
functions as an AND
will not function
will output a LOW


46.  

Which logic gate does this truth table describe?

AND
OR
NAND
NOR


47.  

Which step in this reduction process is using DeMorgan's theorem?

STEP 1
STEP 2
STEP 3
STEP 4


48.  

An OR gate with inverted inputs functions as:
an   AND.
a NAND.
a   NOR.
a   NOT.


49.  

Which of the figures below is equivalent to figure (e)?

a
b
c
d
 
50.  
The implementation of simplified sum-of-products expressions may be easily implemented into actual logic circuits using all universal ________ gates with little or no increase in circuit complexity. (Select the response for the blank space that will BEST make the statement true.)
AND/OR
NAND
NOR
OR/AND


51.  
Each "1" entry in a Karnaugh-map square represents:
a HIGH for each input Truth Table condition that produces a HIGH output.
a HIGH output on the Truth Table for all LOW input combinations.
a LOW output for all possible HIGH input conditions.
a DON'T CARE condition for all possible input Truth Table combinations.


52.  
Which of the following statements accurately represents the two BEST methods of logic circuit simplification?
Boolean algebra and Karnaugh mapping
Karnaugh mapping and circuit waveform analysis
Actual circuit trial and error evaluation and waveform analysis
Boolean algebra and actual circuit trial and error evaluation


53.  
Looping on a Karnaugh-map always results in the elimination of:
variables within the loop that appear only in their complemented form.
variables that remain unchanged within the loop.
variables within the loop that appear in both complemented and uncomplemented form.
variables within the loop that appear only in their uncomplemented form.


54.  
Which of the following expressions represents  S=B?
(A + B).(C + A)
(A.B).(B.D)
A.B+(C.B)
A.B + B


55.  

Which of the following expressions is in the sum-of-products form?
(A + B).(C + D)
(A.B).(C.D)
A.B.(C.D)
A.B + C.D


56.  

Which of the following is an important feature of the sum-of-products form of expressions?
All logic circuits are reduced to nothing more than simple AND and OR gates.
The delay times are greatly reduced over other forms.
No signal must pass through more than two gates, not including inverters.
The maximum number of gates that any signal must pass through is reduced by a factor of two.


57.  

Which of the following expressions is in the product-of-sums form?
(A + B).(C + D)
(A.B).(C.D)
A.B.(C.D)
A.B + C.D


58.  

Solve the logic circuit in figure below :
A + B.C + D
((A + B).C) + D
D.(A + B + C)
(A.C + B.C).D


59.  

Which of the following expressions is in the product-of-sums form?
(A + B).(C + D)
(A+.B).(C.D)
A.B.(C+D)
A.B + C.D


60.  

For a two-input XNOR gate, with the input waveforms as shown in figure , which output waveform is correct?
a
     none
c
d


61.  

Which of the figures shown in figure represents the exclusive-NOR gate?
a
b
c
d


62.  

Which statement below best describes a Karnaugh map?
A Karnaugh map can be used to replace Boolean rules.
The Karnaugh map eliminates the need for using NAND and NOR gates.
Variable complements can be eliminated by using Karnaugh maps.
Karnaugh maps provide a cookbook approach to simplifying Boolean expressions.


63.  

Which of the Karnaugh-maps in figure represents the expression X = A.C + B?
a
b
c
d


64.  

The simplest equation which implements the Karnaugh-map in figure is:


65.  
Which of the following logic expressions represent the logic diagram shown?
xnor.gif (1141 bytes)
um.gif (1127 bytes)


66.  

What type of logic circuit is represented by the figure shown in Question 65?
XOR
XNOR
XAND
XNAND


67.  

Which of the following combinations cannot be combined into Karnaugh-map groups?
Corners in the same row
Corners in the same column
Diagonal corners
Overlapping combinations

68.  

.Refer to figure below. What type of output arrangement is being used for the output?

Complementary-symmetry
Push-pull
Quasi push-pull
Totem-Pole
 
69.  

What type of circuit is shown in figure below, and how is the output ordinarily connected?

It is an open-collector gate and is used to drive loads that cannot be connected directly to Vcc due to high noise levels.
It represents an active-LOW inverter and is used in negative logic systems.
It is an open-collector gate. An external load must be connected between the output terminal and an appropriate supply voltage.
Any of the above could be correct, depending on the specific application involved.


How do you find this quiz?

   


Free Web Hosting