Booth's Algorithm
Duration: 9 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
- Paper 2 | Compiler Design: Intro to Compilers Lexical Analysis Grammar & CFG Syntax Analysis: Top-Down Syntax Analysis: Bottom-Up Semantic Analysis & SDT Intermediate Code Gen Code Optimization Run Time Environment
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
- Paper 2 | Computer Networks: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control DLL: Framing Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces Booth's algorithm, a method for optimizing binary multiplication by reducing the number of additions and subtractions required. Named after Andrew Donald Booth (1918–2009), the algorithm examines pairs of multiplier bits to determine whether to add, subtract, or shift. The instructor demonstrates the process using a concrete example of multiplying 7 by 3, utilizing a step-by-step table and flowchart to illustrate the four-cycle execution. Key registers involved include A (accumulator), Q (multiplier), Q-1 (auxiliary bit), and M (multiplicand). The algorithm relies on arithmetic shift right operations and decision logic based on the values of Q0 and Q-1 to control addition or subtraction of M from A.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with an introduction to Booth's algorithm and its creator, Andrew Donald Booth. The slide displays biographical dates (1918–2009) and defines the algorithm's purpose: optimizing binary multiplication by reducing additions and subtractions. The instructor explains that the process involves examining multiplier bits to decide whether to add, subtract, or leave the multiplicand unchanged before shifting. A flowchart is introduced to visualize the logic, and a specific example of multiplying 7 by 3 is presented using a step-by-step table to illustrate the algorithm's execution over four cycles.
2:00 – 5:00 02:00-05:00
The instructor demonstrates the Booth algorithm execution for 7 x 3 using a detailed table and flowchart. Initial values are set in registers A, Q, Q-1, and M (0000 0011 0 0111). The first cycle involves the operation A <- A - M followed by an arithmetic shift right. The second cycle shows a shift-only operation because Q0 and Q-1 are both 1. The third cycle performs A <- A + M, followed by another shift. The instructor points to the flowchart decision diamond checking Q0 and Q-1 values to determine operations, tracing the algorithm steps through cycles while highlighting binary subtraction and addition logic.
5:00 – 8:40 05:00-08:40
The demonstration continues with the final cycles of Booth's algorithm for 7 x 3. The screen displays the execution of four cycles involving addition, subtraction, and arithmetic shift operations on registers A, Q, and M. The instructor highlights specific bit changes during addition/subtraction and shifting operations across the cycles. The final result of the multiplication is highlighted at the bottom of the table, confirming the correctness of the algorithm. The visual evidence shows the flow of data between registers A and Q, with the final answer circled in red to emphasize the outcome.
Booth's algorithm is a significant optimization in arithmetic logic units for binary multiplication. By analyzing adjacent bits of the multiplier (Q0 and Q-1), it reduces the number of arithmetic operations compared to standard multiplication methods. The algorithm uses four main registers: A (accumulator), Q (multiplier), Q-1 (auxiliary bit initialized to 0), and M (multiplicand). The core logic involves checking the pair Q0, Q-1: if 01, subtract M from A; if 10, add M to A; otherwise, do nothing. After each operation (or lack thereof), an arithmetic shift right is performed on A and Q combined, preserving the sign bit. The example of 7 x 3 demonstrates this process clearly over four cycles, showing how the algorithm handles both positive and negative operations to arrive at the correct product efficiently. This method is particularly useful in hardware implementations where minimizing addition/subtraction cycles improves performance.

