Using a 4-bit version of the algorithm to save pages, divide 11ten by 4ten, or 00001011two by 0100 two. Use the algorithm outlined in the flowchart in figure 3.9 and fill in what numbers, in the table, would populate in the Quotient, Divisor, and Remainder in each step of each iteration.
Using a 4-bit version of the algorithm to save pages, divide 11ten by 4ten, or 00001011two by 0100 two. Use the algorithm outlined in the flowchart in figure 3.9 and fill in what numbers, in the table, would populate in the Quotient, Divisor, and Remainder in each step of each iteration.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Only typed answer please... don't attach pictures... please help me ...
not sure if my values are correct if yall could look through and correct me please I would appreciate it !
![4. Using a 4-bit version of the algorithm to save pages, divide 11ten by 4ten, or 00001011two by
0100two. Use the algorithm outlined in the flowchart in figure 3.9 and fill in what numbers, in the
table, would populate in the Quotient, Divisor, and Remainder in each step of each iteration.
Remainder
0000 1011
0011
Iteration
0
1
2
3
4
divisor properly, relative to the dividend for the next iteration. These steps are repeated 33 times.
5
Step
Initial Values
1: Rem Rem-Div
2b. Rem<0->+Div, ssl Q
QO=0
3. Shift right Div
1: Rem Rem-Div
2b. Rem<0->+Div, ssl Q
QO=0
3. Shift right Div
1: Rem = Rem-Div
2b. Rem<0->+Div, ssl Q
QO=0
3. Shift right Div
1: Rem Rem-Div
2b. Rem<0->+Div, ssl Q
QO=0
3. Shift right Div
1: Rem Rem-Div
2b. Rem<0->+Div, ssl Q
QO=0
3. Shift right Div
Quotient
0000
0010
0010
0001
Divisor
0100 0000
1000
1.000
0006
2011
coll](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd0398508-703c-4061-bdaf-d081a740f720%2Fb074f648-0876-46c8-b1a5-213d5479589f%2Fmooty0d_processed.jpeg&w=3840&q=75)
Transcribed Image Text:4. Using a 4-bit version of the algorithm to save pages, divide 11ten by 4ten, or 00001011two by
0100two. Use the algorithm outlined in the flowchart in figure 3.9 and fill in what numbers, in the
table, would populate in the Quotient, Divisor, and Remainder in each step of each iteration.
Remainder
0000 1011
0011
Iteration
0
1
2
3
4
divisor properly, relative to the dividend for the next iteration. These steps are repeated 33 times.
5
Step
Initial Values
1: Rem Rem-Div
2b. Rem<0->+Div, ssl Q
QO=0
3. Shift right Div
1: Rem Rem-Div
2b. Rem<0->+Div, ssl Q
QO=0
3. Shift right Div
1: Rem = Rem-Div
2b. Rem<0->+Div, ssl Q
QO=0
3. Shift right Div
1: Rem Rem-Div
2b. Rem<0->+Div, ssl Q
QO=0
3. Shift right Div
1: Rem Rem-Div
2b. Rem<0->+Div, ssl Q
QO=0
3. Shift right Div
Quotient
0000
0010
0010
0001
Divisor
0100 0000
1000
1.000
0006
2011
coll
![1. Subtract the Divisor register from the
Remainder register and place the
result in the Remainder register
Remainder 20
Start
Test Remainder
2a. Shift the Quotient register to the left,
setting the new rightmost bit to 1
Remainder <0
2b. Restore the original value by adding
the Divisor register to the Remainder
register and placing the sum in the
Remainder register. Also shift the
Quotient register to the left, setting the
new least significant bit to 0
3. Shift the Divisor register right 1 bit
5th repetition?
Done
No: < 5 repetitions
Yes: 5 repetitions
FIGURE 3.9 A division algorithm, using the hardware in Figure 3.8. If the remainder is positive,
the divisor did go into the dividend, so step 2a generates a I in the quotient. A negative remainder after](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd0398508-703c-4061-bdaf-d081a740f720%2Fb074f648-0876-46c8-b1a5-213d5479589f%2Fpdq9lr_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1. Subtract the Divisor register from the
Remainder register and place the
result in the Remainder register
Remainder 20
Start
Test Remainder
2a. Shift the Quotient register to the left,
setting the new rightmost bit to 1
Remainder <0
2b. Restore the original value by adding
the Divisor register to the Remainder
register and placing the sum in the
Remainder register. Also shift the
Quotient register to the left, setting the
new least significant bit to 0
3. Shift the Divisor register right 1 bit
5th repetition?
Done
No: < 5 repetitions
Yes: 5 repetitions
FIGURE 3.9 A division algorithm, using the hardware in Figure 3.8. If the remainder is positive,
the divisor did go into the dividend, so step 2a generates a I in the quotient. A negative remainder after
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education