Summary | Effects | Digital Divide | Computing Bias | Crowdsourcing | Legal/Ethical Concerns | Safe Computing |
Binary Search Algorithm | Lists and Filtering Algorithm | Simulation/Games and Random Algorithms | Big O and Algorithm Efficiency | Binary Base 2 Math + Logic Gates | Color Codes/Images/Base64 | Relevancy |
Binary Base 2 Math and Logic Gates
Binary Base 2 Math and Logic Gates Notes and Homework
Popcorn Hack 1: Examples for Identifying Binary
Example 1:
Number: 101010
Answer: Binary
Example 2:
Number: 12301
Answer: Non-binary
Example 3:
Number: 11001
Answer: Binary
Popcorn Hack 2: Examples for Adding and Subtracting Binary
Example 1 (Adding):
Binary Numbers: 101 + 110
1+0 = 1, 0+1 = 1, 1+1 = 10 (carry the 1), Answer: 1011
Example 2 (Subtracting):
Binary Numbers: 1101 - 1011
1-1=0, 0-1=(borrow 1 → 10 - 1 = 1), 0 (after borrowing) - 0 = 0, 1 - 1 = 0, Answer: 0010
Example 3 (Adding):
Binary Numbers: 111 + 1001
1 + 1 = 10 (carry over 1), 1 + 0 + 1 = 10 (carry over 1), 1 + 0 + 1 = 10 (carry over 1). Result: 1110.
Popcorn Hack 1:
Problem: What will be the result of this expression? True or False and False Since AND has higher priority than OR, the expression is evaluated as: Result: True
Popcorn Hack 2:
Problem: What will be the result of this expression? not True and False Without parentheses, the NOT operator is evaluated first due to its higher priority, followed by the AND operator. Result: False
Popcorn Hack 3:
Problem: What will be the result of this expression? True or False and not False Without parentheses, the AND and NOT operators are evaluated first due to their higher priority: Result: True