correct answers
Sequential search is an order n algorithm in the average case - correct answer ✔✔True
Binary search is able to search any kind of list, regardless of whether or not it is sorted - correct answer
✔✔False
In the sequential search algorithm, the worst case occurs when the value being searched for is the first in
the list - correct answer ✔✔False
Binary search does ____ comparisons in the worst case. - correct answer ✔✔O(lg n)
___ sort is an O(n^2) algorithm in all cases - correct answer ✔✔selection
In the sequential search algorithm, the minimum amount of work is done if the value being searched for
is the ___ value. - correct answer ✔✔First
To construct an AND gate, two transistors are connected in parallel. - correct answer ✔✔False
A multiplexor is a circuit that has 2^N output lines. - correct answer ✔✔False
The binary-to-decimal algorithm is based on successive divisions by 2. - correct answer ✔✔False
The total number of ___ per second is called hertz. - correct answer ✔✔bytes
ASCII is able to encode a total of ____ different characters. - correct answer ✔✔256