Rank of a Matrix

Duration: 19 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/mathematics/linear-algebra/rank-of-a-matrix/asset-rank-of-a-matrix after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Section A: General Awareness: Polity, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, समसामयिकी / Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, Data Sufficiency, अशाब्दिक तर्क / Non-Verbal Reasoning, Analytical Reasoning (Counting Figures Reasoning), रक्त संबंध / Blood Relations, Syllogisms, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, दिशा एवं दूरी / Direction and Distance, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, आँकड़ों की पर्याप्तता एवं निर्णय क्षमता / Data Sufficiency and Decision Making, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, Crypt Arithmetic, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, Data Arrangement, Inequality, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, आँकड़ा निर्वचन / Data Interpretation, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, Logarithm, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, प्रतिशत / Percentage, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय और कार्य / Time and Work, Pipe and Cistern, घन क्षेत्रमिति / Solid Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Algebra, Probability, Mental Ability, Age Problems, Partnership, Statistics, Arithmetic, Speed Mathematics and Basic Mathematics, Miscellaneous
  5. Section A: English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Verbs and Tenses, Reading Comprehension, Parts of Speech, Sentence Construction, Prepositions and Conjunctions, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Structure and Common Errors, Modals, Transformation of Sentences, Sentence Correction (Error Correction), Adverb, Conjunction, Cloze Test (Cloze Passage)
  6. Section A: Hindi Language & Comprehension: भाषा, लिपि और वर्ण, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, पद-भेद और रूप-विकार, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, शब्द-भंडार, अपठित बोध, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  7. Section B: Programming, Data Structures, OOP & Java: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  8. Section B: Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  9. Section B: Teaching Methodology: वृद्धि और विकास / Growth and Development, Concept of Pedagogy, विकास के सिद्धांत / Theories of Development, समावेशी शिक्षा / Inclusive Education, Experiential Pedagogy, आकलन और मूल्यांकन / Assessment and Evaluation, समाजीकरण और जेंडर / Socialisation and Gender, National Education Policy (NEP) 2020, संज्ञानात्मक प्रक्रियाएँ / Cognitive Processes, शिक्षण योजना और शिक्षण कौशल / Teaching Planning and Teaching Skills, Personality Development, शिक्षण विधियाँ / Teaching Methods, अधिगम और व्यवहारवादी सिद्धांत / Learning and Behavioural Theories, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, आकलन एवं मूल्यांकन / Assessment and Evaluation, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development
  10. Section B: Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section B: Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  12. Section B: Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  13. Section B: Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  14. Section B: Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep, कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), कंप्यूटर नेटवर्क / Computer Networks, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  15. Section B: Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  16. Section B: Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  17. Section B: Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Section B: Mathematics: Linear Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, प्रतिचयन / Sampling
  19. Section B: Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  20. Section B: Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection
  21. DSSSB Previous Year Paper:
  22. Business Studies and Management: Business Communication, प्रबंध के सिद्धांत एवं कार्य / Principles and Functions of Management, लेखांकन के आधार एवं लेन-देनों का अभिलेखन / Accounting Fundamentals and Recording of Transactions, Business Economics, ह्रास, अंतिम खाते व कंप्यूटरीकृत लेखांकन / Depreciation, Final Accounts and Computerised Accounting, Knowledge Management & New Economy
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive lecture on the concept of Rank in Linear Algebra, presented by instructor Yash Jain. The lesson begins with a quick visual review of determinant formulas for 2x2 and 3x3 matrices, setting the stage for understanding rank. The core of the lecture defines the rank of a matrix for both square (nxn) and rectangular (mxn) matrices. The instructor explains that rank is fundamentally linked to linear independence, defining column rank as the maximum number of linearly independent columns and row rank similarly for rows. A key theorem presented is that column rank equals row rank, which is simply called the rank of the matrix. The video further clarifies that the rank of a matrix is equal to the rank of its transpose. A numerical definition is provided, stating that the rank is the size of the largest sub-matrix with a non-zero determinant. The lecture culminates in a practical example using a 3x3 matrix where the determinant is zero, demonstrating how to find a non-zero 2x2 sub-determinant to establish the rank. Finally, the instructor lists the elementary row and column operations that preserve the rank of a matrix, offering a method for computation.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a title card "LINEAR ALGEBRA" followed by a black screen displaying mathematical formulas. The first formula shows the determinant of a 2x2 matrix: [a b; c d] = ad - bc. This is immediately followed by the expansion formula for a 3x3 determinant: a1[b2 c2; b3 c3] - b1[a2 c2; a3 c3] + c1[a2 b2; a3 b3]. These formulas serve as a prerequisite review, highlighting the calculation of determinants which is central to the subsequent discussion on rank. The visual focus is strictly on these algebraic expressions written in white and colored text against a black background, setting a mathematical tone for the lecture.

  2. 2:00 – 5:00 02:00-05:00

    The scene shifts to a classroom setting with instructor Yash Jain standing before a whiteboard. The board is titled "RANK OF A MATRIX". He writes that rank is defined for both nxn and mxn matrices. He introduces the concept of linear dependence with the equation C1 <- aC2 + bC3, explaining that this implies C1 is linearly dependent on C2 and C3. He defines Column Rank (A) as the maximum number of linearly independent columns of A, and Row Rank (A) similarly for rows. A crucial observation is boxed on the board: Column Rank (A) = Row Rank (A) = Rank (A). He also writes Rank(A) = Rank(A^T), indicating the rank of a matrix is the same as its transpose. He notes that the maximum rank of an nxn matrix can be n.

  3. 5:00 – 10:00 05:00-10:00

    The instructor elaborates on linear dependence by expanding the column operation C1 <- aC2 + bC3 element-wise. He writes out the equations for each row: a11 = a*a12 + b*a13, a21 = a*a22 + b*a23, and a31 = a*a32 + b*a33. This demonstrates how the first column is a linear combination of the second and third. He contrasts this with linear independence, marking it with an 'X'. He then introduces a numerical definition for rank: Rank(A) = Size of largest sub-matrix with non-zero determinant. He notes that for an nxn matrix, the maximum rank can be n. This section bridges the gap between abstract linear algebra concepts and concrete calculation methods involving determinants, emphasizing that rank is a measure of the "information" or "independence" within the matrix.

  4. 10:00 – 15:00 10:00-15:00

    A specific example is worked out on the board. The matrix A is given as a 3x3 matrix: [1 0 1; -2 -3 1; 3 3 0]. The instructor calculates the determinant |A| and finds it equals 0. Consequently, he writes rank != 3 and rank < 3. To find the actual rank, he searches for a sub-matrix with a non-zero determinant. He circles a 2x2 sub-matrix [-3 1; 3 0] and calculates its determinant as -3(0) - 1(3) = -3. Since this is non-zero, he concludes rank = 2. He also writes R1 <- R2 + R3 to show row dependence, reinforcing that R1 is not linearly independent. This practical application solidifies the definition of rank using sub-matrices and shows how to handle cases where the full determinant is zero.

  5. 15:00 – 18:53 15:00-18:53

    The final section focuses on "How to compute Rank?". The instructor writes that elementary row and column operations do not change the rank of a matrix. He lists three types of row operations: 1) Swap Ri <-> Rj, 2) Ri <- kRi, and 3) Ri <- Ri + kRj. He mirrors this with column operations: 1) Swap Ci <-> Cj, 2) Ci <- kCi, and 3) Ci <- Ci + kCj. He checks off each operation to indicate they preserve rank. This provides a systematic algorithmic approach to finding rank, distinct from the sub-matrix method. The video concludes with a "THANKS FOR WATCHING" graphic, signaling the end of the lesson on rank computation.

The lecture progresses logically from foundational concepts to practical application. It starts by reviewing determinants, which are the building blocks for the numerical definition of rank. It then defines rank through the lens of linear independence (rows and columns), establishing the fundamental property that row rank equals column rank. The instructor then connects this to determinants by defining rank as the size of the largest non-zero sub-matrix determinant. This theoretical framework is immediately applied to a 3x3 matrix example, showing how a zero determinant reduces the rank and how to find the correct rank by checking smaller sub-matrices. Finally, the lesson offers an alternative computational method using elementary operations, which are proven to preserve rank. This comprehensive approach ensures students understand both the theoretical underpinnings and the mechanical procedures for determining matrix rank.

Loading lesson…