Question

Please answer both question.

QUESTION 9 Examples of O(1) algorithms are .multiplying two numbers assigning some value to a variable displaying some integer on the console all of these QUESTION 10 Examples of O(n^2) algorithms are Adding of two matrices Initializing all elements of a matrix with zero Both of these Neither of these

Answer 1

1) Option (D).

for all statements to compile and run it will takes O(1) only.

2) Option (C)

for the matrices we will compare the i values upto n times and j values upto n times. So it will take O(n2) .

3) Option (A)

Yes,The spreadsheets are usefull to because of their dynamic nature.

4) Option (B)

False, because spreadsheet cell can contain different types of content, including text, formatting, formulas, and functions. Text: Cells can contain text, such as letters, numbers, and dates.

5) Option (B)

If we modify any data in a cell, it will update automatically.