English

Dheeraj Mehrotra solutions for Computer Science [English] Class 12 chapter 2 - Computer Hardware [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 Computer Science [English] Class 12 chapter 2 - Computer Hardware - Shaalaa.com
Advertisements
Advertisements

Solutions for Chapter 2: Computer Hardware

Below listed, you can find solutions for Chapter 2 of CISCE Dheeraj Mehrotra for Computer Science [English] Class 12.


EXERCISE
Advertisements
EXERCISE [Pages 74 - 81]

Dheeraj Mehrotra solutions for Computer Science [English] Class 12 2 Computer Hardware EXERCISE [Pages 74 - 81]

1. (a)Page 74

A Binary Coded Decimal number expresses each decimal digit as:

Four Bits

1. (b)Page 74

A Binary Coded Decimal number expresses each decimal digit as:

Two Bits

1. (c)Page 74

A Binary Coded Decimal number expresses each decimal digit as:

Three Bits

1. (d)Page 74

A Binary Coded Decimal number expresses each decimal digit as:

Eight Bits

2. (a)Page 74

Explain the following term:

Microprocessor

2. (b)Page 74

Explain the following term:

Universal Gates

2. (c)Page 74

Explain the following term:

Half Adder

2. (d)Page 74

Explain the following term:

Full Adder

2. (e)Page 74

Explain the following term:

Encoder

2. (f)Page 74

Explain the following term:

Decoder

2. (g)Page 74

Explain the following term:

Multiplexer

3. (a)Page 74

Explain the following logic gate with its respective truth table and logic diagram:

NOT

3. (b)Page 74

Explain the following logic gate with its respective truth table and logic diagram:

AND

3. (c)Page 74

Explain the following logic gate with its respective truth table and logic diagram:

OR

3. (d)Page 74

Explain the following logic gate with its respective truth table and logic diagram:

NAND

3. (e)Page 74

Explain the following logic gate with its respective truth table and logic diagram:

NOR

3. (f)Page 74

Explain the following logic gate with its respective truth table and logic diagram:

XOR

3. (g)Page 74

Explain the following logic gate with its respective truth table and logic diagram:

XNOR

4.Page 75

Differentiate between Full Adder and Half Adder circuits with the help of logic circuits.

5. (i)Page 75

Obtain the sum and carry expression for a Half Adder.

5. (ii)Page 75

Obtain the sum and carry expression for a Full Adder. 

6.Page 75

Study the following Boolean function and answer the questions that follow:

F(X,Y,Z) = X.Y'.Z + X'.Y'.Z + X.Y.Z

  1. Obtain the truth table of the following. 
  2. Draw the logic diagram of the function. 
  3. Simplify the boolean expression.
7. (i)Page 75

What are Decoders?

7. (ii)Page 75

Explain the Function of a Decoder.

8. (i)Page 75

Explain the NOR gate.

8. (ii)Page 75

Explain the NAND gate.

8. (iii)Page 75

Under what conditions is the output of nor gate equal to 1.

9.Page 75

How is NOR different from XNOR. Explain using truth table and logic diagrams.

10.Page 75

Explain any three applications of Boolean Algebra.

11. (i)Page 75

Develop the expression for the following:

Adding two bit numbers.

11. (ii)Page 75

Develop the expression for the following:

Adding three bit numbers.

12.Page 75

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

13.Page 75

Draw the logic diagram for a half-adder. Derive the simplified expressions for SUM and CARRY.

14.Page 75

Draw the logic diagram for a full-adder. Derive the simplified expression for SUM and CARRY.

15. (a)Page 75

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

15. (b)Page 75

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

15. (c)Page 75

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

15. (d)Page 75

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.

15. (e)Page 75

Draw the logic circuit for a Half Adder.

16. (a)Page 75

Determine with the help of a truth table if the following rule is true:

x + x'.y = x + y

Give the dual of the rule stated above.

16. (b) (i)Page 75

Name the gate and draw its logic gate symbol: 

Its output is 0 when both its inputs A and B are 1.

16. (b) (ii)Page 75

Name the gate and draw its logic gate symbol:

Its output is 1 when either its input A or B but not both A and B is 1.

16. (c)Page 75

Determine if the universal NOR gate (OR invert) is logically equivalent to invert AND gate. Give reasons for your answer.

16. (d)Page 75

Reduce the following expression using the laws of Boolean Algebra:

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

Draw the logic diagram for the original and reduced circuit.

17. (a) (i)Page 76

State the idempotence law.

17. (a) (ii)Page 76

Verify the Idempotence Law using truth tables.

17. (b)Page 76

Prove (x + y) (x + z) = x + yz algebraically.

17. (c)Page 76

Write the dual of the Boolean expression (x + y).(x'.z').(y + z).

17. (d)Page 76

Minimise the following boolean expression using Karnaugh Map:

F(a,b,c,d) = Σ (0,2,7,8,10,15)

17. (e)Page 76

Draw a logic circuit of Full Adder.

17. (f)Page 76

Represent the Boolean expression yz + xz with the help of NOR gates only.

18. (a)Page 76

Verify the following statement using truth tables:

(a + b).(a' + b') = a.b' + a'.b

18. (b)Page 76

Prove algebraically that (a + b)'.(a' + b') = a'.b'

19. (a)Page 76

Give the complement of the following Boolean Expression:

(a + y).(a' + b') and draw a logic circuit for the original expression.

19. (b) (i)Page 76

Obtain the simplified form for the Boolean expression F(a,b,c,d) = Σ (1,2,3,11,12,14,15) using a Karnaugh Map.

19. (b) (ii)Page 76

Obtain the simplified form for the Boolean expression F(u,v,w,z) = Σ (0,1,2,3,12,13,14,15) using a Karnaugh Map.

20. (a)Page 76

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

20. (b)Page 76

Verify X.Y'.Z + X.Y'.Z' + X'.Y'.Z = X.Y' + Y'.Z algebraically.

20. (c)Page 76

Write the dual of the Boolean expression (B'+C).A

20. (d)Page 76

Obtain a simplified form for a Boolean Expression:

F(U, V, W, Z) = S(0, 2, 3, 4, 7, 9, 10, 13, 14, 15) using Karnaugh Map.

20. (e)Page 76

Draw the logic circuit for a Half Adder.

20. (f)Page 76

Represent the Boolean expression (X+Y'). Z with the help of NAND gates only.

20. (g)Page 76

Write the Product-of-sum form of the function H(U,V,W).

The truth table representation of H is as follows:

U

V

W

H

0

0

0

0

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

21. (a)Page 77

State the distributive law and verify the law using Truth Table. 

21. (b)Page 77

Prove XY + YZ + Y'Z = XY + Z, algebraically.

21. (c)Page 77

Obtain the simplified form, of a boolean expression using Karnaugh map.

F(w,x,y,z) = Σ(2,3,6,10,11,14)

21. (d) (i)Page 77

Draw a logic circuit of Full Adder.

21. (d) (ii)Page 77

Give the truth table of a full adder.

21. (e)Page 77

Represent the boolean expression (X + Y) (Y + Z) (X + Z) with help of NOR gate only.

21. (f)Page 77

Given the following truth table, write the product-of-sums form of the function F(x,y,z).

x

y

z

F

0

0

0

0

0

0

1

1

0

1

0

1

0

1

1

0

1

0

0

1

1

0

1

0

1

1

0

0

1

1

1

1

22. (a)Page 77

State and prove the absorption law algebraically.

22. (b)Page 77

Given the following truth table, derive a sum of product (SOP) and Product of Sum (POS) form of Boolean expression from it:

A

B

C

(F(A,B,C

0

0

0

1

0

0

1

1

0

1

0

0

0

1

1

1

1

0

0

0

1

0

1

1

1

1

0

1

1

1

1

0

22. (c)Page 77

Obtain a simplified form for the following Boolean Expression using Karnaugh's Map:

F(a,b,c,d) = Σ(0,1,2,4,5,7,8,9,10,11,14)

22. (d)Page 77

Draw the logic circuit for a Half Adder using NAND gates only.

23.Page 77

Given the Boolean Function F(A,B,C,D) = S (0,1,6,7,8,9,10,14,15).

Use Karnaugh's map to reduce this function F, using the given SOP form. Draw the 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.

24.Page 78

A committee has three general members and a Group Head, Mr. Amazing. The three general members are Mr. Big, Ms. Creative and Ms. Dynamic. According to the rule a motion passes only when:

  • The Group Head and at least one general member vote yes or 
  • All three general members vote yes.

Let us assume that:

Inputs are:

A: Denotes Mr. Amazing's vote (1 indicates yes and 0 indicates no)
B: Denotes Mr. Big's vote (1 indicates yes and 0 indicates no)
C: Denotes Ms. Creative's vote (1 indicates yes and 0 indicates no)
D: Denotes Ms. Dynamic's vote (1 indicates yes and 0 indicates no)

Output is:

M: Denotes the passage of a motion

(1 indicates the motion passes and 0 indicates it does not.)

Draw the truth table for the inputs and outputs given above and write the SOP expression for the result of the motion M(A, B, C, D).

25. (a)Page 78

State the distributive law and verify the law using Truth Table. 

25. (b)Page 78

Prove XY + YZ + Y'Z = XY + Z, algebraically.

25. (c)Page 78

Obtain the simplified form, of a boolean expression using Karnaugh map.

F(w,x,y,z) = Σ(2,3,6,10,11,14)

25. (d)Page 78

Draw a logic circuit of Full Adder.

25. (e)Page 78

Give the truth table of a full adder.

25. (e)Page 78

Represent the boolean expression (X + Y) (Y + Z) (X + Z) with help of NOR gate only.

25. (f)Page 78

Given the following truth table, write the product-of-sums form of the function F(x,y,z).

x

y

z

F

0

0

0

0

0

0

1

1

0

1

0

1

0

1

1

0

1

0

0

1

1

0

1

0

1

1

0

0

1

1

1

1

26. (a)Page 78

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

26. (b)Page 78

Verify X.Y'.Z + X.Y'.Z' + X'.Y'.Z = X.Y' + Y'.Z algebraically.

26. (c)Page 78

Write the dual of the Boolean expression (B'+C).A

26. (d)Page 78

Obtain a simplified form for a Boolean Expression:

F(U, V, W, Z) = S(0, 2, 3, 4, 7, 9, 10, 13, 14, 15) using Karnaugh Map.

27.Page 79

Given the Boolean Function F(A,B,C,D) = S (0,1,6,7,8,9,10,14,15).

Use Karnaugh's map to reduce this function F, using the given SOP form. Draw the 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.

28.Page 79

Given D(A,B,C,D) = π(2, 3, 4, 5, 11, 12, 13).

Use Karnaugh's map to reduce this function D using the given POS form. Draw the logic gate diagram for the reduced POS form. You may use gates with more that two inputs. Assume that variables and their complements are available as inputs.

29.Page 79

The SOP expression for a combinational circuit that detects an error in the representation of a decimal digit in BCD is given as follows:

E(A,B,C, D) = Σ(10, 11, 12, 13, 14, 15)

Use Karnaugh's map to reduce this function E, using the given SOP form. Draw the 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.

30.Page 79

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

Use K-map to reduce the function F, using the SOP form. Draw a logic gate diagram for the reduced SOP form you m]y use gates with more than two inputs. Assume that the variables and their complements are available as inputs.

31.Page 79

A combinational circuit with 3 inputs A, B, C detects an error during transmission of code and gives the output D as 1 if any two of the inputs are low (0).

  1. Write the TRUTH TABLE with inputs A,B,C and output D.
  2. Write SOP expression for D (A, B, C). Implant D using NAND gates only.
  3. Write the POS expression for D (A, B, C). Implant D using NOR gates only.
32.Page 79

Using a truth table, verify the following expression:

X + (Y + Z) = (X + Y) + Z 

Also state the law.

33.Page 79

Given, F (x,y,z) = (x' + y'). (y + z') Write the function in canonical product-of-sums form.

34.Page 79

Draw the truth table and logic circuit for a 2 input XNOR gate.

35.Page 79

Find the complement of the following expression:

X' + XY'

36.Page 79

Given the Boolean Function:

F(A,B,C,D) = Σ (4,6,7,10,11,12,14,15)

  1. Reduce the above expression by using 4- variable K-Map, showing the various groups (i.e., octal, quads and pairs).
  2. Draw the logic gate diagram of the reduced expression. Assume that the variables and their complements are available as inputs.
37.Page 80

Given the Boolean Function:

F(P,Q,R,S) = Σ (0,5,7, 8, 10,12,13,14,15)

  1. Reduce the above expression by using 4-variable K-Map, showing the various groups (i.e., octal, quads and pairs)
  2. Draw the logic gate diagram of the reduced expression. Assume that the variables and their complements are available asa inputs.
38. (i)Page 80

The Principal of a school intends to select students for admission to class XI on the following criteria: Student is of the same school and has passed the class X Board Examination with more than 60% marks.

38. (ii)Page 80

Student is of the same school and has passed the class X Board Examination with more than 60% marks but has taken active part in co-curricular activities.

38. (iii)Page 80

Student is not from the same school but has either passed the class X board examination with more than 60% marks or has participated in sports at the National Level. 

The Inputs are:

INPUTS:

S: Student of the same school
P: Has passed the class X Board Examination with more than 60% marks.
C: Has taken active part in co-curricular activities.
T: Has participated in sports at the National Level.

OUTPUT:

X- Denotes admission status [1 indicates granted and 0 indicates refused in all the cases.]

  1. Draw the truth table for the inputs and outputs given above and write the SOP expression. 
  2. Reduce X (S, P, C, T) using Karnaugh's Map. Draw the logic gate diagram for the reduced SOP expression for X (S, P, C, T) using AND and OR gate. You may use gates with two or more inputs. Assume that the variable and their complements are available as inputs.
39. (a)Page 80

Verify algebraically if: X'Y'Z' + X'Y'Z + X'YZ + X'YZ' + XY'Z' + XY'Z = X'+Y'

39. (b)Page 80

Represent the Boolean expression X + YZ' with the help of NOR gates only.

39. (c)Page 80

Consider the following truth table where A and B are two inputs and X is the output:

A

B

X

0

0

0

0

1

1

1

0

1

1

1

0

  1. Name and draw the logic gate for the given truth table.
  2. Write the POS of X(A, B).
40. (a) (i)Page 81

Define multiplier.

40. (a) (ii)Page 81

State one use of a Multiplexer.

40. (a) (iii)Page 81

Draw the logic diagram of a 4:1 Multiplexer.

40. (b)Page 81

State how a Half Adder is different from a Full Adder. Also give their respective uses.

40 (c)Page 81

Minimize the following expression using Boolean laws:

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

Also draw the logic gate for the reduced expression.

Solutions for 2: Computer Hardware

EXERCISE
Dheeraj Mehrotra solutions for Computer Science [English] Class 12 chapter 2 - Computer Hardware - Shaalaa.com

Dheeraj Mehrotra solutions for Computer Science [English] Class 12 chapter 2 - Computer Hardware

Shaalaa.com has the CISCE Mathematics Computer Science [English] Class 12 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 Computer Science [English] Class 12 CISCE 2 (Computer Hardware) 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 Computer Science [English] Class 12 chapter 2 Computer Hardware are Elementary Logic Gates (NOT, AND, OR, NAND, NOR, XOR, XNOR) and Their Use in Circuits, Applications of Boolean Algebra and Logic Gates to Half Adders, Full Adders, Encoders, Decoders, Multiplexers, NAND, NOR as Universal Gates.

Using Dheeraj Mehrotra Computer Science [English] Class 12 solutions Computer Hardware 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 Computer Science [English] Class 12 students prefer Dheeraj Mehrotra Textbook Solutions to score more in exams.

Get the free view of Chapter 2, Computer Hardware Computer Science [English] Class 12 additional questions for Mathematics Computer Science [English] Class 12 CISCE, and you can use Shaalaa.com to keep it handy for your exam preparation.

Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×