Install our extension to search inside any video instantly.

CSIR NET July 2026 Memory based Question | Part 4

Added:
174 views19likes6:40DrHarishGargOriginal Release: 2026-07-18

This video teaches efficient problem-solving techniques for CSIR NET linear algebra questions: (1) For nilpotent matrices where T^k = 0, the minimum rank is 1 and maximum rank is floor((k-1)n/k), allowing quick determination of rank bounds; (2) For minimal polynomial questions, substitute the matrix into the polynomial equation to derive properties like A^4 = I when x²+1 is the minimal polynomial, or A³ = I when x²+x+1 is the minimal polynomial, enabling rapid identification of correct statements.