Lesson Note Taker

Fill in the blanks below during the binary presentation. You can visit our website here!^ Due to last minute deployment issues, may need to run a local server

git clone https://github.com/TheoH32/Runtime_Terror.git
run:

bundle install
bundle exec jekyll serve

Binary

Binary is a base 2 number system.
0 represents off and 1 represents on.
A bit is the minimum unit of binary information stored in a computer system.

Boolean Expressions

A boolean expression is a logical statement that is either TRUE or FALSE and compares data.

Truth Tables

The logical operations shown in truth tables are and, or, not, and xor.

# AND
5 > 3 and 5 == 3 + 2

True

5 < 3 and 5 == 5

False

5 == 5 or 5 != 5

True

not 5 < 3 and not 5 != 5

True

Real Life Example using Boolean Expressions

Try changing the conditions and/or the logical operation below! Run the code to see if you are eligible to vote.

age = 90
citizen = False

if age >= 18 and citizen:
    print("You are eligible to vote.")
else:
    print("You are not eligible to vote.")

You are not eligible to vote.

Binary Conversions

Binary to Decimal

We can count in binary by using powers of 2.
In binary, we read from right to left.
0111 has a value of 7.

Binary Search

For a binary search, the list must be sorted.
In a binary search, computers start at the middle(front,middle,end)/
The number of steps required in a binary search follows the equation: log2(n) + 1.
Binary searches also work with a list of strings. We can sort them alphabetically.
Binary searches can be represented in tree diagrams.

Hacks

You will NOT be awarded any points for sections that are INCOMPLETE

Note Taker

Fill in all of the blanks above.

Lesson Quiz

Complete the lesson quiz
SCREENSHOT SCORE and paste it here (or paste screenshot with submission)

Binary Game

Complete the Binary game and reach a minimum score of 10!
SCREENSHOT SCORE and paste it here (or with submission)

Binary Conversions Practice

Convert the decimal number "17" into binary.
- Binary: 10001
Convert the binary number 1010 into decimal.
- 2^3 1 + 2^2 0 + 2^1 1 + 2^0 0 = 10
- The number is 10 in decimal
Convert the decimal number "122" into hexadecimal.
- 7A
Convert the hexadecimal number "09" into binary.
- The hexadecimal number 09 in binary is 1001

Binary Search Questions

Make a binary search tree of different the list [1,2,4,15,25,30,31]
```
  15
 /   \
2    30
/  \   /  \
1  4  25  31
```
Put this list of strings in a order that can be used for binary search ["Donut”,"Cake”,"Soda”,"Banana”,"Fruit”]
- ["Banana", "Cake", "Donut", "Fruit", "Soda"]
Explain why Binary Search is more efficient than Sequential Search.
- Binary search is generally more efficient than sequential search. First of all, binary search has a time complexity of O(logn) and sequential search has a time complexity of O(n). Additionally, each binary search iteration allows us to cut out at least half of the list part every time, while a sequential search has to go through every item in the sequence. This means that there will be some cases where sequential search is faster, like if the value to be found is at the front of the list, but in general, binary search will be faster.

Extra Credit:

Translate the binary number, 1001010, into octal (base 8). SHOW YOUR WORK AND EXPLAIN YOUR THINKING. OR
write the best rap line (determined during the lesson by group)
1001010 in binary is 2^6 1 + 2^5 0 + 2^4 0 + 2^3 1 + 2^2 0 + 2^1 1 + 2^0 * 0 = 74 decimal
74 decimal is 112 in octal

74 / 8 = 9 R 2
9 / 8 = 1 R 1
1 / 8 = 0 R 1

Take the remainders backwards to get octal --> 112

Hacks Scoring

Hack	Comments	Grade
Note Taker	fill in the blanks above	0.1
Lesson Quiz	under 100% = 0.1 only	0.2
Binary Game	must score at least 10 points	0.2
Binary Conversions Practice	if incorrect= 0.2 awarded	0.2
Binary Search Questions	if incorrect= 0.2 awarded	0.2
Extra Credit	MUST SHOW WORK	0.1
Total	expected= 0.9/1	1/1