Navigation Menu
Home
Full Length Papers
News Blog
PU CSS Entry Computer Science Boolean Algebra and Logic Gates MCQs Test 2
Computer Science

PU CSS Entry Computer Science Boolean Algebra and Logic Gates MCQs Test 2

Free preview: First 4 questions are free. After that (or after 3 minutes, whichever comes first) you'll need to unlock the full quiz.

Practice PU CSS 2026 Entry Test Computer Science MCQs from Boolean Algebra and Logic Gates. Get instant results with Explanation.

Practice Quiz 2 for "Boolean Algebra and Logic Gates" (Computer Science). Total 21 MCQs available, split into 3 quizzes. Test your understanding of core concepts. Mastering these concepts is essential for securing a high percentile in PU CSS.

📋 PU CSS - Test Online Practice Quizzes

Punjab University Entry Test PU-CSS

Conducting Body: University of The Punjab (PU)
Frequency: Bi-Annual | Time: 80 Minutes
Negative Marking: No

⚡ Test Pattern (Total: 100 MCQs):

Merit Formula: Merit Formula: Intermediat 50% Matric 25% PU M Entry Test 25%

1. What is a NAND gate?
2. What is a NOR gate?
3. When does an XOR gate output 1?
4. Which gates are called universal gates?
5. What can a NAND gate create?
6. What is De Morgan's first law?
7. What is De Morgan's second law?
8. What are De Morgan's laws used for?
9. What is the simplification of (A · B)' using De Morgan's law?
10. What does XOR stand for?
Follow Us