
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

ISC Class XII Sample / Model Paper 2025 : Computer Science : Monthly test

6 pages, 40 questions, 0 questions with responses, 0 total responses,

Santhiya Ak
Idhayam Rajendran Residential School, Madurai

+Fave Message

Profile Timeline Uploads

Home > santhiya86 >

Formatting page ...

IDHAYAM RAJENDRAN SCHOOL Monthly Test 1(2024-2025) STD: XII SUB: COMPUTER SCIENCE Marks :70 Duration: rs Answers to this Paper must be written on the paper provided separately. You will not be allowed to write during the first 10 minutes. This time is to be spent in reading the Question Paper. The time at the head of this paper is the time allowed for writing the answers. _______________________________________________________________________________ Answer all questions in Part I and Part-II (compulsory), All working, including rough work, should be done on the same sheet. The intended marks for questions or parts of questions are given in brackets [ ]. _________________________________________________________________________ PART I 20 MARKS Answer all questions. While answering questions in this Part, indicate briefly your working and reasoning, wherever required. Question 1 (i) The Boolean equation which holds true for the Involution Law is: [ ] (a) A +1=1 (b) ((A+B) ) =A+B (c) (A+B) =A .B (d) A.(B+C)=(A+B).C (ii) Given the proposition A B , then the inverse of the proposition is [ ] (a) A B (b)B A (c) A B (d) B A (iii) The reduced expression of the Boolean function F=A(B+C(AB+AC) ) is [ ] (a) 1 (b) 0 (c) A C+AB (d) AB (iv) The logic of objects is called as[ ] (a) Propositional Logic (b) Uncertainity Logic (c) Predicate Logic (d) Temporal Logic (v) Propositions are also called as [ ] (a) Statements (b)Sentences (c)Both (a) & (b) (d) None (vi) The basic elements of circuits are called as [ ] (a) Logics (b)Gates (c)Boolean (d) Adders (vii) Which of the following are used to keep abstraction and modularity in hardware design? [ ] (a) Encoders (b) Decoders (c) Multiplexer (d) Half Adder (viii) Write the Boolean expression for NAND gate. [ ] (ix) The expression for Sum of Full Adder is [ ] (a) (a+b ).(b+c ).(a+c ) (b) a b (c) a b c (d) a b+ab +a c (x) Which of the following is not a valid jump statement? [ ] (a) break (b) return (c) continue (d) go to Page 1 of 6 XII / Monthly I / Comp/ AJS

Formatting page ...

santhiya86 chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: