Skip to content

Commit

Permalink
notes
Browse files Browse the repository at this point in the history
  • Loading branch information
brownsarahm committed Nov 16, 2023
1 parent 1616995 commit 3efad19
Show file tree
Hide file tree
Showing 11 changed files with 402 additions and 0 deletions.
20 changes: 20 additions & 0 deletions _practice/2023-11-16.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
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. In {index}`addertypes.md` compare ripple adders and lookahead adders.
```
1. Give a synopsis of each adder type
1. Compare them in terms of time (assume that each gate requires one unite of time)
1. Compare them in terms of space/cost by counting the total number of gates required.
```
3. Add {index}`bitwise.md` to your kwl and write the bitwise operations required for the following transformations (replace the `(_)` with a bitwise operator (`&, |, ^, >>, <<`)):
```
4 (_) 128
12493 (_) -12494
127 (_) 15
7 (_) 56
4 (_) -5
45 (_) 37 = 37
45 (_) 37 = 45
3 (_) 5 = 7
6 (_) 8 = 0
10 (_) 5 = 15
```
6 changes: 6 additions & 0 deletions _prepare/2023-11-21.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
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:
- 3.75
- 7.5
- 11.625
- 5.1875
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?
14 changes: 14 additions & 0 deletions _review/2023-11-16.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
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. Add {index}`bitwise.md` to your kwl and write the bitwise operations required for the following transformations (replace the `(_)` with a bitwise operator (`&, |, ^, >>, <<`)):
```
4 (_) 128
12493 (_) -12494
127 (_) 15
7 (_) 56
4 (_) -5
45 (_) 37 = 37
45 (_) 37 = 45
3 (_) 5 = 7
6 (_) 8 = 0
10 (_) 5 = 15
```
7 changes: 7 additions & 0 deletions activities/practice.md
Original file line number Diff line number Diff line change
Expand Up @@ -131,4 +131,11 @@ Activities:

Activities:
```{include} ../_practice/2023-11-14.md
```
## 2023-11-16

[related notes](../notes/2023-11-16)

Activities:
```{include} ../_practice/2023-11-16.md
```
7 changes: 7 additions & 0 deletions activities/prepare.md
Original file line number Diff line number Diff line change
Expand Up @@ -119,4 +119,11 @@ Activities:

Activities:
```{include} ../_prepare/2023-11-14.md
```
## 2023-11-16

[related notes](../notes/2023-11-16)

Activities:
```{include} ../_prepare/2023-11-16.md
```
7 changes: 7 additions & 0 deletions activities/review.md
Original file line number Diff line number Diff line change
Expand Up @@ -125,4 +125,11 @@ Activities:

Activities:
```{include} ../_review/2023-11-14.md
```
## 2023-11-16

[related notes](../notes/2023-11-16)

Activities:
```{include} ../_review/2023-11-16.md
```
1 change: 1 addition & 0 deletions img/xor_swap_0.svg
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
1 change: 1 addition & 0 deletions img/xor_swap_1.svg
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading

0 comments on commit 3efad19

Please sign in to comment.