12th Standard CBSE Syllabus & Materials
12th Standard CBSE
CBSE 12th Economics Government Budget and the Economy Previous year Question Papers Study Material - QB365 Set A
NEW12th Standard CBSE
CBSE 12th Computer Science Interface Python with MySQL - New Previous year Question Papers Study Material - QB365 Set A
NEW12th Standard CBSE
CBSE 12th Computer Science Database Concept - New Previous year Question Papers Study Material - QB365 Set A
NEW12th Standard CBSE
CBSE 12th Computer Science Data Communication - New Previous year Question Papers Study Material - QB365 Set A
NEW12th Standard CBSE
CBSE 12th Computer Science Data Structures - New Previous year Question Papers Study Material - QB365 Set A
NEW12th Standard CBSE
CBSE 12th Computer Science Functions - New Previous year Question Papers Study Material - QB365 Set A
Published on: 25/09/2019
Boolean Algebra
Download CBSE Class 12th Standard CBSE Computer Science question papers, sample papers, important questions, and previous year solved papers in PDF format. Get free study materials, NCERT solutions, and exam preparation resources for Class 12th Standard CBSE Computer Science
Questions + Answers key
Take MCQ Computer Science Test
1.
Give the logic function F=AB+A’B’+A’B. Assuming the complements are available. Simplify the function using De Morgan’s Theorem. Synthesize F by using NOR gates only.
2.
Simplify for the function F=π(0,3,7,8,9,12,13)
3.
There are 4 parallel railway tracks at a place. It is desired to design a logic circuit, which can give a signal when three or more trains pass together at any given time
i) Draw the truth table for the above problem
ii) Simplify the expression using K – Map
iii) Draw the circuit diagram
4.
Reduce the following Boolean Expression with the help of Karnnaugh Map F(U,V,W,Z)=S(0,1,2,3,12,13,14,15)
5.
Given the logic function F = xyz + yz’w + x’yz. Minimize it using K- Map.
6.
If F(a,b,c,d) = (0,1,3,4,5,7,8,9,11,12,13,15), obtain the simplified form using KMap
7.
If F(a,b,c,d)=(0,2,4,5,7,8,10,12,13,15), obtain the simplified form using K-Map
8.
Reduce the folowing Boolean expression ussing K-Map
F(U,V,W,Z)=\(\Sigma \)(0,1,2,3,4,10,11)
9.
Reduce the following Boolean Expression using K-Map:
F(A,B,C,D)= \(\Sigma \)(0,1,2,4,5,6,8,10)
10.
Reduce the following Boolean expression using K-Map:
F(A,B,C,D)=(0,1,2,4,5,8,9,10,11)
1.
2.
3.
4.
5.
6.
7.
8.
F=U'.V'+W.V"+U".W"Z'
9.
F(A,B,C,D)=A'C'+A'D'+B'D'
10.
F(A,B,C,D)= A’.C’+A.B’ + B’.D’
12th Standard CBSE Syllabus & Materials
12th Standard CBSE
CBSE 12th Computer Science Python Revision Tour I - New Previous year Question Papers Study Material - QB365 Set A
NEW12th Standard CBSE
CBSE 12th Business Studies Planning Important Questions And Answers Study Material - QB365 Set A
NEW12th Standard CBSE
CBSE 12th Business Studies Business Environment Important Questions And Answers Study Material - QB365 Set A
NEW12th Standard CBSE
CBSE 12th Business Studies Principles of Management Important Questions And Answers Study Material - QB365 Set A
CBSE 12th Standard CBSE Subjects
CBSE Standards
