मराठी

Dheeraj Mehrotra solutions for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ chapter 1 - Boolean Algebra [Latest edition]

Chapters

▶ 1: Boolean Algebra

    2: Computer Hardware

    3: Programming in Java (Review of Class XI Sections B and C)

    4: Objects

    5: Primitive Values, Wrapper Classes, Types and Casting

    6: Variables and Expressions

   Chapter 7: Statements and their Scope

   Chapter 8: Methods

   Chapter 9: Arrays and Strings in Java

   Chapter 10: Recursion in Java

   Chapter 11: Inheritance and Polymorphism

   Chapter 12: Data Structures

   Chapter 13: Complexity and Big O Notation

   Chapter 14: Practical Programs (Solved and UnSolved)

Dheeraj Mehrotra solutions for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ chapter 1 - Boolean Algebra - Shaalaa.com
Advertisements
Advertisements

Solutions for Chapter 1: Boolean Algebra

Below listed, you can find solutions for Chapter 1 of CISCE Dheeraj Mehrotra for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२.


EXERCISE
Advertisements
EXERCISE [Pages 47 - 53]

Dheeraj Mehrotra solutions for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ 1 Boolean Algebra EXERCISE [Pages 47 - 53]

1. (a)Page 47

Define the following term.

Binary Variable

1. (b)Page 47

Define the following term.

Binary Constant

1. (c)Page 47

Define the following term.

Boolean Function

1. (d)Page 47

Define the following term:

Complement of a boolean Variable

1. (e)Page 47

Define the following term.

Boolean Expression

1. (f)Page 47

Define the following term.

Truth Table

1. (g)Page 47

Define the following term.

Karnaugh Map

2.Page 47

What are binary codes and logical circuits?

3. (a) iPage 47

What is Boolean algebra?

3. (a) iiPage 47

State one reason for studying Boolean algebra in computer science.

3. (b)Page 47

State De Morgan's Theorem.

A

B

X

0

0

1

0

1

0

1

0

0

1

1

1

Which logic gate has the above truth table. Draw its symbol. Write X in terms of boolean expression.

4.Page 47

What do you understand by Switching Circuits?

5.Page 47

Explain the concept of GATES as applied in computers.

6.Page 47

Explain the Logical Operators and Truth Table.

7. iPage 47

What are Digital Circuits?

7. iiPage 47

How ALU is made with digital circuits?

8.Page 47

Obtain the Truth Table of the following expression:

F(AB,C) = A.B.C' +A'.B+C'

9.Page 47

Write a Boolean expression that will have 1 as the output when X = 0, Y = 1, Z = 0 and 0 as the output for all the other values of X, Y, and Z.

10 (a) iPage 47

State the various postulates of Boolean algebra.

10 (a) iiPage 47

State the various theorems of Boolean algebra.

10. (b) (i)Page 47

Reduce the following using postulates and theorems:

A'.B' +A' + A.B

10. (b) (ii)Page 47

Reduce the following using postulates and theorems:

X.Y + X'.Y' + X.Y'

10. (b) (iii)Page 47

Reduce the following using postulates and theorems:

A'.B'.C' + A'.B.C' + A.B'.C' + A.B.C'

10. (b) (iv)Page 47

Prove that (X' + Z) + [(Y' + Z) . (X' + Y)]' = 1.

10. (b) (v)Page 47

Prove that A'.B.C' + A'.B.C+A.B.C' + ABC + (A.B)' = 1.

10. (c) (i)Page 47

Simplify

P.Q'. (PQR + PQ'R + Q'.R') + P.Q

10. (c) (ii)Page 47

Simplify:

XY' + (X' + Y') . (X + Y')

10. (c) (iii)Page 47

Simplify:

AB'C + AB′C' + A'BC + A'B'C + A.B

10. (c) (iv)Page 47

Simplify:

X + X'.Y + XY'

10. (c) (v)Page 47

Simplify:

A' + A.B' + B + B.C'

10. (c) (vi)Page 47

Simplify:

