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:
START LOOP FOR EACH EMPLOYEE:
INPUT employee’s name, hourly rate of pay, number of hours worked, overtime pay rate, payroll deductions, tax rate
SET gross pay = (hourly rate of pay x *weekly hours) + (overtime pay rate x (number of hours worked - *weekly hours))
PRINT gross pay
SET net pay = gross pay - (payroll deductions + (gross pay * tax rate/100 ))
PRINT net pay
END LOOP
* weekly hours (how many hours an employee needs to work to earn overtime pay rate) is not given in the question
Explanation:
Create a loop that iterates for each employee
Inside the loop, ask for name, hourly rate, number of hours worked, overtime pay rate, payroll deductions, tax rate. Calculate the gross pay and print it. Calculate the net pay and print it
Answer:
c. Attribute constraints
Explanation:
A data catalog identifies all of the following, except: "Attribute constraints"
The above statement is TRUE because a Data Catalog, a metadata management service, operates by searching for key data, understand and manage data for usefulness.
Data Catalog checks on the BigQuery datasets, tables, and views and checks both technical and business metadata by identifying the following attributes:
1. Data type
2. Range of values
3. Value for Instructor ID
Answer: Ok so Sorry about this but I will answer thing at 10:20 tommorow I promise
Explanation:
