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

  1. git clone https://github.com/TheoH32/Runtime_Terror.git
  2. run:
  • bundle install
  • bundle exec jekyll serve

Binary

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

Boolean Expressions

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

Truth Tables

  1. The logical operations shown in truth tables are and, or, xor, and not.
# AND
5 > 3 and 5 == 3 + 2

True
5 < 3 and 5 == 5

False
5 == 5 or 5 != 5

True
5 < 3 or 5 != 5

False

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 = 18
citizen = True

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

You are eligible to vote.

Binary Conversions

Binary to Decimal

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

For a binary search, the list must be sorted in ascending or descending order. In a binary search, computers start at the middle of the list. The number of steps required in a binary search follows the equation: log2(n), where n is the size of the list. 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

  1. Fill in all of the blanks above.

Lesson Quiz

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

Binary Game

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

Binary Conversions Practice

  1. Convert the decimal number "17" into binary.
    17 / 2 = 8 remainder 1 8 / 2 = 4 remainder 0 4 / 2 = 2 remainder 0 2 / 2 = 1 remainder 0 1 / 2 = 0 remainder 1 10001
  2. Convert the binary number 1010 into decimal.
    1 2^1 + 0 2^2 + 1 2^3 + 0 2^4 = 2 + 0 + 8 + 0 = 10
  3. Convert the decimal number "122" into hexadecimal.
    122 / 16 = 7 remainder 10 (A) 7 / 16 = 0 remainder 7 7A
  4. Convert the hexadecimal number "09" into binary.
    0 = 0000 9 = 1001 00001001

Binary Search Questions

  1. Make a binary search tree of different the list [1,2,4,15,25,30,31]
      15
 /  \
2    30
    / \ / \ 1 4 25 31
  2. 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"]
  3. Explain why Binary Search is more efficient than Sequential Search.
  • reduces the number of comparisons required to find a target value
  • reduces the search space exponentially, resulting in a much faster search time for large lists
  • binary search requires the list to be sorted, but sorting the list beforehand can often be done once and reused for multiple searches, making it more efficient in the long run.

Extra Credit:

  • Translate the binary number, 1001010, into octal (base 8). SHOW YOUR WORK AND EXPLAIN YOUR THINKING.

  • first, split up into 3 sections
    • 010, 101, 001
  • now evaluate each section
    • 010= 2^1 =1
    • 101= 2^0+2^2 =5
    • 001=2^0 =1
      =512

      OR
  • write the best rap line (determined during the lesson by group)

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