Co-Factor Matrix
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
- Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Divisibility Rules, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Speed Mathematics and Basic Mathematics, TCS NQT Advanced Quantitative Ability, Gamified / Game Based Aptitude, Linear Algebra, Trigonometry
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Interjection, Verb, English Writing Ability
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This Linear Algebra lecture focuses on the construction of cofactor matrices and the calculation of determinants. The instructor begins by defining the cofactor matrix C for a 3x3 matrix A, introducing the fundamental formula Cij = (-1)^(i+j) Mij. He uses a specific numerical example, A = [[1, 4, 7], [3, 0, 5], [-1, 9, 11]], to demonstrate the step-by-step process of finding individual cofactors like C11 and C23. This involves calculating the corresponding minor determinants and applying the alternating sign pattern based on the sum of the row and column indices. The lecture then transitions to explaining how to compute the determinant of a matrix using the expansion by minors along the first row. Finally, the instructor reviews six essential properties of determinants, including the determinant of the identity matrix being 1, and provides a comprehensive set of rules for handling transposes, inverses, scalar multiplication, and diagonal matrices, which are crucial for advanced linear algebra applications.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the concept of a cofactor matrix. He writes a 3x3 matrix A with specific values on the whiteboard and defines the cofactor matrix C. He explains the formula Cij = (-1)^(i+j) Mij and calculates C11 and C23 as detailed examples. He visually demonstrates the progression from the original matrix to the minor matrix and finally to the cofactor matrix, emphasizing the sign change based on the parity of i+j. He circles the exponents to show that (-1)^even = 1 and (-1)^odd = -1.
2:00 – 5:00 02:00-05:00
The instructor explains the expansion of a determinant along the first row using the formula a11C11 + a12C12 + a13C13. He then lists six key properties of determinants on the whiteboard, such as |AT| = |A|, |A^-1| = 1/|A|, and |kA| = k^n|A|. He illustrates the property for diagonal matrices by calculating the product of diagonal elements for a specific example, circling the values 2, 6, and 12 to show the result is 144. He also writes out the general expansion formula involving minors to reinforce the connection between cofactors and determinants. The instructor emphasizes the importance of these properties in simplifying complex determinant calculations. He also notes that the determinant of the identity matrix |In| is equal to 1.
5:00 – 5:13 05:00-05:13
The lecture concludes with a closing graphic. The screen displays the text 'THANKS FOR WATCHING' in a stylized font, marking the end of the instructional segment.
The video effectively bridges the gap between theoretical definitions and practical calculation. By starting with the construction of a cofactor matrix and moving to determinant expansion, it establishes the foundational mechanics. The subsequent review of determinant properties reinforces these concepts, offering students a complete set of rules for manipulating determinants in various contexts, from simple diagonal matrices to complex matrix operations.