Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Online Quiz 1

Download as pdf or txt
Download as pdf or txt
You are on page 1of 9

CMPE 30094 Online Quiz 1

December 11-12, 2021

Instructions: This test is open-book: you are permitted to refer to your notes and textbooks during the test. You
must show all your workings to get credit for an answer except for Multiple choice. Write the honor code on
your answer sheet, then sign it. Answer the following problems below in a bond paper. Solutions to the
problems must be handwritten. Make sure that the solutions were written legibly. Please use any scanning
device (CamScanner) to have your answers.

HONOR CODE: “I affirm that I have upheld the


highest principles of integrity and honor in my
academic work, I swear upon my honor that I have Signature
neither given nor received aid on this exam”

Part 1: Multiple Choice

1. An OR gate has 4 inputs. One input is high and the other three are low. The output
a. is low
b. is high
c. is alternately high and low
d. may be high or low depending on relative magnitude of inputs

2. Decimal number 10 is equal to binary number


a. 1110
b. 1010
c. 1001
d. 1000

3. Both OR and AND gates can have only two inputs.


a. True
b. False

4. An AND gate has two inputs A and B and one inhibit input 3, Output is 1 if
a. A = 1, B = 1, S = 1
b. A = 1, B = 1, S = 0
c. A = 1, B = 0, S = 1
d. A = 1, B = 0, S = 0

5. 127416 - 3A716 = __________ .


a. ACA16
b. ACB16
c. ECD16
d. AAA16

6. A + (B . C) =
a. A . B + C
b. A . B + A . C
c. A
d. (A + B) . (A + C)

7. The first person who used Boolean algebra for the design of relay switching circuits was
a. Aristotle
b. Boole
c. Shannon
d. Ramanujam

8. Different variables used in Boolean algebra can have values of


a. 0 or 1
b. Low or high
c. True of false
d. On or off

9. According to the absorptive Laws of Boolean algebra, expression (A +AB) equals


a. A
b. B
c. AB
d. A + B

10. The dual of the statement (A+ 1) = 1 is


a. A ∙ 1 = A
b. A ∙ 0 = 0
c. A + A = A
d. A ∙ A = 1

11. While obtaining minimal sum-of-products expression,


a. all don’t cares are ignored
b. all don’t cares are treated as logic 1s
c. all don’t cares are treated as logic 0s
d. only such don’t cares that aid minimization are treated as logic 1s

12. A NOR gate is ON only when all its inputs are


a. ON
b. Positive
c. High
d. OFF

13. For getting an output from an XNOR gate, its both inputs must be
a. High
b. Low
c. At the sample logic level
d. At the opposite logic levels

14. In a certain 2-input logic gate, when A = 0, B = 0, then C = 1 and when A = 0, B=1, then again C = 1. It
must be _____ gate.
a. XOR
b. AND
c. NAND
d. NOR

15. The digital equivalent of an electric series circuit is the ___ gate
a. NOR
b. NAND
c. OR
d. AND

16. Which of the following represents analog data?


a. ON and OFF states
b. 0 and 1
c. 0V and 5V
d. 1.5, 3.2, 4 and 5V

17. The logic gate which produces a 0 or low-level output when one or both of the inputs are 1 is called
____ gate
a. AND
b. OR
c. NOR
d. NAND

18. The chief reason why digital computers use complemental subtraction is that:
a. It simplifies their circuitry
b. it is a very simple process
c. it can handle negative numbers easily
d. it avoids direct subtraction

19. Which of the following is NOT an octal number?


a. 19
b. 77
c. 15
d. 101

20. The digital systems usually operate on ___ system.


a. Binary
b. Decimal
c. Octal
d. Hexadecimal

21. Decimal 8 in excess-3 code =


a. 1000
b. 1001
c. 1011
d. 1111

22. BCD number 1100111 = __________ 10


a. 66
b. 67
c. 68
d. 69

23. The K-map for a Boolean function is shown in figure. The number of essential prime implicants for this
function is
a. 4
b. 5
c. 6
d. 8

24. Assertion (A): In computers the data is stored in hexadecimal form


Reason (R): Hexadecimal representation is short as compared to binary representation.
a. Both A and R are correct and R is correct explanation of A
b. Both A and R are correct but R is not correct explanation of A
c. A is true, R is false
d. A is false, R is true

25. For the circuit of the given figure, the output equation is

a. Y = ABCD
b. Y = AB + CD
c. Y = A + BCD
d. Y = ABC + D

