ISC Boolean Sample Questions
Q1.
0. Use the truth table to show that: (A.B+C)+(A.B)’=1
a. State the two absorption laws. Verify one of them using truth table
b. Convert the given function to its equivalent POS form F(A,B,C)=∑(0,3,5,7)
c. Convert the following function as a sum of minterms: F(X,Y,Z)=X.Y+Y’.Z
d. Simplify using laws of Boolean- (P+Q).(P’+Q’).(P’+Q)+P
Q2.
0. Differentiate between a tautology and a contradiction.
a. What are adders? Give its utility.
b. Explain 3 input XNOR gate with the truth table.
c. Give an application of a multiplexer.
d. Draw the truth table to prove the propositional logic expression: a<=>b=(a =>b).(b =>a)
Q3.
0. Simplify using Boolean algebra. At each step state clearly the law used: X.Y. (X.Y+Y.Z)
a. State the De Morgan’s laws. Verify any one of them using truth table.
b. Find the complement of F(a,b,c,d)=[a+{(b+c).(b’+d’)}]
c. Draw the logic gate diagram and truth table for XOR gate.
Q4.
0. What is the difference between syllogism and premises?
a. What do you understand by a contrapositive statement? Explain giving example.
b. Differentiate between universal and fundamental gates.
c. Give any four examples of non-primitive data types.
d. What do you understand by Grey Code? How is it different from Binary Code?
Q5.
0. Draw the simplified diagram using NAND gates F(A,B,C)=∑(0,1,2,5)
a. In an array of real numbers ARR[-25….10,-10…..20], Base address is 1234. Find the address of
ARR[6][8] when array is stored row major wise. Assume each real number requires 4 bytes.
b. What do you mean by idempotence law? Explain giving example.
c. Differentiate between runtime error and syntax error.
d. Which escape sequence represents (i) audible bell(alert) (ii) Question mark
Q6.
0. State De Morgan’s Law
a. Find the complement of F(a,b,c,d)=[m’+{(n’.p)+(n+m’)}]
b. Draw the logic gate diagram and truth table for XOR gate.
, c. What are universal gates and why are they called so?
Q7.
0. Draw the logic gate and truth table for XNOR gate.
a. Give the minterm designation of- i)p+q’+r ii)m’.n.o.p
b. State the difference between SOP and canonical SOP expressions.
c. How are minterms and maxterms related to each other.
Q8.
0. Define Absorption Law. Prove it with help of truth table.
a. Use De Morgan’s Law to find the complement of the following. Can it be represented by a single
gate? If yes name it. A’B’+AB
b. State De morgan’s Law of Boolean Algebra and verify one of the laws using truth tables.
c. Explain XOR Gate with help of truth table of three inputs.
d. Obtain the simplified form for a Boolean Expression. F(a,b,c,d)=∑(1,2,3,11,12,14,15) using
Karnaugh Maps.
Q9.
0. Draw the logic circuit of a decimal to binary encoder.
a. State any two application of multiplexer.
b. Compare Selection srt and Bubble Sort.
c. Define Inheritence with its advantages.
d. An array m[-2….-5,-1….4] is stored using row major implementation the the address of m[0][0] is
176 and the address of m[4][5] is 230. Find tne address of [3][2].
Q10.
0. Use the truth table to show that : (A.B+C)+(A.B)’=1
a. State the two absorption laws. Verify one of them using the truth table.
b. Convert the given function to its equivalent POS form F(A,B,C)=(2,6,7)
c. Convert the given following function as a sum of minterms: F(X,Y,Z)=X.Y+Y’.Z
d. Simplify using laws of Boolean – (P+Q).(P’+Q’).(P’+Q)+P
Q11.
0. Define function overloading with an example.
a. What are adders? Give its utility.
b. Explain 3 input Xnor gate with the truth table.
c. Give the application of stack.
d. An array A[-10…5,2…8] is stored in the memory with each element requiring 4 bytes of storage. If
the address is 5000, determine the location of A[1][5] when the array is stored row major wise.
Q12.
0. Simplify the following Boolean expression using laws of Boolean Algebra. At each step state
clearly the law used for simplification. X.Y.(X.Y+Y.Z)
a. STATE THE De Morgan’s Laws. Verify any one of them using the truth table.
Q1.
0. Use the truth table to show that: (A.B+C)+(A.B)’=1
a. State the two absorption laws. Verify one of them using truth table
b. Convert the given function to its equivalent POS form F(A,B,C)=∑(0,3,5,7)
c. Convert the following function as a sum of minterms: F(X,Y,Z)=X.Y+Y’.Z
d. Simplify using laws of Boolean- (P+Q).(P’+Q’).(P’+Q)+P
Q2.
0. Differentiate between a tautology and a contradiction.
a. What are adders? Give its utility.
b. Explain 3 input XNOR gate with the truth table.
c. Give an application of a multiplexer.
d. Draw the truth table to prove the propositional logic expression: a<=>b=(a =>b).(b =>a)
Q3.
0. Simplify using Boolean algebra. At each step state clearly the law used: X.Y. (X.Y+Y.Z)
a. State the De Morgan’s laws. Verify any one of them using truth table.
b. Find the complement of F(a,b,c,d)=[a+{(b+c).(b’+d’)}]
c. Draw the logic gate diagram and truth table for XOR gate.
Q4.
0. What is the difference between syllogism and premises?
a. What do you understand by a contrapositive statement? Explain giving example.
b. Differentiate between universal and fundamental gates.
c. Give any four examples of non-primitive data types.
d. What do you understand by Grey Code? How is it different from Binary Code?
Q5.
0. Draw the simplified diagram using NAND gates F(A,B,C)=∑(0,1,2,5)
a. In an array of real numbers ARR[-25….10,-10…..20], Base address is 1234. Find the address of
ARR[6][8] when array is stored row major wise. Assume each real number requires 4 bytes.
b. What do you mean by idempotence law? Explain giving example.
c. Differentiate between runtime error and syntax error.
d. Which escape sequence represents (i) audible bell(alert) (ii) Question mark
Q6.
0. State De Morgan’s Law
a. Find the complement of F(a,b,c,d)=[m’+{(n’.p)+(n+m’)}]
b. Draw the logic gate diagram and truth table for XOR gate.
, c. What are universal gates and why are they called so?
Q7.
0. Draw the logic gate and truth table for XNOR gate.
a. Give the minterm designation of- i)p+q’+r ii)m’.n.o.p
b. State the difference between SOP and canonical SOP expressions.
c. How are minterms and maxterms related to each other.
Q8.
0. Define Absorption Law. Prove it with help of truth table.
a. Use De Morgan’s Law to find the complement of the following. Can it be represented by a single
gate? If yes name it. A’B’+AB
b. State De morgan’s Law of Boolean Algebra and verify one of the laws using truth tables.
c. Explain XOR Gate with help of truth table of three inputs.
d. Obtain the simplified form for a Boolean Expression. F(a,b,c,d)=∑(1,2,3,11,12,14,15) using
Karnaugh Maps.
Q9.
0. Draw the logic circuit of a decimal to binary encoder.
a. State any two application of multiplexer.
b. Compare Selection srt and Bubble Sort.
c. Define Inheritence with its advantages.
d. An array m[-2….-5,-1….4] is stored using row major implementation the the address of m[0][0] is
176 and the address of m[4][5] is 230. Find tne address of [3][2].
Q10.
0. Use the truth table to show that : (A.B+C)+(A.B)’=1
a. State the two absorption laws. Verify one of them using the truth table.
b. Convert the given function to its equivalent POS form F(A,B,C)=(2,6,7)
c. Convert the given following function as a sum of minterms: F(X,Y,Z)=X.Y+Y’.Z
d. Simplify using laws of Boolean – (P+Q).(P’+Q’).(P’+Q)+P
Q11.
0. Define function overloading with an example.
a. What are adders? Give its utility.
b. Explain 3 input Xnor gate with the truth table.
c. Give the application of stack.
d. An array A[-10…5,2…8] is stored in the memory with each element requiring 4 bytes of storage. If
the address is 5000, determine the location of A[1][5] when the array is stored row major wise.
Q12.
0. Simplify the following Boolean expression using laws of Boolean Algebra. At each step state
clearly the law used for simplification. X.Y.(X.Y+Y.Z)
a. STATE THE De Morgan’s Laws. Verify any one of them using the truth table.
