In this page we have given CBSE Board Class 12 Computer Science with Python Book Chapter Boolean Functions and Reduce Forms MCQ Question and Answer. All the questions below are important for our CBSE Champs.
- Board – CBSE.
- Class – 12
- Subject- Computer Science with Python.
- Topic- MCQ.
- Number of MCQ- 15.
1.) In Boolean function, a ………………………. can appear in ay form, normal (a) or complemented (a’).
a.) Boolean Logic b.) Boolean Algebra
c.) Boolean Variable
d.) None of these
Ans – c.) Boolean Variable
2.) Boolean expression formed on two variables a & b using …………………… operator
a.) AND
b.) BUT
c.) CAN
d.) DON’T
Ans – a.) AND
3.) The abbreviation of SPT is
a) Standard Product Time
b) Stand Product Time
c) Standard Product Taken d) None of these
Ans – a.) Standard Product Time
4.) A ………………………. is obtained from AND term, with each variable being complemented, if the corresponding bit of binary number (in the truth table) is 0 and normal (i.e non complemented) if the bit is 1
a.) Boolean Variable
b.) Min term
c.) Boolean Logic
d.) All of these
Ans – b.) Min term
5.) OR terms are called as …………………….
a.) max terms
b) only reserved
c) once reserved
d) Min terms
Ans- a.) max terms
6.) SST stands for
a.) Social Studies
b.) Standard Sum Time
c.) Standard Set Time
d.) None of these
Ans – b.) Standard Sum Time
7.) Karnaugh map was developed by………………….. at Bell Labs in 1953.
a.) Steve Jobs
b.) Henry Fayol
c.) Maurice Karnaugh
d.) Katy Bhavnagari
Ans – c.) Maurice Karnaugh
8.) It is nothing more than a special forms of truth table representation useful for reducing logical functions into minimal Boolean expressions.
a.) Fayol map
b.) Karnaugh map
c.) Zenobia map
d.) Hawking map
Ans- b.) Karnaugh map
9.) It is a diagram, made up of squares represents one min term.
a.) K-map
b.) Katy map
c.) F- map
d.) H-map
Ans- a.) K-map
10.) SOP stands for
a.) Subject of Product
b.) Sum of Product
c.) Size of Product
d.) Sample of Product
Ans – b.) Sum of Product
11.) It is a sum term with the n literals resulting into 0
a.) max term
b.) min term
c.) average term
d.) today term
Ans – a.) max term
12.) It is a single literal or the logical sum of two or more literals.
a.) sum term
b.) product term
c.) max term
d.) min term
Ans – a.) sum term
13.) It is a single literal or the logical product of two or more literals.
a.) sum term
b.) product term
c.) max term
d.) min term
Ans – b.) product term
14.) This expression is a logical OR of two or more AND terms.
a.) POS
b.) SOP
c.) SOS
d.) POP
Ans- b) SOP
15.) It is logical AND of two or more OR terms
a.) POS
b.) SOP
c.) SOS
d.) POP
Ans – a.) POS
Hope above Chapter Boolean Functions and Reduce Forms MCQ will help You. For any doubts please contact us. Our Computer Science Teacher will help You.