DATA STRUCTURE Programming and Technical Logical Reasoning Decision Making and Problem Solving

Vrinda writes an efficient program to sum two square diagonal matrices
(matrices with elements only on diagonal). The size of each matrix is nXn. What is the
time complexity of Vrinda's algorithm?

Read Solution (Total 6)

We know a square matrix can be a diagonal matrix.The number of diagonal elements in Square matrix of size n*n is n.

Diagonal matrix : A matrix having non zero elements diagonally.

therefore time complexity is O(n).
7 years agoHelpfull: Yes(4) No(0)

O(n^2) because to access 2-d array we have to run to for loops thus adding to nXn matrices will take O(n^2)
6 years agoHelpfull: Yes(2) No(0)
O(n^3) For each row, (n*n) operations take place. For n rows, n*n*n = n^3
7 years agoHelpfull: Yes(0) No(3)
O(n)-time complexiity
6 years agoHelpfull: Yes(0) No(0)
The complexity will be O(n).
6 years agoHelpfull: Yes(0) No(0)
Ans: &theta(n)
6 years agoHelpfull: Yes(0) No(0)

DATA STRUCTURE Other Question

A linked list is of a length specified in its declaration. True or False ? Consider the following code:
function modify(w,u)
{
w = w + 2
u = u - 3
return (w - u)
}
function calculate( )
{
integer a = 10, b = 20, c
c = modify(a, b);
print a
print space
print b
}
Assume that a was passed by value and b was passed by reference. What will be the
output of the program on executing function calculate( ) ?

Op 1: 12 17
Op 2: 10 17
Op 3: 12 20
Op 4: 10 20