Browse all subjects

Back to Digital Logic

Digital Logic · Reading course

Make logic work.
From bits to state machines.

All 55 roadmap items, practice questions, 24 diagrams, the final test, and its answer key, organized into a start guide and eight syllabus phases.

Start reading Explore in 3D Official CS syllabus ↗

57 reading items · 9 phases · Worked examples & practice

YOUR DIGITAL LOGIC PROGRESS

0%

0 of 57 reading items completed

Complete an item when you’re ready. Your place is saved in this browser.

Your path through Digital Logic

Lessons, chapter reviews, and checkpoints—in reading order.

Begin hereStart here0 / 1 complete

START.1How to use these notesStudy guide

01Phase 0Number Systems from Zero0 / 5 complete

0.1.1What "digital" means: bits, binary numbers and place valueLesson 0.1.2Octal, hexadecimal and converting between any two basesLesson 0.1.3Binary arithmetic by hand; how many values n bits can holdLesson LI-0.1Bits and basesChapter review CP-0Number Systems from ZeroCheckpoint

02Phase 1Signed Numbers & Binary Arithmetic0 / 6 complete

1.1.1Sign-magnitude, 1's complement and 2's complementLesson 1.1.22's-complement arithmetic: addition, subtraction, overflow, sign extensionLesson 1.1.3Shifts, multiplication and Booth's algorithmLesson 1.2.1Binary codes: BCD, excess-3, Gray code and parityLesson LI-1.1-1.2Chapters 1.1–1.2 Lock-in — Signed numbers & Binary codesChapter review CP-1Signed Numbers & Binary ArithmeticCheckpoint

03Phase 2Fixed & Floating Point0 / 5 complete

2.1.1Fixed-point binary fractions: range, precision and roundingLesson 2.1.2Floating point and IEEE 754: sign, biased exponent, mantissaLesson 2.1.3IEEE 754 special values, denormals, range, precision and gapsLesson LI-2.1Real numbers in binaryChapter review CP-2Fixed & Floating PointCheckpoint

04Phase 3Boolean Algebra & Logic Gates0 / 8 complete

3.1.1Logic gates and truth tablesLesson 3.1.2Boolean algebra: laws, duality, De Morgan and algebraic simplificationLesson LI-3.1Gates and lawsChapter review 3.2.1Canonical forms: minterms, maxterms, SOP and POSLesson 3.2.2NAND and NOR as universal gates; functionally complete setsLesson 3.2.3Counting Boolean functions; self-dual functions; XOR tricksLesson LI-3.2Forms and complete setsChapter review CP-3Boolean Algebra & Logic GatesCheckpoint

05Phase 4Minimization0 / 6 complete

4.1.1Karnaugh maps for 2, 3 and 4 variables: adjacency and groupingLesson 4.1.2Prime implicants, essential prime implicants, minimal SOP and POSLesson 4.1.3Don't-care conditions and 5-variable mapsLesson LI-4.1Karnaugh mapsChapter review 4.2.1The Quine–McCluskey tabular methodLesson CP-4MinimizationCheckpoint

06Phase 5Combinational Circuits0 / 9 complete

5.1.1Combinational circuits: analysis, design and propagation delayLesson 5.1.2Half adder, full adder and the ripple-carry adderLesson 5.1.3Carry-lookahead adder, adder–subtractor and comparatorsLesson LI-5.1Arithmetic circuitsChapter review 5.2.1Multiplexers, and implementing functions with themLesson 5.2.2Decoders, encoders, priority encoders and demultiplexersLesson 5.2.3ROMs and PLAs: programmable logicLesson LI-5.2Data-routing circuitsChapter review CP-5Combinational CircuitsCheckpoint

07Phase 6Sequential Circuits0 / 10 complete

6.1.1Latches: the SR latch and the gated D latchLesson 6.1.2Flip-flops: SR, D, JK and T; characteristic and excitation tablesLesson 6.1.3Converting flip-flops; timing and the maximum clock frequencyLesson LI-6.1Storage elementsChapter review 6.2.1Registers, shift registers, ring and Johnson countersLesson 6.2.2Asynchronous (ripple) counters and mod-N countersLesson 6.2.3Synchronous counters: analysis and designLesson 6.2.4Finite state machines: Mealy and Moore, sequence detectors, state minimisationLesson LI-6.2Counters and state machinesChapter review CP-6Sequential CircuitsCheckpoint

08Phase 7Integration & Final Testrule sheet · 3 practice sets · drill · final test0 / 7 complete

7.1.17.1.1 — Master Rule Sheet (all rule cards merged)Revision 7.2.17.2.1 — Mixed practice set 1Revision 7.2.27.2.2 — Mixed practice set 2Revision 7.2.37.2.3 — Mixed practice set 3Revision 7.3.17.3.1 — GATE pattern drill: recurring patterns and fastest methodsRevision 7.4.1Final end-to-end testFinal test 7.4-keyFinal Test — Answer KeyAnswer key

A good way to read

01 · Think before revealingTry the Predict First and self-test questions. Open the Answer Vault when you’re ready.

02 · Keep track of understandingMark each reading item complete yourself. The reading-position bar simply shows where you are on the page.

03 · Revisit what mattersUse chapter reviews, checkpoints, and revision pages to connect ideas. The imported practice is self-checked against the supplied answers.

Your progress, your copy.

Saved in this browser. Export a backup to move your TOC progress to another device.

The complete notes were supplied by the site owner. Their answers have not been independently fact-checked. Check the official GATE 2027 CS syllabus for exam scope. Reading progress is separate from the Atlas topic checklist.