Under-determined & Over-determined System

Duration: 6 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 classifying systems of linear equations based on the relationship between the number of equations (e) and variables (v). The instructor, Yash Jain from Knowledge Gate, categorizes systems into three distinct types: underdetermined (e < v), exactly determined (e = v), and overdetermined (e > v). Using a whiteboard, he defines these terms, provides algebraic examples, and offers geometric interpretations involving lines in a 2D plane to explain solution existence and uniqueness.

Chapters

0:00 – 2:00 00:00-02:00
The video begins with a title card showing determinant formulas before the instructor introduces the topic "Under determined and over determined System of Equations". He defines 'v' as the number of variables and 'e' as the number of equations, writing 'v -> no. of variables' and 'e -> no. of equations' at the top. He lists three primary cases: e < v results in an underdetermined system where the solution cannot be determined; e = v results in an exactly determined system; and e > v results in an overdetermined system. He writes examples like "1 eq - 2 var" and "2 eq - 3 var" on the board, marking them with an X to indicate they are underdetermined.
2:00 – 5:00 02:00-05:00
The instructor elaborates on the "exactly determined system" where e = v. He writes "V = e" in a box and explains that this system can have a unique solution, no solution, or infinite solutions, writing "[unique sol", "no sol", "oo sol"]" on the board. He draws geometric representations: intersecting lines (X) for a unique solution, parallel lines (=) for no solution, and overlapping lines (-) for infinite solutions. He then shifts to the "overdetermined system" where e > v, writing "3 eq = 2 var" as a specific example and circling "e > v" and "over determined" to emphasize the concept. He draws a diagram of three lines intersecting to show the overdetermined case.
5:00 – 6:04 05:00-06:04
The instructor provides a geometric visualization for the overdetermined case. He writes "3 lines 2D" to represent a system with 3 equations and 2 variables. He circles "2 eq" and "2 var" to show the baseline for a unique intersection point, noting "(x, y) -> 2D plane". Then he circles "3 eq" and "2 var" to show the overdetermined case. He explains that in a 2D plane, three lines generally do not intersect at a single point unless they are concurrent. He emphasizes that for e > v, we can have more than one solution or no solution. This visual aid helps clarify why overdetermined systems often have no solution. The video concludes with a "Thanks for watching" screen.

The lecture systematically builds understanding by first defining the algebraic relationship between equations and variables, then exploring the solution possibilities for each case, and finally grounding these abstract concepts in geometric intuition. By visualizing lines in a 2D plane, the instructor clarifies why systems with more equations than variables (overdetermined) often lack a solution, while systems with equal numbers (exactly determined) can have unique, infinite, or no solutions. This progression from algebra to geometry aids student comprehension of linear systems.