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 statement 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 , NOT, and NOR.
# 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.

security_card = 2
badge = True

if security_card == 2 and badge:
    print("You have a high enough security clearance.")
else:
    print("You are not allowed in this room.")

You have a high enough security clearance.

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 1+2+4 = 7.
  1. For a binary search, the list must be sorted in ascending or descending order.
  2. In a binary search, computers start at the middle.
  3. The number of steps required in a binary search follows the equation: log2(n), where n is the number of elements in the list.
  4. Binary searches also work with a list of strings. We can sort them alphabetically.
  5. Binary searches can be represented in flow diagrams or pseudocode.

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. Decimal 17 in binary is 10001.
  2. Binary 1010 in decimal is 10.
  3. Decimal 122 in hexadecimal is 7A.
  4. Hexadecimal 09 in binary is 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

  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

  1. Explain why Binary Search is more efficient than Sequential Search.

Binary search is more efficient than sequential search because it eliminates half of the remaining items with each iteration, making the search time grow logarithmically with the number of items. In contrast, sequential search requires iterating through every item in the list until the target item is found, which makes the search time grow linearly with the number of items. As a result, binary search is much faster for large lists of items.

Extra Credit:

  • Translate the binary number, 1001010, into octal (base 8).

1 0 0 1 0 1 0 64 8 2 = 74

1 1 2 64 8 2 = 74

Answer : 112 in octal base

SHOW YOUR WORK AND EXPLAIN YOUR THINKING. 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