chapter 3 changes#2
Conversation
milen-patel
temporarily deployed
to
github-pages
| 2. Let sum = 0 and base = 0 | ||
| 3. Multiple the current digit position by $$2^{base}$$ | ||
| 2. Let sum = 0 | ||
| 3. Multiple the current digit position by $$2^{value of digit}$$ |
There was a problem hiding this comment.
Confused by the changes for this conversion algorithm. How does one interpret "value of digit"
|
|
||
| | Computing X+Y | | | | | | ||
| |---|---|---|---|---| | ||
| | Carry-Over | 1 | 1 | 1 | | |
There was a problem hiding this comment.
What is the meaning of this added line; How does it differ from what is on line 149?
| I will paste the same exact table as from above but for this example, with the difference being that this is binary arithmetic instead of decimal arithmetic. You can verify by converting the two values to decimal and then asserting that the sum of their decimal values is the same value you get when you convert their binary sum, $$110_2$$, to decimal. | ||
|
|
||
| | Computing X+Y | | | | | ||
| | Carry-Over | | 1 | | |
There was a problem hiding this comment.
Same comment above here. Now that I'm rereading my original writing im seeing that what I wrote does not make clear sense (i.e. the carry row shouldn't that be No Yes No) but also even then do you think this row should be boolean values or binary values?
| | + | 1 | 0 | | ||
| | - | 0 | 9 | | ||
| | **=** | **1** | **0** | | ||
|
|
There was a problem hiding this comment.
Okay it took me a little bit to understand what was going on here. Do you think it would be more useful to add a line above the table along the lines of "Showing how incrementing a number can be accomplished by first adding ten to the base number followed by subtracting 9"
2 participants
No description provided.