(X + Y.Z') . (X' + Z) . (Y + X'.Z)

11. (i)Page 47

Explain the principle of duality.

11. (ii)Page 47

Explain the various steps involved in calculating the dual of any Boolean expression.

12. (a) (i)Page 47

State the principle of duality. Give the dual of the following Boolean relation:

A + (A'.B) = A + В

12. (a) (ii)Page 47

State the principle of duality. Give the dual of the following Boolean relation:

A + 0 = A

12. (b)Page 47

State the two distributive laws of Boolean Algebra. Use Truth Table to prove any one of them.

13. (a)Page 48

Reduce the expression:

A.B' + A'.B + A.B + A'.B'

13. (b) (i)Page 48

Write the truth table and draw the logic symbol of a 2-input EXOR gate.

13. (b) (ii)Page 48

Draw the logic circuit of a 2-input EXOR gate using AND, OR and NOT gates.

14. (a)Page 48

Prepare the truth table for the following:

A.B + A'.B'

14. (b)Page 48

Prepare the truth table for the following:

X.Y.Z' +Z'

14. (c)Page 48

Prepare the truth table for the following:

X+X'.Y'

15. (a)Page 48

Obtain the complement of the following:

X.Y' + X.Y'

15. (b)Page 48

Obtain the complement of the following:

X.Y + X'

15. (c)Page 48

Obtain the complement of the following:

A.B.C' + A.B'.C

15. (d)Page 48

Obtain the complement of the following:

X' + X.Y' + X.Y'

15. (e)Page 48

Obtain the complement of the following:

(W + X).(Y + Z)

16. (a)Page 48

Prove the following using a postulate/theorem:

((A+B)' + (A+B)')' = A+B

16. (b)Page 48

Prove the following using a postulate/theorem:

A.(A + B) = A

16. (c)Page 48

Prove the following using a postulate/theorem:

(A + B)' = A'.B'

16. (d)Page 48

Prove the following using a postulate/theorem:

(X.Y)' = X' + Y'

17. (a) (i)Page 48

Obtain the SOP form of the following truth table.

A

B

C

F(A,B,C)

0

0

0

1

0

0

1

0

0

1

0

1

0

1

1

0

1

0

0

1

1

0

1

0

1

1

0

1

1

1

1

1

17. (a) (ii)Page 48

Obtain the POS form of the following truth table.

A

B

C

F(A,B,C)

0

0

0

1

0

0

1

0

0

1

0

1

0

1

1

0

1

0

0

1

1

0

1

0

1

1

0

1

1

1

1

1

17. (b) (i)Page 48

Obtain the SOP form of the following truth table.

A

B

C

F(A,B,C)

0

0

0

1

0

0

0

0

0

0

1

0

0

1

0

0

0

1

1

1

1

0

0

1

1

0

1

1

1

1

0

0

1

1

1

1

17. (b) (ii)Page 48

Obtain the POS form of the following truth table.

A

B

C

F(A,B,C)

0

0

0

1

0

0

0

0

0

0

1

0

0

1

0

0

0

1

1

1

1

0

0

1

1

0

1

1

1

1

0

0

1

1

1

1

18. (a)Page 48

Draw the logic circuit of the following Boolean expression:

A'.B'.C + A.B'.C

18. (b)Page 48

Draw the logic circuit of the following Boolean expression:

A.B+ A'.B' + A'В

18. (c)Page 48

Draw the logic circuit of the following Boolean expression:

A.B.C + A'.B' + A'.B.С

19.Page 48

A boolean function F is defined on three input variables A, B and C is 1 if and only if number of 1 inputs is odd. Draw the truth table for the above function and express it in sum of products and product of sums formats.

20.Page 49

Convert the following three input boolean function into SOP format:

F(A,B,C) = Σ(0,1,2,5)

21. (i)Page 49

Reduce the following using a Karnaugh map:

A'.B' + A'.B + А.В

21. (ii)Page 49

Reduce the following using a Karnaugh map:

X.Y + X'.Y' + X.Y'

21. (iii)Page 49

Reduce the following using a Karnaugh map:

A'.B'.C' + A'.B.C' + A.B'.C' + A.B.С'

22. (i)Page 49

Reduce the following using a K-map:

F(A,B,C) = Σ(0,1,3,2)

22. (ii)Page 49

Reduce the following using a K-map:

F(X,Y,Ζ) = Σ(0,1,2,5)

22. (iii)Page 49

Reduce the following using a K-map:

F(A,B) = (A'+B).(A+B')

22. (iv)Page 49

Reduce the following using a K-map:

F(A,B,C,D) = Σ(0,4,8,12)

23. (a)Page 49

Evaluate the simplified Boolean equation for the following K-map:

23. (b)Page 49

Evaluate the simplified Boolean equation for the following K-map:

23. (c)Page 49

Evaluate the simplified Boolean equation for the following K-map:

24. (a)Page 49

What is the Boolean expression for the shaded area in the following diagram:

24. (b)Page 50

Draw a logic diagram corresponding to the following truth table:

A

B

C

F(A,B,C)

0

0

0

0

0

0

1

0

0

1

0

1

0

1

1

1

1

0

0

0

1

0

1

1

1

1

0

1

1

1

1

1

24. (b)Page 50

What is the principle of duality? Give one example.

24. (d)Page 50

A combinational logic circuit with three inputs W, X, Y produces output 1 if and only if an odd number of inputs is 1. Show its truth table.

24. (e)Page 50

Show that y' = A.B.C + A.B.C' + A.B'.C can be simplified to A.(B+C). Also mention the law used at each step of simplification.

25. (a)Page 50

Draw the truth table for the exclusive OR gate. Draw its NAND equivalent circuit.

25. (b)Page 50

Draw the truth table for logic function M for the three inputs A, B, C. M = f(A,B,C). The output is 0 if majority of inputs are 0 and 1 if majority of inputs are 1.

25. (c)Page 50

Draw the logic circuit for the logic function M after obtaining sum of products expression for M.

26. (a)Page 50

Given two inputs A and B and the output F, where F = A.B' + A'.B + A.B + A'.B'. Implement F using 2-input NAND gates only and show it diagrammatically. Give the intermediate results in the diagram.

26. (b)Page 50

Find the complement of E, given E = `bar(A.B) + A' + A.B`

26. (c)Page 50

Implement F using NOT and AND gates. Given F = X'.Y + X-Y.

26. (d) (i)Page 50

Define a logic gate.

26. (d) (ii)Page 50

Give two examples of logic gates.

27. (a) (i)Page 50

Reduce the following Boolean expression to its simplest form:

`[bar((C.D)+A)]+A+C.D+A.B`

27. (a) (ii)Page 50

Reduce the following Boolean expression to its simplest form:

`A.[B + C.(bar(A.B + A.C))]`

27. (b) (i)Page 50

A coin is tossed 3 times. A win is said to occur if the result obtained is Heads for at least 2 tosses. Taking A, B, C as inputs and W as output, Write a truth table, given that A, B, C are 1 if the result is Heads or 0 if the result is Tails; and W is 1 if a win occurs otherwise it is 0.

27. (b) (ii)Page 50
  1. Write an expression for W.
  2. Reduce the expression obtained.
28. (a)Page 50

State the absorption laws. Verify one of the Absorption laws using a truth table.

28. (b)Page 50

Prove X + Y'.Z = (X + Y' + Z') (X + Y' + Z) (X + Y + Z) algebraically.

28. (c)Page 50

Write the dual of the Boolean expression (U.V + W).(V' + U).0 = 0

28. (d)Page 50

Obtain a simplified form for a Boolean expression:

F(X,Y,Z,W) = Σ(0,1,3,4,5,6,7,9,10,11,13,15) using a Karnaugh map.

29.Page 51

Write the sum of product form of the function G(U, V, W) truth table representation of G is as follows:

U

V

W

G

0

0

0

1

0

0

1

1

0

1

0

0

0

1

1

0

1

0

0

1

1

0

1

1

1

1

0

0

1

1

1

0

30.Page 51

Prove A.B + A'.C = (A + C). (A' + B) using Boolean postulates.

31.Page 51

Why are NOR and NAND gates called universal gates?

32.Page 51

Draw the logic circuit of the following Boolean function using NAND gates only.

F(A,B,C,D) = A.C + C.D + B.C

33.Page 51

Represent the following Boolean function using NOR gates only.

F(A,B,C) = (A + C).(A + B).(B + C)

34.Page 51

Represent the following using NOR gates only.

F(A,B,C) = A.(B' + C)

35.Page 51

Represent the Boolean expression X + Y.Z' using NAND gates only.

36.Page 51

Draw the logic circuit for the expression:

(X.Y)'. (X+Z') . (X.Z)'

37.Page 51

Write the sum of Product form of the function G (u, v, w), truth table representation of G is as follows:

U

V

W

G

0

0

0

1

0

0

1

1

0

1

0

0

0

1

1

1

1

0

0

1

1

0

1

1

1

1

0

0

1

1

1

1

38. (a)Page 51

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)

