NEB Class 11 • Computer Science • Boolean Logic • Concept Guide

Boolean Algebra, Logic Gates & Laws: NEB Class 11 Computer Guide

Master Boolean Algebra, Logic Gates and Laws through clear concepts, representations, a reliable answer method and exam-focused practice.

ConceptsWorked reasoningNEB practice

Core concept

What Boolean Algebra, Logic Gates and Laws means physically

Boolean algebra models two-valued logic and digital circuits. Gates implement operations, laws simplify expressions, and truth tables verify equivalence across all input combinations.

A+0=A, A·1=A, A+A′=1, A·A′=0; De Morgan: (AB)′=A′+B′ and (A+B)′=A′B′.

The institutional reference gives the wider physical model; the CDC curriculum determines the NEB boundary.

Worked checkpoint with interpretation

F=A+AB simplifies to A by absorption, so the extra AND path does not change the output.

Do not stop at the number. State what the sign, ratio, spacing, frequency or direction means. A common error is Using arithmetic addition rules, forgetting complements on every term in De Morgan transformations, or claiming equivalence after checking one row.

NEB answer method

Model → evidence → equation → check

First identify the system and what the question asks. Label the diagram, apparatus or reaction with SI quantities, then state the principle before selecting an equation. Solve symbolically where possible and check units, limiting cases and chemical or physical meaning.

Stage	Question	Evidence
Model	What is idealised?	Assumption stated
Representation	Which diagram fits?	Labels or balanced equation
Calculation	Which relation follows?	Symbols then SI values
Evaluation	Does it make sense?	Unit, sign and trend check

Make the idea concrete in Nepal

Connect the model to a school laboratory, household technology, health, environment, energy or local material. The example should clarify the science rather than merely mention a place. Compare a prediction with an observation and record uncertainty.

Review the NEB Class 11 Computer Science revision roadmap and the complete Computer Science guide. For online or physical tuition, call 9846662070.

Frequently asked questions

Questions students ask about Boolean Algebra, Logic Gates and Laws

What is the central idea of Boolean Algebra, Logic Gates and Laws?+

Boolean algebra models two-valued logic and digital circuits. Gates implement operations, laws simplify expressions, and truth tables verify equivalence across all input combinations.

Which equation should I remember?+

A+0=A, A·1=A, A+A′=1, A·A′=0; De Morgan: (AB)′=A′+B′ and (A+B)′=A′B′.

How should I begin a numerical?+

Draw the situation, list known quantities in SI units, choose the governing relation symbolically, substitute once and finish with a unit and reasonableness check.

What is a common exam mistake?+

Using arithmetic addition rules, forgetting complements on every term in De Morgan transformations, or claiming equivalence after checking one row.

How can I practise this topic?+

Alternate one concept explanation, one diagram and two numericals. Revisit errors after a day instead of only rereading the solution.

Where can I get tuition support?+

For online or physical KTM Tuition classes, call 9846662070. After Grade 12, the MKS Education panel below gives preparation and pre-counselling contacts.

References and next steps

Scope checked against CDC Nepal; concept support from an institutional reference and OpenStax Science. Continue with the Boolean Algebra, Logic Gates and Laws cluster.

Continue planning