Data Structure MCQ - Matrix

1. number of rows X number of columns
2. number of columns X number of rows
3. number of rows X number of rows
4. number of columns X number of columns

1. Associative
2. Distributive
3. Commutative
4. None of these

1. int *arr = malloc(r * c * sizeof(int));
2. int *arr = (int *)malloc(r * c * sizeof(int));
3. int *arr = (int *)malloc(r + c * sizeof(int));
4. int *arr = (int *)malloc(r * c * sizeof(arr));

for(int i = 0; i < row; i++)
{  
    for(int j = 0; j < column; j++)
    {
        if(i == j)
            sum = sum + (array[i][j]);
    }
}
System.out.println(sum);

1. Normal of a matrix
2. Trace of a matrix
3. Square of a matrix
4. Transpose of a matrix

1. In solving linear equations
2. Image processing
3. Graph theory
4. All of these

1. Internal complexity
2. Searching through a matrix is complex
3. Not space efficient
4. All of these

1. Identity matrix
2. Inverse of A
3. Square of A
4. Transpose of A

1. Identity Matrix
2. Unit Matrix
3. Sparse Matrix
4. Zero Matrix

1. Harry Markowitz
2. James Sylvester
3. Chris Messina
4. Arthur Cayley

1. Dictionary of Keys
2. Linked List
3. Array
4. Heap