☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
計算機組織與結構
›
Ch2 計算機算術（Arithmetic）
第 6 題／共 26 題
◀
CC 6/26
錯題回報
00:00
6. Restoring Division、Non-restoring Division、Booth's Algorithm
#CC-02-006
難
Restoring Division
Non-restoring Division
Booth's Algorithm
📝
☆
Which of the following statements are true?
A
(a) Consider the above ALU design and a multiplication of
00101
2
×
00011
2
00101_2 \times 00011_2
0010
1
2
×
0001
1
2
, the value of Remainder register is
0001111000
2
0001111000_2
000111100
0
2
after three iterations of multiplication is conducted.
B
(b) Consider the same ALU design and now a division of
01101
2
÷
00011
2
01101_2 \div 00011_2
0110
1
2
÷
0001
1
2
using the restoring scheme is conducted. The value of Remainder register is
0000010001
2
0000010001_2
000001000
1
2
after four iterations of division is conducted. Note that the shift operation is performed at the end of each iteration rather than at the beginning.
C
(c) Consider the 5-bit non-restoring division algorithm that performs shift-left operation at the end of each iteration rather than at the beginning. The algorithms require 6 but not 5 iterations to obtain correct quotient.
D
(d) Consider a multiplication of
00101
2
×
01001
2
00101_2 \times 01001_2
0010
1
2
×
0100
1
2
applying the Booth algorithm. This multiplication requires two additions and two subtractions.
📝 寫筆記
📄 交大115
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 計算機組織與結構》Ch2 計算機算術（Arithmetic）
‹
本章題號 · 1–20 / 26
›
全部 26
易 8
中 16
難 2
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
