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 not, and, or, and xor.
# 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 7.
  1. For a binary search, the list must be SORTED.
  2. In a binary search, computers start at the middle(front,middle,end)/
  3. The number of steps required in a binary search follows the equation: log(n).
  4. Binary searches also work with a list of strings. We can sort them alphabetically.
  5. 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.
    • 10001
  2. Convert the binary number 1010 into decimal.
    • 10
  3. Convert the decimal number "122" into hexadecimal.
    • 7A
  4. Convert the hexadecimal number "09" into binary.
    • 1001

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

  1. 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"] (In alphabetical order)
  2. Explain why Binary Search is more efficient than Sequential Search.
    • Binary search is more efficient than sequential search because it reduces the number of elements that need to be searched by half with each iteration.
      • In binary search, we start by comparing the target value with the middle element of the sorted list, and if they are not equal, we can eliminate one half of the list from consideration. We then repeat the process with the remaining half until we either find the target value or determine that it does not exist in the list.
      • In contrast, sequential search requires checking every element of the list until the target value is found, which can be inefficient for large lists. Therefore, binary search is generally faster than sequential search for large datasets.

Extra Credit:

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

My extra credit

  • To convert a binary number to an octal number, we can group the binary digits into groups of three, starting from the rightmost digit. If there are not enough digits to form a group of three, we can add zeros to the left.
  • In this case, the binary number is 1001010. We can add a leading zero to make it a group of three digits: 001 001 010.
  • Converting each group of three digits in the binary number to octal, we get:

001 001 010 = 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