ISC class XI Practice Test 2: Interesting way to learn
ISC class xi computer science practice test
Part
I (10 marks)
This is a ISC class XI practice test for computer students. The topics covered in this paper are Boolean Algebra, Logic gates, Number conversions
Matrix programs
(Attempting
all the answers in this part is compulsory)
Convert the following Hexadecimal to binary & decimal [4]
- F8 b. 1A c. 3B d. ACE
Perform binary multiplication on the following [2]
- 1010*101 b.1101*0101
Convert the following into decimal [4]
- 1101010 b. 01.111 c. 1001.00101 d. 1010111
Part II (20
marks)
isc class xi practice test
(Attempt any two questions)
Question1.
- Explain with logic gate diagram why NAND & NOR gates are called universal gates? [5]
- Explain Full adder circuit with help of logic gate diagram, truth table, Boolean expression? [5]
- Draw logic gate diagram of (x+y+z).(x’+y+z’) using basic gates. [4]
- Explain what is truth table? [2]
Draw logic gate diagram for the following using NOR gate
- P’Q’+PQ+QR [4]
isc class xi practice test
Q3
Prove that for the following using truth table? [4]
- A.(A+B)=A
- (A.B).A’=0
Expand the following [3]
- ASCII
- EBCDIC
- ISCII 3. Explain the rule for binary subtraction? [3]
JAVA videos
Related Posts
Continue learning with these related articles

ISC Practical 2027: College Enrolment Code Validator and Stream Report – Algorithm and Java Program
Fully solved ISC Computer Science Practical 2027 question: validate college enrolment codes made of a stream, year and serial number, give the exact reason for each rejection, auto-correct lowercase streams and prepare a stream-wise report.

ISC Practical 2027: Digital Lock Security Code Analyzer – Algorithm and Java Program
Fully solved ISC Computer Science Practical 2027 number-logic question: for a 5 to 10 digit security code, find the first and last digits, odd and even position sums, product of non-zero digits, digit frequency and classify the code as STRONG, MODERATE or WEAK.

Boolean Algebra for ISC Class 12: Laws, Canonical SOP and POS, and Simplification
ISC Class 12 Computer Science notes on Boolean algebra: all the laws and theorems, duality, De Morgan's laws, minterms and maxterms, converting to canonical SOP and POS, and step-by-step algebraic simplification with solved examples.