0% found this document useful (0 votes)
0 views2 pages

Class11 CS QuestionPaper ComputerSystem NumberSystem BooleanLogic

This document outlines the syllabus for Class 11 Computer Science, covering topics such as Computer Systems, Number Systems, and Boolean Logic. It includes a structured examination format with sections A, B, C, and D, detailing the types of questions and marks distribution. The exam consists of compulsory questions with internal choices, totaling 100 marks over a duration of 3 hours.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
0 views2 pages

Class11 CS QuestionPaper ComputerSystem NumberSystem BooleanLogic

This document outlines the syllabus for Class 11 Computer Science, covering topics such as Computer Systems, Number Systems, and Boolean Logic. It includes a structured examination format with sections A, B, C, and D, detailing the types of questions and marks distribution. The exam consists of compulsory questions with internal choices, totaling 100 marks over a duration of 3 hours.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Class 11 – Computer Science

Chapters: Computer System, Number System, Boolean Logic

Maximum Marks: 100 Time Allowed: 3 Hours

General Instructions:

 All questions are compulsory.


 Internal choices are provided wherever applicable.
 Marks are indicated against each question.

Section A (1 mark × 10 = 10 marks)


1. Write the full form of ASCII.

2. Name one input and one output device.

3. What is the base of the binary number system?

4. Which logic gate outputs 1 only when both inputs are 1?

5. Convert (1101)₂ to decimal.

6. Which part of the computer performs calculations?

7. Write the Boolean expression for an OR gate.

8. What is the decimal equivalent of (A)₁₆?

9. Write one advantage of a Solid-State Drive over a Hard Disk Drive.

10. Which number system uses digits 0–9 and A–F?

Section B (2 marks × 10 = 20 marks)


11. Convert the binary number 101011 to decimal and octal.

12. Differentiate between volatile and non-volatile memory.

13. State the difference between RAM and ROM.

14. Convert the decimal number 29 to binary and hexadecimal.

15. Write the truth table for an AND gate.

16. What is the role of the ALU in a computer system?


17. State the associative law in Boolean algebra with an example.

18. Convert (1101011)₂ to hexadecimal.

19. Draw the symbol of a NOT gate and write its Boolean expression.

20. Write any two characteristics of computer systems.

Section C (3 marks × 10 = 30 marks)


21. Explain the functions of the CPU with its components.

22. Convert the following: (a) 10011011₂ to decimal, (b) 97 to binary, (c) 3F₁₆ to decimal.

23. Draw the truth table and symbol of an OR gate and a NAND gate.

24. Explain primary and secondary memory with examples.

25. Convert (153)₁₀ to binary, octal, and hexadecimal.

26. Draw the logic circuit diagram for the Boolean expression: A + A·B.

27. Differentiate between compiler and interpreter.

28. Perform the binary addition: (1011)₂ + (1101)₂.

29. Explain the term 'Boolean Constant' and give examples.

30. Write any three differences between analog and digital computers.

Section D (5 marks × 8 = 40 marks)


31. Explain the types of software with examples.

32. Convert: (a) 11011001₂ to decimal, (b) 241₈ to binary, (c) 2F₁₆ to binary.

33. Simplify the Boolean expression using laws: A + A·B

34. Explain the components of a computer system with a neat diagram.

35. Design a logic circuit for the expression: (A + B) · (A + C)

36. Write short notes on: (a) Cache memory, (b) SSD, (c) Registers.

37. Perform the subtraction using 2’s complement: 1001 – 0110 (in binary).

38. Explain the various number systems used in computer science with suitable examples.

You might also like