# ISC Theory Sample Questions

### Q1.

- Use the truth table to show that: (A.B+C)+(A.B)’=1
- State the two absorption laws. Verify one of them using truth table
- Convert the given function to its equivalent POS form F(A,B,C)=∑(0,3,5,7)
- Convert the following function as a sum of minterms: F(X,Y,Z)=X.Y+Y’.Z
- Simplify using laws of Boolean- (P+Q).(P’+Q’).(P’+Q)+P

### Q2.

- Differentiate between a tautology and a contradiction.
- What are adders? Give its utility.
- Explain 3 input XNOR gate with the truth table.
- Give an application of a multiplexer.
- Draw the truth table to prove the propositional logic expression: a<=>b=(a =>b).(b =>a)

### Q3.

- Simplify using Boolean algebra. At each step state clearly the law used: X.Y. (X.Y+Y.Z)
- State the De Morgan’s laws. Verify any one of them using truth table.
- Find the complement of F(a,b,c,d)=[a+{(b+c).(b’+d’)}]
- Draw the logic gate diagram and truth table for XOR gate.

### Q4.

- What is the difference between syllogism and premises?
- What do you understand by a contrapositive statement? Explain giving example.
- Differentiate between universal and fundamental gates.
- Give any four examples of non-primitive data types.
- What do you understand by Grey Code? How is it different from Binary Code?

### Q5.

- Draw the simplified diagram using NAND gates F(A,B,C)=∑(0,1,2,5)
- 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.
- What do you mean by idempotence law? Explain giving example.
- Differentiate between runtime error and syntax error.
- Which escape sequence represents (i) audible bell(alert) (ii) Question mark

### Q6.

- State De Morgan’s Law
- Find the complement of F(a,b,c,d)=[m’+{(n’.p)+(n+m’)}]
- Draw the logic gate diagram and truth table for XOR gate.
- What are universal gates and why are they called so?

### Q7.

- Draw the logic gate and truth table for XNOR gate.
- Give the minterm designation of- i)p+q’+r ii)m’.n.o.p
- State the difference between SOP and canonical SOP expressions.
- How are minterms and maxterms related to each other.

### Q8.

- Define Absorption Law. Prove it with help of truth table.
- 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
- State De morgan’s Law of Boolean Algebra and verify one of the laws using truth tables.
- Explain XOR Gate with help of truth table of three inputs.
- Obtain the simplified form for a Boolean Expression. F(a,b,c,d)=∑(1,2,3,11,12,14,15) using Karnaugh Maps.

### Q9.

- Draw the logic circuit of a decimal to binary encoder.
- State any two application of multiplexer.
- Compare Selection srt and Bubble Sort.
- Define Inheritence with its advantages.
- 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.

- Use the truth table to show that : (A.B+C)+(A.B)’=1
- State the two absorption laws. Verify one of them using the truth table.
- Convert the given function to its equivalent POS form F(A,B,C)=(2,6,7)
- Convert the given following function as a sum of minterms: F(X,Y,Z)=X.Y+Y’.Z
- Simplify using laws of Boolean – (P+Q).(P’+Q’).(P’+Q)+P

### Q11.

- Define function overloading with an example.
- What are adders? Give its utility.
- Explain 3 input Xnor gate with the truth table.
- Give the application of stack.
- 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.

- 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)
- STATE THE De Morgan’s Laws. Verify any one of them using the truth table.
- Convert the following SOP into its corresponding POS: F(O,V,W,)=O’.V’.W’+O’.VV’.W+O’.V.W+O.V’.W
- Find the complement of F(a,b,c,d)=[a+{(b+c).(b’+d’)}]
- Draw the logic gate diagram and truth table for XOR gate.

### Q13.

- Convert the following infix expression to its postfix form. (A+(B*C))/(C-(D*B))
- Each element of an array X[-15…10,15…40] requires one byte of storage. If the array is stored in column major order with the beginning location 1500, determine the location of X[5,20].
- Explain any two standarad ways of traversing a Binary tree.
- What is meant by visibility mode in the definition of derived class inheritance? Explain any two visibility modes available.

### Q14.

- State the two Absorption laws of Boolean Algebra. Verify any one of them using the truth table.
- Find the complement of F(m,n,o)=m’.n.o’+m’.n’.o
- Write the product of sum form for the Boolean function F(A,B,C) whose output is 0 only when: A=1,B=0,C=0 A=0,B=1,C=0 A=0,B=0,C=1 A=1,B=1,C=1
- Simplify a.b+a’.c+b.c using the laws of Boolean Algebra.
- Why is the NOR gate regarded as a Universal gate? Draw the logic gate symbol and make the truth table for the two input NOR gate.

