Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 31 views

    12 Computer Science

    Uploaded by

    Yash Gupta
    This document contains an 8 question test on computer science concepts related to Boolean algebra and logic gates. The questions cover topics like: 1) Creating compound propositions from simple propositions. 2) Verifying Boolean expressions using truth tables. 3) Stating and proving the commutative law using a truth table. 4) Reducing a Boolean function to sum of products form using Karnaugh maps. 5) Converting Boolean expressions to canonical product of sum form. 6) Finding the complement of a Boolean expression and showing the steps. 7) Proving an equality of Boolean expressions. 8) Verifying an equality using a truth table.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    12 Computer Science

    Uploaded by

    Yash Gupta
    31 views1 page
    This document contains an 8 question test on computer science concepts related to Boolean algebra and logic gates. The questions cover topics like: 1) Creating compound propositions from simple propositions. 2) Verifying Boolean expressions using truth tables. 3) Stating and proving the commutative law using a truth table. 4) Reducing a Boolean function to sum of products form using Karnaugh maps. 5) Converting Boolean expressions to canonical product of sum form. 6) Finding the complement of a Boolean expression and showing the steps. 7) Proving an equality of Boolean expressions. 8) Verifying an equality using a truth table.

    Original Title

    12 COMPUTER SCIENCE (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains an 8 question test on computer science concepts related to Boolean algebra and logic gates. The questions cover topics like: 1) Creating compound propositions from simple propositions. 2) Verifying Boolean expressions using truth tables. 3) Stating and proving the commutative law using a truth table. 4) Reducing a Boolean function to sum of products form using Karnaugh maps. 5) Converting Boolean expressions to canonical product of sum form. 6) Finding the complement of a Boolean expression and showing the steps. 7) Proving an equality of Boolean expressions. 8) Verifying an equality using a truth table.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    31 views1 page

    12 Computer Science

    Uploaded by

    Yash Gupta
    This document contains an 8 question test on computer science concepts related to Boolean algebra and logic gates. The questions cover topics like: 1) Creating compound propositions from simple propositions. 2) Verifying Boolean expressions using truth tables. 3) Stating and proving the commutative law using a truth table. 4) Reducing a Boolean function to sum of products form using Karnaugh maps. 5) Converting Boolean expressions to canonical product of sum form. 6) Finding the complement of a Boolean expression and showing the steps. 7) Proving an equality of Boolean expressions. 8) Verifying an equality using a truth table.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    CLASS – 12 / IST UNIT TEST / COMPUTER SCIENCE / 2021 – 22

    TIME – 1 HOUR
    M.M. – 20

    Note: Attempt all the questions:-


    Question 1) Consider some simple propositions given below: [2]
    A: It is raining B: Wind is Blowing C: I am not driving
    From these create the following compound propositions:
    i. AvB ii ~B iii. ~A.C iv. A + B.C
    Question 2) Verify the following proposition with the help of a truth table [2]
    (P ^ Q) v (P ^ ~Q) =P
    Question 3) State the commutative law and prove it with the help of a truth table. [2]
    Question 4) Given the Boolean function: * [4]
    F (P, Q, R, S) = ∑ (5, 6, 7, 8, 9, 10, 14)
    Use Karnaugh’s map to reduce the function F, using the SOP form.
    Question 5) Convert the following expressions to canonical product –of-sum form [2]
    i. (A+C)(C+D) ii) A(B+C)(C’ + D’)

    Question 6) Given F= A+ (B+C) (D’ +E) .Find F’ and show the relevant working in steps. [3]
    ’ ’ ’ ’
    Question 7) Prove that [(p +q). (q +r)] + (p + r) = 1 [3]
    Question 8) Verify if X’.Y.Z + X.Y’.Z + X.Y.Z’ + X.Y.Z =X.Y + YZ + ZX [2]

    You might also like