38. (b)Page 51

State De Morgan's Laws. Verify any one of them using a truth table.

39. (a)Page 51

Convert the following sum-of-products expression into its corresponding product-of-sums form:

F(O, V, W) = O'.V'.W' + O'.V'.W + O'.V.W + O.V'.W

39. (b)Page 51

Find the complement of F(a,b,c,d) = [a + {(b + c).(b' + d')}].

39. (c) (i)Page 51

Draw the logic gate diagram of the XOR gate.

39. (c) (ii)Page 51

Draw the truth table of the XOR gate.

40.Page 52

Given the Boolean function F(A, B, C, D) = Σ(0,2,3,4,6,7,9,13)

  1. Use Karnaugh's map to reduce this function F, using the given SOP form. Draw logic gate diagram for the reduced SOP form. You may use gates with more than two inputs. Assume that variables and their complements are available as inputs.
  2. Given X(A, B, C, D) = П(2,3,4,5,12,14)
41. (a)Page 52

Explain the following:

Disjunctive Operator

41. (b)Page 52

Explain the following:

Conjunctive Operator

41. (c)Page 52

Explain the following:

Conditional Operator

41. (d)Page 52

Explain the following:

Equivalence

41. (d)Page 52

Explain the following:

Negative

42. (a)Page 52

