What is the time complexity of matrix multiplication?
Submitted by: Administratorvoid Mult_Matrix(matrix A, matrix B, matrix C){int i, j, k;for ( i = 1; i < N; i++)for ( j = 1; j < N; j++ ){C[i][j] = 0;for ( k = 0; k < N; k++ )C[i][j] = A[i][j]*B[k][j];}return;}
The time complexity of matrix multiplication is O (N^3)
Submitted by: Administrator
The time complexity of matrix multiplication is O (N^3)
Submitted by: Administrator
Read Online MCSE Job Interview Questions And Answers
Top MCSE Questions
☺ | What is the time complexity of matrix multiplication? |
☺ | What is patch management? |
☺ | Explain distance vector routing algorithm with the help of suitable example. |
☺ | Define broadcast domain. |
☺ | Define Spanning-Tree Protocol (STP) |
Top Computer Networking Categories
☺ | CCNA Interview Questions. |
☺ | MCSE Interview Questions. |
☺ | CCNP Interview Questions. |
☺ | MCSA Interview Questions. |
☺ | Network Administrator Interview Questions. |