Question 1                                              [10 marks]
(a) Calculate the dual of the following. [2]
X’.(Y+Z)=(X.Y)+(X.Z)
(b) Find the compliment of F(a,b)=ab’+a’b [2]
(c) Write the product of sum of the Boolean function, F(A,B,C) whose output is 0 only when,
A=1,B=0,C=0 [2]
A=0,B=1,C=0
A=0,B=0,C=1
A=1,B=1,C=1
(d) Using the truth table prove that (a+b)’+(a+b’)’=a’ [2]
(e) Simplify the following Boolean expression to a minimum number literals: [2]
ABC + A′B + ABC′

Question-2                                      [10 marks]

(a) Convert the following infix expression in to post fix form. [2]
((A/B)+C) * (D/(E-F))

(c)A link list is formed from the objects of the class. [4]

Class ListNodes
{
intitem;
ListNodesnext;
}

Write a function to compute and return the sum of all integers items stored in the linked list.The method declaration is given below.
intlistsum(ListNodes start);

Question 3                                                     [5 marks]

Give the Boolean function F(A,B,C,D)= Σ(0,1,2,3,5,6,7,10,13,14,15) using K-map to reduce it in SOP form, draw logic gate diagram from the reduced from.

LEAVE A REPLY

Please enter your comment!
Please enter your name here