Skip to content

Commit 3efad19

Browse files
committed
notes
1 parent 1616995 commit 3efad19

File tree

11 files changed

+402
-0
lines changed

11 files changed

+402
-0
lines changed

_practice/2023-11-16.md

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
1. While we saw many types of gates today, but we actually could get all of the operations needed using only NAND gates. Work out how to use NAND gates to implement a half adder and describe it in {index}`nandhalf.md`
2+
2. In {index}`addertypes.md` compare ripple adders and lookahead adders.
3+
```
4+
1. Give a synopsis of each adder type
5+
1. Compare them in terms of time (assume that each gate requires one unite of time)
6+
1. Compare them in terms of space/cost by counting the total number of gates required.
7+
```
8+
3. Add {index}`bitwise.md` to your kwl and write the bitwise operations required for the following transformations (replace the `(_)` with a bitwise operator (`&, |, ^, >>, <<`)):
9+
```
10+
4 (_) 128
11+
12493 (_) -12494
12+
127 (_) 15
13+
7 (_) 56
14+
4 (_) -5
15+
45 (_) 37 = 37
16+
45 (_) 37 = 45
17+
3 (_) 5 = 7
18+
6 (_) 8 = 0
19+
10 (_) 5 = 15
20+
```

_prepare/2023-11-21.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
1. In {index}`fractionalbinary.md` use 8 bits to represent the following numbers by using 4 bits as usual (8,2,4,1) and the other 4 bits are 1/2, 1/4, 1/8, 1/16th:
2+
- 3.75
3+
- 7.5
4+
- 11.625
5+
- 5.1875
6+
1. Add to your file some notes about the limitations of representing non integer values this way. How much would using more bits help with, what limitations are not resolved by adding more bits. For example, how could you represent .1?

_review/2023-11-16.md

Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
1. While we saw many types of gates today, but we actually could get all of the operations needed using only NAND gates. Work out how to use NAND gates to implement `and` and `or` in {index}`nandandor.md`
2+
2. Add {index}`bitwise.md` to your kwl and write the bitwise operations required for the following transformations (replace the `(_)` with a bitwise operator (`&, |, ^, >>, <<`)):
3+
```
4+
4 (_) 128
5+
12493 (_) -12494
6+
127 (_) 15
7+
7 (_) 56
8+
4 (_) -5
9+
45 (_) 37 = 37
10+
45 (_) 37 = 45
11+
3 (_) 5 = 7
12+
6 (_) 8 = 0
13+
10 (_) 5 = 15
14+
```

activities/practice.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -131,4 +131,11 @@ Activities:
131131

132132
Activities:
133133
```{include} ../_practice/2023-11-14.md
134+
```
135+
## 2023-11-16
136+
137+
[related notes](../notes/2023-11-16)
138+
139+
Activities:
140+
```{include} ../_practice/2023-11-16.md
134141
```

activities/prepare.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -119,4 +119,11 @@ Activities:
119119

120120
Activities:
121121
```{include} ../_prepare/2023-11-14.md
122+
```
123+
## 2023-11-16
124+
125+
[related notes](../notes/2023-11-16)
126+
127+
Activities:
128+
```{include} ../_prepare/2023-11-16.md
122129
```

activities/review.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -125,4 +125,11 @@ Activities:
125125

126126
Activities:
127127
```{include} ../_review/2023-11-14.md
128+
```
129+
## 2023-11-16
130+
131+
[related notes](../notes/2023-11-16)
132+
133+
Activities:
134+
```{include} ../_review/2023-11-16.md
128135
```

img/xor_swap_0.svg

Lines changed: 1 addition & 0 deletions
Loading

img/xor_swap_1.svg

Lines changed: 1 addition & 0 deletions
Loading

0 commit comments

Comments
 (0)