Skip to content

Commit ba1a0f2

Browse files
committed
notes posted
1 parent 2ffc740 commit ba1a0f2

7 files changed

Lines changed: 451 additions & 0 deletions

File tree

_practice/2025-11-06.md

Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
1. Review the notes from today
2+
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`
3+
2. In {index}`addertypes.md` compare ripple adders and lookahead adders.
4+
```
5+
1. Give a synopsis of each adder type
6+
2. Compare them in terms of time (assume that each gate requires one unit of time)
7+
3. Compare them in terms of space/cost by counting the total number of gates required.
8+
```
9+
3. Experiment with bitwise operators in python to derive 3 generic rules. Submit in `bitwise_expt.md` that has code in cells and the output (eg like the notes). An example (that you cannot get credit for) is any number xor with itself is 0, or `a^a =0`.
10+
11+
_hover over the explore ideas below and to make an issue if you want to work on that explore_
12+
13+
- [ ] explore: Learn about the alternative to these operations for quantum computing and compare and think about how we would need to change computing operations for quantum compared to the traditional gates we have been using
14+
- [ ] explore: for another application of bitwsie operations, design and describe an activity

_prepare/2025-11-13.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
1. watch this short [video on an alternative adder](https://www.youtube.com/watch?v=GcDshWmhF4A)
2+
2. and this [video on half adder with legos](https://www.youtube.com/watch?v=5X_Ft4YR_wU)

_review/2025-11-06.md

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
1. Review the notes from today
2+
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`
3+
1. Find what bitwise operation would complete each of these transformations (eg `1 << 3 = 4` and `4^4 = 0`) that is replace the ? with a bitwise operator. For each show work to explain how you found it in `bitwise.md`:
4+
```
5+
4 ? 3 = 32
6+
11 ? 7 = 3
7+
8 ? 2 = 2
8+
```

activities/practice.md

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

141141
Activities:
142142
```{include} ../_practice/2025-11-04.md
143+
```
144+
## 2025-11-06
145+
146+
[related notes](../notes/2025-11-06)
147+
148+
Activities:
149+
```{include} ../_practice/2025-11-06.md
143150
```

activities/prepare.md

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

157157
Activities:
158158
```{include} ../_prepare/2025-11-06.md
159+
```
160+
## 2025-11-13
161+
162+
[related notes](../notes/2025-11-13)
163+
164+
Activities:
165+
```{include} ../_prepare/2025-11-13.md
159166
```

activities/review.md

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

141141
Activities:
142142
```{include} ../_review/2025-11-04.md
143+
```
144+
## 2025-11-06
145+
146+
[related notes](../notes/2025-11-06)
147+
148+
Activities:
149+
```{include} ../_review/2025-11-06.md
143150
```

0 commit comments

Comments
 (0)