Question-2

a)  Verify if, P.(P’ + Q’) = (P=>Q) using truth table.

b)  What is connective?

c)  Give truth table proof for De Morgan’s law.

d)  Prove the complementary law with the help of truth table.

e)  Prove x + x’y = x + y using Boolean algebraic method.

Question-3

a)  Draw the logic circuit for the following using NOR gates only.

i) (X + Y) . (X’ + Y) . (X’ + Y’)

ii) (X + Y + Z) . (X + Y’ + Z’)

b)  What is meant by Minterm and Maxterm?

Question-4

a)  Draw the logic circuit for the following using NAND gates only.

i) xy + xy’z + xyz
ii) ABC + AB’C’ + A’BC

b)  Simplify :     (A+C).(A+A.D)+A.C+C

Question—5

What is Full Adder? Draw the truth table, SOP expression and Logic diagram for a Full adder.

Checkout this link : https://t.co/TULXHQVava

— Tech DCode (@thetechdcode) July 7, 2021

Question-7

Write a java program to print a tribonacci series (series whose first three terms are given and every successive term is sum of previous three terms e.g.

0 1 2 3 6 11 20 27

Question-8

Write a menu driven program in java:

a)  To input a number and check whether it is a NEON number or not.

b)  To print the REPUNIT series: 1, 11, 111, 1111…… upto n term.
Note: A number is said to be a NEON , if sum of all the digits of the square of the number is equal to the number itself. For example: 9 is a NEON number because square of 9 is 81 and sum of digits of 81= 8 +1 = 9.