JAC 12th Computer Science Important Questions Unit 4/ chapter 4 : For JAC Board Class 12th students, you can read some important questions of Computer Science Unit 4 Boolean Algebra asked in the previous year. These questions are very important for the board exam because questions from previous year questions are often asked in the board exam.
Boolean Algebra Computer Science Important Questions
झारखंड एकेडमिक काउंसिल ( JAC Board) कक्षा JAC 12th Computer Science Important Questions के पिछले वर्षों के सभी महत्वपूर्ण प्रश्न (Important Questions) आपको यहाँ पर बताए जा रहे है, जो बोर्ड परीक्षा के लिए बहुत महत्वपूर्ण है. अगर आप इन सभी प्रश्नों को याद कर लेते हो तो अवश्य ही आप में अच्छे अंक प्राप्त कर सकते हो.
विद्यार्थी इसका उत्तर स्वयं करें। ये सारे प्रश्न आपके परीक्षा में बार – बार पूछे जा रहे है। इसमें आपको सभी chapter का अलग-अलग पिछले 11 वर्षों के महत्वपूर्ण प्रश्न मिलेंगे। यानि 2009-2020 इसमें आपको ये भी बताया जा रहा है कि कौन से प्रश्न किस तरह से एवं कितने Computer Science के JAC 12th Computer Science Important Questions पूछे जा रहें है.
| Name of Organisation | Jharkhand Academic Council Ranchi |
| Category | Important Question |
| Article | JAC 12th Computer Science Important Questions |
| State | Jharkhand |
| Question Types | Previous Year & Important Questions |
| Class | 12th(Inter) |
| Stream | Science |
| Subject | Computer Science |
| Chapter | Unit 4 |
| Chapter Name | Boolean Algebra |
| Telegram | Join Us |
JAC 12th Computer Science Previous Years Important Questions
Unit 4. Boolean Algebra
Q1. Define the following terms: (2009)
a) AND gate
b) OR gate
c) NOT gate
Q2. What do you mean by Full Adder ? Draw the K-map for sum and carry for Full Adder. (2009)
Q3. Write the output of the following circuit : (2009)
Q4. Simplify the following using K-map : (2009)
F(A, B, C, D) = Σ(1, 5, 9, 12, 14, 15)
Q5. What is a full adder ? Explain. (2010)
Q6. Prove that x(x+y)=x by Algebraic method. (2010, 2012)
Q7. Define the following : (2010)
a) Minterm
b) Maxterm
c) Canonical form
Q8. Write the dual of the Boolean Algebra. (2011)
Q9. State De Morgan’s law. Verify one of the De Morgan’s law using truth table. (2011)
Q10. Obtain a Simplified form for a Boolean expression:
F(A, B, C, D)=Σ(0, 1, 4, 5, 7, 8, 9, 12, 13, 15) using K-map method.(2011)
Q11. State and verify Distributive law. (2011)
Q12. Which of the following between equation(s) is/are incorrect? Write the correct form of incorrect ones ? (2012, 2013)
Q13. Open a simplified from for the following Boolean expression using k map : (2012)
F(A, B, C, D)=Σ(0, 3, 4, 5, 7, 11, 13, 15)
Q14. State and prove the De Morgan’s Theorem (XY)’=X’+Y’ algebraically. (2012)
Q15. Represent the Pollen expression (X+Y’).Z with the help of NAND Gates. (2012)
Q16. Prove that X+X’ Y=X+Y algebraically .(2013)
Q17. Obtain the simplified form for the following Boolean expression using Karnaugh map. (2013)
For(A, B, C, D)=Σ(0, 2, 5, 7, 8, 10, 13, 14)
Q18. State Involution Law and verify the same using truth table.(2014)
Q19. Write the Product of Sum from the function f(X, Y, Z). Truth table representation of F is given below. (2014)
| X | Y | Z | F |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 |
Q20. Reduce the following Boolean expression using k map:- (2014)
F(A, B, C, D)=Σ(0, 2, 4, 5, 6, 7, 9, 10, 13, 15)
Q21. Write the equivalent Boolean expression for the following logic circuit . (2014)
Q22. Prepare a truth table for XY + YZ’ + (XZ)’ . (2015, 2017)
Q23. Obtain as simplified form for the following Boolean expression using Karnaugh map -(2015)
F(A, B, C, D)=Σ(0, 1, 2, 4, 5, 6, 8, 10, 12, 13, 14)
Q24. Prepare a truth table for (A+B)’. (2016)
Q25. State and verify De Morgan’s law in Boolean Algebra using truth table :- (2016)
a) (X+Y)’ =X’ Y’
b) X’ Y’ =X’+Y’
Q26. Obtain a simplified form for the following Boolean expression using k-map :- (2017)
F(A, B, C, D) =Σ(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
Q27. Prepare a truth table for XYZ+YZ’+ X’Z’.(2018)
Q28. Obtain a simplified form for the following Boolean expression using k-map:- (2018)
F(A, B, C, D) =Σ(0, 1, 2, 3, 5, 7, 8, 9, 10, 11, 13, 15)
Q29. Prepare a truth table for ABC’ + BC. (2019)
Q30. Obtain a simplified form for the following Boolean expression using k-map :- (2019)
F(A, B, C, D) =Σ(0, 2, 5, 7, 8, 10, 13, 15)
Q31. Explain the concept of minterm and maxterm. (2020)
Q32. Draw the circuit diagram and truth table of X+X’Y. (2020)
Q33. What is logic gates? Explain fundamental logic gates with circuit diagram and truth table. (2020)
विद्यार्थी इन सारे प्रश्नों का उत्तर स्वयं लिखे एवं अगर विद्यार्थी और भी प्रीवियस ईयर क्वेश्चन प्रश्न पढ़ना चाहते हैं तो हमारे मोबाइल एप्लीकेशन को डाउनलोड करके वहां से पढ़ सकते हैं.
Conclusion
उम्मीद करते हैं या आर्टिकल(JAC 12th Computer Science Important Questions) आपको पसंद आया होगा अगर आया हो तो कृपया करके अपना प्यारा सा कंमेंट नीचे कर दे उसके साथ ही अधिक अपडेट जानने के लिए हमारे टेलीग्राम ग्रुप में ज्वाइन कर ले.