### Q15.

- Convert the following infix expression to its postfix form. A+[(B+C)+D+E)*F]/G
- In an array of real numbers ARR[25[25],ARR[1][1] is stored in location 1000. Find the address of ARR[12][12] when the array is stored row major wise. Assume each real number requires 4 bytes.
- Reduce the following three input function into its simplest form: F(X,Y,Z)=(0,1,3,5)
- Define a queue. How is a deque different from a queue?
- Define Encapsulation and Polymorphism.

### Q16.

- State the distributive law? Verify it using the truth table.
- What is the canonical form of Boolean Expression? State the two types of canonical form.
- Using NOR gates only, draw AND,OR and NOT gate.
- What is the application of Boolean Algebra in Computer Science.
- Reduce the following to its simplest form using laws of Boolean Algebra. At each step clearly state the law used for simplification. AB’+A’BC’+(AC)’+BC

### Q17.

- What is data structure? What are the different types of data structure?
- With a suitable example state the difference between runtime and syntax error.
- State the different application of stack?
- Convert the following into its postfix: (A+B/C)+B-C*D+C
- An array ARR[10][5] is stored in memory with each element requiring 2 bytes of storage. If the element ARR[0][0] is stored at the location 1250, Calculate the location of ARR[5][6] when the array is stored row major wise.

### Q18.

- Using Boolean Algebra show that the dual of exclusive OR is equivalent to the complement of exclusive OR.
- Show that A+A.B=A+B using the truth table.
- Define maxterm and minterm of a Boolean expression. What is the relation between them (show it by example)
- What types of multivibrators are used for clock generators in digital computer system? Why are clocks needed in a digital computer system?
- Reduce the following into its simplest form using laws of Boooean Algebra. At each step state clearly the law used for simplications. C.D+A+A+C.D+A.B

### Q19.

- Show how a NAND gate can be used to simulate the function of NOT, AND & OR gates.
- State the principle of duality. Give an example.
- Convert the following infix expressin to its postfix form. (P-Q)/(R*(S-T)+U)
- What do you understand by status flag? Name any two status flags.
- An array A[5][4] is stored in the memory with each element requiring 4 bytes of storage. If the base address of A[0][0] is 3000. Determine the location of A[3][2] when the array is stored row major wise.

### Q20.

- State the utility of logic gates. Name any two universal gates.
- State De morgan’s Laws. Verify any one of them using truth table.
- Simplify the given expression using laws of Boolean algebra. A.(B.C)’+(A.B.C)’
- Find the complement of: F(a,b,c,d)=[A+(A’+A.B.C)]
- Draw the logic gate diagram and truth table for XNOR gate.

### Q21.

- If K=A+B.C, then prove that K.K’=0 and K+K’=1
- Draw the logic gate diagram for the following functionusing NOR gate only. F(a,b,c)=A.(A’+B’). You may use gate with more than 2 inputs. Write the output at every stage.
- Write the canonical POS for the Boolean function denoted by the expression F(A,B,C)=∑(1,2,3,6,7)
- Represent the Boolean functions F(a,b)=a.b. using only NOT and OR gates.
- An array arrr[5][4] is stored in the memory with each element requiring 4 bytes of storage. If the base address of arr[0][0] is 4000, determine the location of arr[2][4] when each element is stored row major wise.

### Q22.

- Show that A+A’.B=A+B using truth table.
- State the De morgan’s Laws. Verify any one of them using truth table.
- Simplify the following 3 input function into its simplest form. F(x,y,z)=∑(1,2,4,5,6)
- Find the complement of: F(a,b,c,d)=[a’+{(b+c).(b’+d’)}]
- Draw the logic gate diagram and truth table for XNOR gate.

### Q23.

- If P=A+B.C, then prove that P.P’=0 and P+P’=1
- Draw the logic gate diagram and truth table for XNOR gate only. F(a,b,c)=ab+a.b’+c. you may use gate with more than 2 inputs. Write the output at every stage.
- What is DECODER? State any one of its applications.
- Represent the Boolean Functions F(a,b)=a+b. using only NOT and OR gates.
- What is a UNIVERSAL gates? Name them.