Practice TestsISCClass 12Computer Science

ISC MCQ

ISC MCQ: ISC Class 12 Computer Science practice test with important questions to revise before the computer exam.

Updated
Practice Tests

ISC MCQ

http://www.youtube.com/trushnatej

ISC MCQ Boolean algebra

Download the paper

Answer Key

PDF · 89 KB

Download PDF
Read the questions as text
Practise test (MCQ) Standard: XII Subject: Computer Question 1. A training institute intends to give scholarships to its students as per the criteria given below: The student has an excellent academic record but is financially weak. OR The student does not have an excellent academic record and belongs to a backward class. OR The student does not have an excellent academic record and is physically impaired. The inputs are: (In all the above cases 1 indicates Yes and 0 indicates No). Output: X [1 indicates Yes, 0 indicates No for all cases] Draw the truth table for the inputs and outputs given above and answer the following questions. 1.The SOP expression for X(A, F, C, I) will be: [2] (i)X(A, F, C, I) = ∑ (1,2, 3, 5,6,7,12,13,14,15) (ii)X(A, F, C, I) = π (3, 5, 7, 11, 12, 13, 14, 15) (iii)X(A, F, C, I)= π (0, 1, 2, 3, 4,10,11) (iv)X(A, F, C, I) = ∑ (1, 3, 5, 6, 7, 10, 11, 12, 13, 14, 15) 2. The maximum input combinations for the above truth table will be:[1] (i)24 (iii)8 (iv)12 (ii)16 Question 2. F(A, B, C, D) = Σ (1,2,3,4,5,9,10,11,12). Reduce the above expression by using a 4-variable Karnaugh Map and answer the following questions. (A) What will be the least number of groups and their types formed for reduction? [2] 1. 3 quads 3. 1 quad and 2 pairs 2. 6 pairs 4. 2 quads and 2 pairs (B) The reduced expression of the Boolean function given above is:[1] (i)(B+C).(B+D).(A’+D) (iii)AB’ + C’D’ + B’D’ (ii)BC + AC + BD' (iv)B'D + B'C + A'C'D + BC'D' Question 3. F (A,B,C,D) = Π (0,1,2,3,6,7,10,11, 13, 14, 15) Reduce the above expression by using a 4-variable Karnaugh Map and answer the following questions. (A) What will be the least number of groups and their types formed for reduction?[2] 1. 3 quads 3. 1 octet, 1 quad and 1 pair 2. 6 pairs 4. 2 quads and 1 pair (B) The reduced expression of the Boolean function given above is: [1] (i)(A'+D)(B'+C')(A+B+C) (iii)(A'+B')(C+D')(C+A) (ii)(A’)(D'+C)(A+B) (iv)(C') (A + B) (A' + B' + D') Question 4. F (P, Q, R, S) =π (0, 1, 2, 8, 9, 11, 13, 15). Reduce the above expression by using a 4-variable Karnaugh Map and answer the following questions. (A) What will be the least number of groups and their types formed for reduction?[2] 1. 3 quads 3. 1 quad and 2 pairs 2. 6 pairs 4. 2 quads and 1 pair (B) The reduced expression of the Boolean function given above is: [1] (i)(P'+S’)(Q+R)(Q+P+S) (iii)(P'+S')(Q+R')(Q+S) (ii)(S)(Q'+P)(R+S) (iv)(P+S)(Q'+P')(Q'+S) Question 5. F(A, B, C, D) = Σ (1,3,5,6,7,10,12,14,15). Reduce the above expression by using a 4-variable Karnaugh Map and answer the following questions. (A) What will be the least number of groups and their types formed for reduction?[2] 1. 3 quads 3. 1 quad and 2 pairs 2. 6 pairs 4. 2 quads and 2 pairs (B) The reduced expression of the Boolean function given above is:[1] (i)(B+C).(B+D).(A’+D) (iii)AB’ + C’D’ + B’D’ (ii)CD’ + AC’ + B’.C.D’ (iv)A'D + BC + ACD' + ABD'