Dheeraj Mehrotra solutions for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ chapter 2 - Computer Hardware [Latest edition]
Chapters
▶ 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 2 - Computer Hardware Dheeraj Mehrotra solutions for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ chapter 2 - Computer Hardware - Shaalaa.com](/images/computer-science-english-class-12_6:84b15ff614c34c1bacc1b4e62b81fcd3.jpg)
Advertisements
Advertisements
Solutions for Chapter 2: Computer Hardware
Below listed, you can find solutions for Chapter 2 of CISCE Dheeraj Mehrotra for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२.
Advertisements
Dheeraj Mehrotra solutions for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ 2 Computer Hardware EXERCISE [Pages 74 - 81]
A Binary Coded Decimal number expresses each decimal digit as:
Four Bits
A Binary Coded Decimal number expresses each decimal digit as:
Two Bits
A Binary Coded Decimal number expresses each decimal digit as:
Three Bits
A Binary Coded Decimal number expresses each decimal digit as:
Eight Bits
Explain the following term:
Microprocessor
Explain the following term:
Universal Gates
Explain the following term:
Half Adder
Explain the following term:
Full Adder
Explain the following term:
Encoder
Explain the following term:
Decoder
Explain the following term:
Multiplexer
Explain the following logic gate with its respective truth table and logic diagram:
NOT
Explain the following logic gate with its respective truth table and logic diagram:
AND
Explain the following logic gate with its respective truth table and logic diagram:
OR
Explain the following logic gate with its respective truth table and logic diagram:
NAND
Explain the following logic gate with its respective truth table and logic diagram:
NOR
Explain the following logic gate with its respective truth table and logic diagram:
XOR
Explain the following logic gate with its respective truth table and logic diagram:
XNOR
Differentiate between Full Adder and Half Adder circuits with the help of logic circuits.
Obtain the sum and carry expression for a Half Adder.
Obtain the sum and carry expression for a Full Adder.
Study the following Boolean function and answer the questions that follow:
F(X,Y,Z) = X.Y'.Z + X'.Y'.Z + X.Y.Z
- Obtain the truth table of the following.
- Draw the logic diagram of the function.
- Simplify the boolean expression.
What are Decoders?
Explain the Function of a Decoder.
Explain the NOR gate.
Explain the NAND gate.
Under what conditions is the output of nor gate equal to 1.
How is NOR different from XNOR. Explain using truth table and logic diagrams.
Explain any three applications of Boolean Algebra.
Develop the expression for the following:
Adding two bit numbers.
Develop the expression for the following:
Adding three bit numbers.
Implement F using NOT and NAND gates. Given F = X'.Y + X.Y'.
Draw the logic diagram for a half-adder. Derive the simplified expressions for SUM and CARRY.
Draw the logic diagram for a full-adder. Derive the simplified expression for SUM and CARRY.
State the absorption laws. Verify one of the Absorption laws using a truth table.
Prove X + Y'.Z = (X + Y' + Z') (X + Y' + Z) (X + Y + Z) algebraically.
Write the dual of the Boolean expression (U.V + W).(V' + U).0 = 0
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.
Draw the logic circuit for a Half Adder.
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.
Name the gate and draw its logic gate symbol:
Its output is 0 when both its inputs A and B are 1.
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.
Determine if the universal NOR gate (OR invert) is logically equivalent to invert AND gate. Give reasons for your answer.
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.
State the idempotence law.
Verify the Idempotence Law using truth tables.
Prove (x + y) (x + z) = x + yz algebraically.
Write the dual of the Boolean expression (x + y).(x'.z').(y + z).
Minimise the following boolean expression using Karnaugh Map:
F(a,b,c,d) = Σ (0,2,7,8,10,15)
Draw a logic circuit of Full Adder.
Represent the Boolean expression yz + xz with the help of NOR gates only.
Verify the following statement using truth tables:
(a + b).(a' + b') = a.b' + a'.b
Prove algebraically that (a + b)'.(a' + b') = a'.b'
Give the complement of the following Boolean Expression:
(a + y).(a' + b') and draw a logic circuit for the original expression.
Obtain the simplified form for the Boolean expression F(a,b,c,d) = Σ (1,2,3,11,12,14,15) using a Karnaugh Map.
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.
State De Morgan's Laws. Verify any one of them using a truth table.
Verify X.Y'.Z + X.Y'.Z' + X'.Y'.Z = X.Y' + Y'.Z algebraically.
Write the dual of the Boolean expression (B'+C).A
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.
Draw the logic circuit for a Half Adder.
Represent the Boolean expression (X+Y'). Z with the help of NAND gates only.
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 |
State the distributive law and verify the law using Truth Table.
Prove XY + YZ + Y'Z = XY + Z, algebraically.
Obtain the simplified form, of a boolean expression using Karnaugh map.
F(w,x,y,z) = Σ(2,3,6,10,11,14)
Draw a logic circuit of Full Adder.
Give the truth table of a full adder.
Represent the boolean expression (X + Y) (Y + Z) (X + Z) with help of NOR gate only.
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 |
State and prove the absorption law algebraically.
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 |
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)
Draw the logic circuit for a Half Adder using NAND gates only.
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.
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).
State the distributive law and verify the law using Truth Table.
Prove XY + YZ + Y'Z = XY + Z, algebraically.
Obtain the simplified form, of a boolean expression using Karnaugh map.
F(w,x,y,z) = Σ(2,3,6,10,11,14)
Draw a logic circuit of Full Adder.
Give the truth table of a full adder.
Represent the boolean expression (X + Y) (Y + Z) (X + Z) with help of NOR gate only.
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 |
State De Morgan's Laws. Verify any one of them using a truth table.
Verify X.Y'.Z + X.Y'.Z' + X'.Y'.Z = X.Y' + Y'.Z algebraically.
Write the dual of the Boolean expression (B'+C).A
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.
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.
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.
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.
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.
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).
- Write the TRUTH TABLE with inputs A,B,C and output D.
- Write SOP expression for D (A, B, C). Implant D using NAND gates only.
- Write the POS expression for D (A, B, C). Implant D using NOR gates only.
Using a truth table, verify the following expression:
X + (Y + Z) = (X + Y) + Z
Also state the law.
Given, F (x,y,z) = (x' + y'). (y + z') Write the function in canonical product-of-sums form.
Draw the truth table and logic circuit for a 2 input XNOR gate.
Find the complement of the following expression:
X' + XY'
Given the Boolean Function:
F(A,B,C,D) = Σ (4,6,7,10,11,12,14,15)
- Reduce the above expression by using 4- variable K-Map, showing the various groups (i.e., octal, quads and pairs).
- Draw the logic gate diagram of the reduced expression. Assume that the variables and their complements are available as inputs.
Given the Boolean Function:
F(P,Q,R,S) = Σ (0,5,7, 8, 10,12,13,14,15)
- Reduce the above expression by using 4-variable K-Map, showing the various groups (i.e., octal, quads and pairs)
- Draw the logic gate diagram of the reduced expression. Assume that the variables and their complements are available asa inputs.
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.
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.
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.]
- Draw the truth table for the inputs and outputs given above and write the SOP expression.
- 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.
Verify algebraically if: X'Y'Z' + X'Y'Z + X'YZ + X'YZ' + XY'Z' + XY'Z = X'+Y'
Represent the Boolean expression X + YZ' with the help of NOR gates only.
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 |
- Name and draw the logic gate for the given truth table.
- Write the POS of X(A, B).
Define multiplier.
State one use of a Multiplexer.
Draw the logic diagram of a 4:1 Multiplexer.
State how a Half Adder is different from a Full Adder. Also give their respective uses.
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
![Dheeraj Mehrotra solutions for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ chapter 2 - Computer Hardware Dheeraj Mehrotra solutions for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ chapter 2 - Computer Hardware - Shaalaa.com](/images/computer-science-english-class-12_6:84b15ff614c34c1bacc1b4e62b81fcd3.jpg)
Dheeraj Mehrotra solutions for कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ chapter 2 - Computer Hardware
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 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 कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ 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 कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ 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 कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ students prefer Dheeraj Mehrotra Textbook Solutions to score more in exams.
Get the free view of Chapter 2, Computer Hardware कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ additional questions for Mathematics कॉम्प्युटर सायन्स [इंग्रजी] इयत्ता १२ CISCE, and you can use Shaalaa.com to keep it handy for your exam preparation.
