COA | Unit-2 | Lecture-18 | Booth's Algorithm Examples | AKTU B.Tech Computer Science

Welcome to CS Pathshala! 🎓

In this video, we solve Booth’s Algorithm Examples step-by-step to help you understand how signed binary multiplication is performed using 2’s complement representation.

You’ll learn how Booth’s rules (00, 01, 10, 11) are applied during each step, how the algorithm reduces repeated additions/subtractions, and how the A, Q, SC registers and Q₋₁ bit work together during shifting and updating operations.
We demonstrate multiple solved examples — including positive × positive, positive × negative, and negative × negative cases — so you can clearly see how sign handling, partial products, and final results are computed.

With detailed tables and systematic calculations, this lecture makes Booth’s algorithm easy to follow and helps you avoid common mistakes in exam questions.

This session is a continuation of Booth’s Algorithm (Part 1) from Unit 2 – Arithmetic Algorithms in COA as per the AKTU syllabus, and is very helpful for GATE and NET Computer Science aspirants.

📚 Stay tuned for more concept-based lectures on COA, OS, DBMS, DS, TAFL, Java, and Python.
👉 Don’t forget to Like, Share & Subscribe to CS Pathshala!

#CSPatshala #COA #ComputerOrganization
#ComputerArchitecture #BoothsAlgorithm
#SignedMultiplication #TwosComplement
#BinaryMultiplication #ArithmeticAlgorithms
#ArithmeticAlgorithms #ALU
#COAUnit2 #COALecture18
#EngineeringNotes #BTechCSE
#AKTU #GATECS #NETComputerScience
#COAinHindi #VishvendraChaudhary
#BTechNotes #DigitalArithmetic
#TwosComplementRepresentation #CSE3rdSem

👉 Subscribe here:    / @cspatshala