Binary Lesson
The lesson taught by Group 6 about Data Structures
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 False/Off and 1 represents True/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, XOR, and NOT.
# AND
5 > 3 and 5 == 3 + 2
5 < 3 and 5 == 5
5 == 5 or 5 != 5
5 < 3 or 5 != 5
age = 16
citizen = True
if age >= 18 and citizen:
print("You are eligible to vote.")
else:
print("You are not eligible to vote.")
UNW = 3.50
sport = True
if UNW >= 3.5 and sport:
print("You qualify for the Sports Certificate")
else:
print("You don't qualify for the Sports Certificate")
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: log(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 Search Questions
- Make a binary search tree of different the list [1,2,4,15,25,30,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"]
- Must be in alphabetical order for the binary search to work
- Explain why Binary Search is more efficient than Sequential Search.
- Binary search starts from the middle
- Sequential Search starts from left to right
- Binary search will go in the middle and is much more quicker
Extra Credit:
- Translate the binary number, 1001010, into octal (base 8). SHOW YOUR WORK AND EXPLAIN YOUR THINKING.
- 74 (Decimal)
- 64+0+0+8+0+2+0
- Octal is base 8
- Need to put into groups of three
- 001 001 010
- Then each group of 3 needs to become its octal digit
- 001 = 1
- 001 = 1
- 010 = 2
- Use the three numbers and put them from left to right, and that is hte octal number
- 112 (Octal)
OR
- write the best rap line (determined during the lesson by group)
Binary has got 0's and 1's
use binary search a megaton
This concept is for everyone
Extra Binary Code
decimal = int(input("Enter an integer: "))
# Uses bin to convert into decimal into binary
binary = bin(decimal)[2:]
# Output the binary
print(f"The binary equivalent of {decimal} is: {binary}")
# Output the decimal
print(f"The decimal equivalent of {binary} is: {decimal}")
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 |