Concept drill
matrix addition
GATE CSE & IT · Algorithms - Time Complexity · 2017-2017
2
PYQs
50%
keyed
0
elite explanations
1
years appeared
Study anchor
Source-book anchor pending for this concept.
Practice action
Start latest PYQPYQs in this concept
All concepts →2017 Q3
Match the algorithms with their time complexities: Algorithm (P) Towers of Hanoi with n disks (Q) Binary search given n sorted numbers (R) Heap sort given n numbers at the worst ca...
mediumanswer key
2017 PYQ
Let $$P = \left[ {\matrix{ 1 & 1 & { - 1} \cr 2 & { - 3} & 4 \cr 3 & { - 2} & 3 \cr } } \right]$$ and $$Q = \left[ {\matrix{ { - 1} & { - 2} & { - 1} \cr 6 & {12} & 6 \cr 5 & {10}...
easy