Digital Principles And System Design Set 2

On This Page

This set of Digital Principles and System Design Multiple Choice Questions & Answers (MCQs) focuses on Digital Principles And System Design Set 2

Q1 | (A + B)(A’ * B’) = ?
  • 1
  • 0
  • ab
  • ab’
Q2 | According to boolean law: A + 1 = ?                    
  • 1
  • a
  • a’
Q3 | The involution of A is equal to                    
  • a
  • a’
  • 1
Q4 | Simplify Y = AB’ + (A’ + B)C.
  • ab’ + c
  • ab + ac
  • a’b + ac’
  • ab + a
Q5 | The boolean function A + BC is a reduced form of
  • ab + bc
  • (a + b)(a + c)
  • a’b + ab’c
  • (a + c)b
Q6 | In which of the following gates the output is 1 if and only if at least one input is 1?
  • and
  • nor
  • nand
  • or
Q7 | The time required for a gate or inverter to change its state is called                      
  • rise time
  • decay time
  • propagation time
  • charging time
Q8 | What is the minimum number of two input NAND gates used to perform the function of two input OR gates?
  • one
  • two
  • three
  • four
Q9 | Odd parity of word can be conveniently tested by
  • or gate
  • and gate
  • nand gate
  • xor gate
Q10 | The number of full and half adders are required to add 16-bit number is                      
  • 8 half adders, 8 full adders
  • 1 half adders, 15 full adders
  • 16 half adders, 0 full adders
  • 4 half adders, 12 full adders
Q11 | Which of the following will give the sum of full adders as output?
  • three point major circuit
  • three bit parity checker
  • three bit comparator
  • three bit counter
Q12 | An OR gate can be imagined as                          
  • switches connected in series
  • switches connected in parallel
  • mos transistor connected in series
  • bjt transistor connected in series
Q13 | How many full adders are required to construct an m-bit parallel adder?
  • m/2
  • m
  • m-1
  • m+1
Q14 | Boolean Function is of the form of                  
  • truth values
  • k=f(x,y,x)
  • algebraic expression
  • truth table
Q15 | The result of X+X.Y is X.
  • true
  • false
Q16 | In the boolean function w=f(X,Y,Z), what is the RHS referred to as                  
  • right hand side
  • expression
  • literals
  • boolean
Q17 | The general form for calculating the number of rows in a truth table is                  
  • 2n
  • 2n+1
  • 2n
  • 2n+1
Q18 | The number of literals in the expression F=X.Y’ + Z are                            
  • 4
  • 3
  • 2
  • 1
Q19 | The complement term for X’.Y’.Z + X.Y will be
  • xyz’+x’y’
  • (x+y+z’)(x’+y’)
  • (x+y+z’)(x’+y)
  • (x+y+z’)(x’+y)
Q20 | What is the complement of X’Y’Z?
  • x+yz
  • x’+y+’z’
  • x+y+z’
  • xyz’
Q21 | The minterm of any expression is denoted by
  • mt
  • m
  • m
  • min
Q22 | The min term when X=Y=Z=0 is                            
  • x’+y’+z’
  • xyz
  • x’y’z’
  • x+y+z
Q23 | The max term when X=Y=Z=1 is                  
  • x’+y’+z’
  • xyz
  • x’y’z’
  • x+y+z
Q24 | A product term containing all K variables of the function in either complemented or uncomplemented form is called a                      
  • minterm
  • maxterm
  • midterm
  • ∑ term
Q25 | The canonical sum of product form of the function y(A,B) = A + B is                      
  • ab + bb + a’a
  • ab + ab’ + a’b
  • ba + ba’ + a’b’
  • ab’ + a’b + a’b’