Explain the usage of the following operator:

∼

42. (b)Page 52

Explain the usage of the following operator:

∧

42. (c)Page 52

Explain the usage of the following operator:

↔

42. (d)Page 52

Explain the usage of the following operator:

∨

43. (a)Page 52

Explain the following:

Conjunction

43. (b)Page 52

Explain the following:

Disjunction

43. (c)Page 52

Explain the following:

Negation

43. (d)Page 52

Explain the following:

Implication

43. (f)Page 52

Explain the following:

Decisional

43. (f)Page 52

Explain the following:

Antecedent

43. (g)Page 52

Explain the following:

Consequent

44. (a)Page 52

Give an example of the following type:

Converse

44. (b)Page 52

Give an example of the following type:

Inverse

44. (c)Page 52

Give an example of the following type:

Contra-positive

45. (i)Page 52

Define the term Tautology.

45. (ii)Page 52

Give a valid example of Tautology.

46. (i)Page 52

Define the term Contradiction.

46. (ii)Page 52

Give a valid example of Contradiction.

47. (i)Page 52

Complete the following law:

p v p = ______

47. (ii)Page 52

Complete the following law:

p ∧ p = ______

47. (iii)Page 52

Complete the following law:

p → q = ______

47. (iv)Page 52

Complete the following law:

p ∧ (q ∨ r) = ______

47. (v)Page 52

Complete the following law:

~ (p ∧ q) = ______

47. (vi)Page 52

Complete the following law:

∼ (p ∨ q) = ______

47. (vii)Page 52

Complete the following law:

