Syllabus by chapter · অধ্যায়ভিত্তিক সিলেবাস

Number Systems & Codes · 54 questions: SOP Expression Simplification, Hex-Decimal-Binary-Octal Conversion, Boolean Simplification, 2's Complement, JK vs D Flip-Flop, Binary to Decimal Conversion (with fraction), 2's Complement Representation and Arithmetic, 8-bit ADC Binary Output Calculation, Decimal to Octal and Hexadecimal Conversion
Boolean Algebra & K-Maps · 47 questions: 4-Variable K-Map Simplification, Boolean Expression Simplification, De Morgan's Theorem, Boolean Expression Evaluation & Simplification, K-Map Minimization (4-variable SOP), Deriving a Boolean Function from a Truth Table (Output = 1 Cases)
Logic Gates · 45 questions: Universal Gates (NAND/NOR), Full Adder Truth Table & Design, Universal Gates — NAND-only Implementation, Implementing AND/OR Gates Using Minimum NAND/NOR Gates, Universal Gates -- NAND & NOR, Basic Logical Operations AND OR NOT
Combinational Circuits · 16 questions: Building a 6:1 MUX from 2:1 MUX Blocks, Half Adder Circuit, 8-to-1 Multiplexer (MUX), 2-bit Magnitude Comparator (A>B), Multiplexers, Half Adder to Full Adder
Sequential Circuits · 19 questions: Combinational vs Sequential Circuits, Counter-Type Analog-to-Digital Converter (ADC), Clock Frequency Divider using T Flip-Flops, Latch vs Flip-Flop, Register vs Latch, Synchronous Circuits & Clock Synchronization
Mixed Topics · 64 questions: DAC Resolution Calculation, Characteristics of Digital ICs, Series-Parallel Resistor Network — Finding R and I, Inverting Amplifier Gain (Ideal Op-Amp), Pulse Code Modulation (PCM) — A/D Conversion, LED vs Laser Diode & Diode Functions

Loading sample questions…

Start learning: Boolean Algebra and Logic Gates · বুলিয়ান অ্যালজেবরা ও লজিক গেট

Introduction

Boolean algebra is the mathematics of two values — 0 and 1 (also read as false/true or low/high). Every digital device — a CPU, a calculator, a router, a memory chip — is built from tiny switches that are either OFF (0) or ON (1). Boolean algebra gives us the rules for combining these two values, and logic gates are the physical (electronic) circuits that carry out those rules.

For the exam this is one of the highest-yield chapters in Digital Logic Design. BCS, Bank IT, and IT-officer papers repeatedly ask: the truth table of a gate, the number of NAND gates needed to build something, simplification using Boolean laws or K-maps, De Morgan's theorems, and "which gate is universal". Master this chapter and you can answer nearly every digital-logic MCQ quickly and correctly.

Learning objectives

Define Boolean variables, constants, and the three basic operations (AND, OR, NOT).
State and use the postulates and theorems of Boolean algebra, including De Morgan's theorems.
Draw and recall the truth tables and symbols of all seven gates: AND, OR, NOT, NAND, NOR, XOR, XNOR.
Explain why NAND and NOR are "universal" gates and build other gates from them.
Simplify Boolean expressions using algebraic laws and Karnaugh maps (K-maps).
Convert between an expression, a truth table, and a logic circuit; understand SOP and POS forms.
Avoid the standard exam traps (precedence, De Morgan, XOR vs OR).

Read the whole lesson free with an account · পুরো পাঠ পড়তে বিনামূল্যে সাইন আপ করুন

All 8 lessons · সব পাঠ

Boolean Algebra and Logic Gates · বুলিয়ান অ্যালজেবরা ও লজিক গেট
Combinational Circuits: Adders, Multiplexers, Decoders · কম্বিনেশনাল সার্কিট: অ্যাডার, মাল্টিপ্লেক্সার, ডিকোডার
Karnaugh Map (K-map) Simplification · কার্নো ম্যাপ (K-map) সরলীকরণ
Flip-Flops and Latches · ফ্লিপ-ফ্লপ ও ল্যাচ
Counters and Registers · কাউন্টার ও রেজিস্টার
Binary Arithmetic and Signed Number Representation · বাইনারি গাণিতিক ও চিহ্নিত সংখ্যা উপস্থাপন
Number Systems, Base Conversions and Codes · সংখ্যা পদ্ধতি, বেস রূপান্তর ও কোড
ADC, DAC, Comparators and Digital ICs · ADC, DAC, তুলনাকারী ও ডিজিটাল IC

All guides · Exam guides · Past papers