The office is a good one. If you haven’t ever watched it
Answer:
(a) What is the best case time complexity of the algorithm (assuming n > 1)?
Answer: O(1)
(b) What is the worst case time complexity of the algorithm?
Answer: O(n^4)
Explanation:
(a) In the best case, the if condition will be true, the program will only run once and return so complexity of the algorithm is O(1)
.
(b) In the worst case, the program will run n^4 times so complexity of the algorithm is O(n^4).
Answer:
It is bit { measurement used to quantify computer data. }
Answer: b) GNATT chart
Explanation: GNATT is the type of chart that displays the schedule or working in the form of bars in horizontal direction .The chart displays the duties /task performed on the vertical axis and the time periods on horizontal axis week-vise. This chart is usually used for project management purpose fr coordination, tracing, planning etc.
Other options are incorrect because project staffing chart is for the display of the staff activities involved during project, histogram is graph representation using bars of different heights and entity diagram displays the entities relation in databases..Thus , the correct option is option(b).
Answer: Put her insertion point at the end of the item 2b.
Press the enter key.
Explanation:
