Booth's Algorithm

Computer Architecture

Authors

  • Pam Smallwood Regis University

Abstract

In this activity, students will learn how to apply Booth’s algorithm to multiply two signed 2’s complement binary integers. Prior to this activity, students should know how to convert signed decimal values to and from their binary 2’s complement representation, and be able to determine the range of values that can be represented by 2’s complement within a specified number of bits. The activity was designed for use in a Computer Organization & Architecture course, but could be used in any course that covers how computers perform integer multiplication.

After completing this activity, students will be able to:

  • Identify the multiplicand and multiplier for multiplication
  • Apply Booth’s algorithm to multiply signed 2’s complement binary integers

This activity was developed with NSF support through IUSE-1626765. You may request access to this activity via the following link: IntroCS-POGIL Activity Writing Program. 

  • Level: Undergraduate
  • Setting: Classroom
  • Activity Type: Application
  • Discipline: Computer Science
  • Course: Computer Architecture
  • Keywords: Booth’s algorithm, binary multiplication, 2’s complement multiplication

Author Biography

Pam Smallwood, Regis University

Asst Professor
Computer Science dept
Regis University

Downloads

Published

2023-01-05

How to Cite

Smallwood, P. (2023). Booth’s Algorithm: Computer Architecture. POGIL Activity Clearinghouse, 3(4). Retrieved from https://pac.pogil.org/index.php/pac/article/view/302

Issue

Vol. 3 No. 4 (2022): CS-POGIL Special Issue

Section

CS-POGIL Activity Writing Program

License

Copyright of this work and the permissions granted to users of the PAC are defined in the PAC Activity User License.