(p ∨ p') = ______

47. (viii)Page 52

Complete the following law:

p ∧ p' = ______

47. (ix)Page 52

Complete the following law:

p ∨ q = ______

47. (x)Page 52

Complete the following law:

p ∧ p = ______

47. (xi)Page 52

Complete the following law:

(p ∨ q) ∨ r = ______

47. (xii)Page 52

Complete the following law:

(p ∧ q) ∨ r = ______ 

47. (xiii)Page 52

Complete the following law:

p ∨ (q ∨ r) = ______ 

48. (a)Page 52

If p and q are propositions, construct a truth table for the following:

p ∧ q'

48. (b)Page 52

If p and q are propositions, construct a truth table for the following:

p ∨ q

48. (c)Page 52

If p and q are propositions, construct a truth table for the following:

p ⇒ q

48. (d)Page 52

If p and q are propositions, construct a truth table for the following:

(p ⇒ q) ∧ (q ⇒ p)

48. (e)Page 52

If p and q are propositions, construct a truth table for the following:

p ∧ q ∧ r

49. (a)Page 52

Determine whether the following is valid/satisfiable or unsatisfiable.

(p → q) ∧ r

49. (b)Page 52

Determine whether the following is valid/satisfiable or unsatisfiable.

(p → q) ∧ r

49. (c)Page 52

Determine whether the following is valid/satisfiable or unsatisfiable.

(a ∧ b) ↔ (~ a ∧ ~ b)

49. (d)Page 52

Determine whether the following is valid/satisfiable or unsatisfiable.

(a ∨ b) ∧ (~ a ∧ ~ b)

50. (a)Page 52

Draw the truth table of the proportional logic expression:

p ⇒ q

50. (b)Page 52

Draw the truth table of the proportional logic expression:

p ⇔ q

51. (i)Page 52

If (x ⇒ y), then write its converse:

51. (ii)Page 52

If (x ⇒ y), then write its contrapositive.

52. (a)Page 52

Define the term Contradiction.

52. (b)Page 52

Define the term Tautology.

52. (c)Page 52

Define the term contingency.

53. (i)Page 53

Derive the expression for the given logic circuits and simplify it.

53. (ii)Page 53

Derive the expression for the given logic circuits and simplify it.

XNOR will give AB + A'B' NAND will give (AB)'

53. (iii)Page 53

Derive the expression for the given logic circuits and simplify it. 

53. (iv)Page 53

Derive the expression for the given logic circuits and simplify it. 

Solutions for 1: Boolean Algebra

EXERCISE
Dheeraj Mehrotra solutions for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ chapter 1 - Boolean Algebra - Shaalaa.com

Dheeraj Mehrotra solutions for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ chapter 1 - Boolean Algebra

Shaalaa.com has the CISCE Mathematics कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ CISCE solutions in a manner that help students grasp basic concepts better and faster. The detailed, step-by-step solutions will help you understand the concepts better and clarify any confusion. Dheeraj Mehrotra solutions for Mathematics कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ CISCE 1 (Boolean Algebra) include all questions with answers and detailed explanations. This will clear students' doubts about questions and improve their application skills while preparing for board exams.

Further, we at Shaalaa.com provide such solutions so students can prepare for written exams. Dheeraj Mehrotra textbook solutions can be a core help for self-study and provide excellent self-help guidance for students.

Concepts covered in कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ chapter 1 Boolean Algebra are Propositional Logic, Well Formed Formulae, Truth Values and Interpretation of Well Formed Formulae, Truth Tables, Satisfiable, Unsatisfiable, Valid Formulae, Equivalence Laws and Their Use in Simplifying Well Formed Formulaes, Binary-valued Quantities, Basic Postulates of Boolean Algebra Operations AND, OR and NOT, Basic Theorems of Boolean Algebra (Eg. Duality, Idempotence, Commutativity, Associativity, Distributivity, Operations with 0 and 1, Complements, Absorption, Involution), DeMorgan’S Law/Theorem and Their Applications, Reducing Boolean Expression (SOP and POS) to Its Minimal Form, Use of Karnaugh Map for Minimization of Boolean Expressions (Up to 4 Variables).

Using Dheeraj Mehrotra कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ solutions Boolean Algebra exercise by students is an easy way to prepare for the exams, as they involve solutions arranged chapter-wise and also page-wise. The questions involved in Dheeraj Mehrotra Solutions are essential questions that can be asked in the final exam. Maximum CISCE कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ students prefer Dheeraj Mehrotra Textbook Solutions to score more in exams.

Get the free view of Chapter 1, Boolean Algebra कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ additional questions for Mathematics कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ CISCE, and you can use Shaalaa.com to keep it handy for your exam preparation.

Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×