Answer:
c) it will always return with an answer of 7 or fewer comparisons of data.
Explanation:
As maximum number of comparison in worst case for sorted binary search is log₂n, here n = 100, so maximum search is at least 6.6 which is approximately 7.
4 because 4 x 4=16. Easy. I like to think of it as multiplication.
The way a particular application views the data from the database that the application uses is a sub-schema.
<h3>What is Database?</h3>
A Database may be defined as a process of collecting data and information that is principally assembled for quick search and recoupment by a computer.
The sub-schema is the reasoning elucidation of that section of the database which is applicable and accessible to a specific application. This type of database is common to two or more applications.
Therefore, the sub-schema is the way through which a particular application views the data from the database that the application uses.
To learn more about Database, refer to the link:
brainly.com/question/26096799
#SPJ4
Answer:
The code will get stuck in an infinite loop.
Explanation:
Since val is decreasing by 1 each time it meets the criteria of being smaller than 10, your code will get stuck in an infinite loop since val will always be smaller than 10.
Hope this helps :)