26. Using 2's complement, the largest positive and negative number which can be stored with 8 bits are
a. +128 and -127
b. +128 and -128
c. +127 and -128
d. +127 and -127

27. The number FF in hexadecimal system is equivalent to number __________ in decimal system.
a. 256
b. 255
c. 240
d. 239

28. The inputs A, B, C of the given figure are applied to a 3 input NOR gate. The output is
a. HIGH from 4 to 0
b. LOW from 0 to 4
c. HIGH from 0 to 1 and LOW from 1 to 4
d. LOW from 0 to 2 and HIGH from 2 to 4

29. The number of bits in EBCDIC is


a. 12
b. 10
c. 8
d. 6

30. Binary 101010 is equivalent to decimal number


a. 24
b. 42
c. 44
d. 64

31. (FE35)16 XOR (CB15)16 is equal to


a. (3320)16
b. (FE35)16
c. (FF50)16
d. (3520)16

32. The total number of fundamental products of three variables is


a. 3
b. 5
c. 8
d. 16

33. As per Boolean algebra, inputs can be interchanged in


a. OR gates
b. AND gates
c. Both OR and AND gates
d. None of the above

34. The code used to reduce the error due to ambiguity in reading of a binary optical encoder is
a. Octal code
b. Excess-3 code
c. Gray code
d. BCD code

35. The Boolean SOP expression obtained from the truth table below is ________.

a.
b.
c.
d. None of these

36. The 8-input XOR circuit shown has an output of Y = 1. Which input combination below (ordered A – H) is
correct?

a. 10111100
b. 10111000
c. 11100111
d. 00011101

37. Implementing the expression AB + CDE using NAND logic, we get:


a. (A)
b. (B)
c. (C)
d. (D)
38. The following waveform pattern is for a(n) ________.

a. 2-input AND gate


b. 2-input OR gate
c. Exclusive-OR gate
d. None of the above

39. Implementing the expression with NOR logic, we get:

a. (A)
b. (B)
c. (C)
d. (D)

40. A 4-variable AND-OR-Invert circuit produces a 0 at its Y output. Which combination of inputs is correct?
a.
b.
c.
d. None of the above

41. The following waveform pattern is for a(n) ________.

a. 2-input AND gate


b. 2-input OR gate
c. Exclusive-OR gate
d. None of the above

42. To implement the expression , it takes one OR gate and ________.


a. three AND gates and three inverters
b. three AND gates and four inverters
c. three AND gates
d. one AND gate

43. A NAND gate can function as a negative-OR gate.


a. True
b. False

44. An AND gate is a universal gate.


a. True
b. False

45. The output of an AND gate is HIGH when any input is HIGH.
a. True
b. False

46. 2's complement representation of a 16 bit number (one sign bit and 15 magnitude bit) is FFFF. Its magnitude
in decimal representation is
a. 0
b. 1
c. 32676
d. 65,535

47. The hexadecimal number system is


a. widely used in analyzing and programming microprocessors
b. an obsolete system no more in use
c. used in calculators only
d. none of the above

48. The symbol shown represents a(n) ________.

a. AND gate
b. OR gate
c. NAND gate
d. NOR gate
49. The expression can be directly implemented using only ________.
a. an XOR gate
b. an XNOR gate
c. an AOI circuit
d. three 2-input NAND gates

50. Assume that you have a 3-input NAND gate but need only a 2-input gate. The unused input should be
________.
a. connected to ground
b. left open
c. connected to a HIGH
d. any of the above

Part 2: Problem Solving

1. Convert 41678 to base 3. (5pts)


2. Add the following BCD numbers: 00010110 + 00010101 (5pts)
3. Simplify the following Boolean functions, using three-variable k-maps: (5 pts each)
a. F (x,y,z) = Σ(2,3,4,5)
b. F (x,y,z) = Σ(0,2,4,6)
4. Simplify the following Boolean function F, together with the don’t-care conditions d, and then express
the simplified function in sum-of-minterms form: (5 pts each)
a. F(x,y,z) = Σ(0,1,4,5,6)
d(x,y,z) = Σ(2,3,7)

b. F(A,B,C,D) = Σ(0,6,8,13,14)
d(A,B,C,D) = Σ(2,4,10)
5. Simplify the following functions and implement them with two-level NAND gate circuits: (10 pts each)
a. F(A,B,C,D) = AC’D’ + A’C + ABC + AB’C + A’C’D’
b. F(A,B,C,D) = A’B’C’D + CD + AC’D

You might also like