3.2 Binary Encoding

What is a bit in terms of data representation?

• A group of 8 binary digits

• The smallest unit of data in a computer

• A type of data structure

• A method of searching data

Which of the following best describes a byte?

• A single binary digit

• A collection of 8 bits

• A type of algorithm

• A data structure used for sorting

How many bits are there in a byte?

• 4

• 8

• 16

• 32

Which of the following is a characteristic of the binary search algorithm?

• It can be used on unsorted data

• It divides the search interval in half each time

• It is a type of data structure

What is the main advantage of using binary search over linear search?

• It works on unsorted data

• It is simpler to implement

• It is more efficient on large datasets

• It requires less memory

In a binary search, if the target value is less than the middle element, which part of the array is searched next?

• The entire data set

• The left half of the data set

• The right half of the data set

• None of the data set

Which of the following is a limitation of the binary search algorithm?

• It can only be used on sorted data

• It randomly chooses numbers

• The data set needs to be divided by 2

• It is not efficient for large datasets

A random number is chosen from between 1 and 100, inclusive. Describe how to use the binary search algorithm to find the number.