Scribd
Upload
3 views2 pages

Class XI Computer Science Question Paper

This document outlines an examination for Class XI Computer Science, consisting of multiple choice questions and short answer questions. The exam covers topics such as logic gates, Boolean expressions, and truth tables. It is structured into two sections: Section A with 10 multiple choice questions and Section B with 15 short answer questions, from which students must answer any 15.

Uploaded by

chayanray.official
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

Class XI Computer Science Question Paper

This document outlines an examination for Class XI Computer Science, consisting of multiple choice questions and short answer questions. The exam covers topics such as logic gates, Boolean expressions, and truth tables. It is structured into two sections: Section A with 10 multiple choice questions and Section B with 15 short answer questions, from which students must answer any 15.

Uploaded by

chayanray.official
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Class XI - Computer Science

Full Marks: 40

Time: 1 Hour 30 Minutes

Section A - Multiple Choice Questions (10 x 1 = 10 Marks)

1. The structure which shows input and output logic results is called:

(a) Truth Table (b) Symbol Table (c) Logic Table (d) Design Table

2. Which of the following is not a logical operator?

(a) Logical AND (b) Logical OR (c) Logical NOT (d) Logical IF

3. Which relation is not true?

(a) A + 0 = 0 (b) A 0 = 0 (c) A + 1 = 1 (d) A + 0 = A

4. Identify the law used in the equation: A + B = B + A

(a) Associative (b) Distributive (c) Commutative (d) Idempotent

5. The dual of A(A + B) is:

(a) A + (A B) (b) AA' + AB (c) A + AB (d) A B + A

6. Which relation results in false?

(a) 1 + 0 = 0 (b) 00 = 0 (c) 1 + 1 = 1 (d) 10 = 0

7. What logic gate is represented by this symbol?

(a) NOT (b) AND (c) NAND (d) NOR

8. A logic circuit used to add three binary digits is called:

(a) Half Adder (b) Parallel Adder (c) Ring Adder (d) Full Adder

9. Which gate is formed by combining AND, OR, and NOT gates?

(a) NOR (b) XOR (c) OR (d) NAND

10. What is the correct representation of XOR gate?

(a) A ^ B (b) A + B (c) A B (d) A - B

Section B - Short Answer Questions (15 x 2 = 30 Marks)

Answer any 15 of the following questions briefly:

1. Translate into meaningful sentences:

(a) p => q (b) ~p => ~q

2. Construct a truth table for (p => q) AND (q => p)

3. Write the converse, inverse, and contrapositive of: "If it rains, then you will not play."

4. Draw the logic circuit for NOT gate using NOR gate.
5. Express OR gate using NAND logic. Draw its logic diagram.

6. What is the Boolean expression for the EX-OR gate using NAND gates?

7. Draw the circuit for EX-NOR gate using NAND gates.

8. Subtract: (100110) from (1000010)

9. Perform Binary Multiplication: (10110) (110)

10. Convert (ABC) to Binary and then to Octal.

11. Add: (1ABC) + (2432)

12. Perform: (345.33) to Binary

13. Why is NAND gate called a Universal Gate?

14. State and prove De Morgan's law with the help of a truth table.

15. Draw truth table and circuit diagram for a Half-Adder using only NAND gates.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy