Answer:
There is also an attachment below
Explanation:
Since we are talking about binary search, let's assume that the items are sorted according to some criteria.
Time complexity of binary search is O(logN) in worst case, best case and average case as well. That means it can search for an item in Log N time where N is size of the input. Here problem talks about the item not getting found. So, this is a worst case scenario. Even in this case, binary search runs in O(logN) time.
N = 700000000.
So, number of comparisions can be log(N) = 29.3 = 29.
So, in the worst case it does comparisions 29 times
Answer:
Virus, cyber theft
Explanation:
A computer risk is something that can potentially harm your data on your computer or harm you through a computer by using theft tactics from real people to autonomous viruses making it to your computer and slowing your computer. With cybrrtheft thieves can get personal info through accounts to pictures and payment information.
Answer: E) The CPU executes the instruction by performing ALU operations.
Explanation: The execution cycle is of three stages namely; fetch, decode and execute. These are the functions that the CPU carries out from the time of boot-up up until it's shut down.
At the fetch stage, the computer retrieves program instructions from its memory register, at the decode stage; the decoders interprets the instructions from the instructions register and then the next stage will be the executions, at this stage; the interpreted instructions are then passed to relevant function units of the CPU to carry out the required instructions.
E.g mathematical and logic functions are passed on the ARITHMETIC AND LOGIC UNIT(ALU) to perform.
Answer:
yes, an HTML webpage must begin with an HTML element
Explanation:
<HTML> <!-- Website Content --> </HTML>
