Triangle and Parallelogram Law

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/general-aptitude-reasoning/vectors/vector-basics-foundation/asset-triangle-and-parallelogram-law after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, 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, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video is a lecture on vector addition, presenting two fundamental methods: the Triangle Law and the Parallelogram Law. The first part of the video, from 0:00 to 2:00, introduces the Triangle Law. It defines the law as a method where two vectors are represented by two sides of a triangle taken in order, and their sum (resultant) is represented by the third side taken in the opposite order. The graphical representation is demonstrated with a diagram showing vector A, followed by vector B, and the resultant vector R drawn from the tail of A to the head of B. The instructor also writes the vector equation R = A + B. The second part, from 2:00 to 4:07, transitions to the Parallelogram Law. The statement for this law is presented: if two vectors are represented by the adjacent sides of a parallelogram drawn from a point, their sum (resultant) is represented by the diagonal of the parallelogram passing through that point. This is illustrated with a diagram of a parallelogram OACB, where vectors OA and OB are the adjacent sides, and the diagonal OC represents the resultant vector R. The instructor also draws a separate diagram to visually demonstrate the parallelogram construction.

Chapters

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

    The video begins with a slide titled "Vector Addition - Triangle Law". The instructor explains the statement of the law: if two vectors are represented by two sides of a triangle taken in order, their sum (resultant) is represented by the third side taken in the opposite order. The graphical representation is detailed: draw vector A, then from the head of A, draw vector B. The resultant vector R is the vector from the tail of A to the head of B. A diagram on the slide visually represents this, showing vectors A and B forming two sides of a triangle, with the resultant R as the third side. The instructor writes the vector equation R = A + B on the screen, reinforcing the concept. The slide also includes a small diagram labeled "Triangle law of vector addition".

  2. 2:00 – 4:07 02:00-04:07

    The video transitions to a new slide titled "Parallelogram Law". The instructor presents the statement: if two vectors are represented by the two adjacent sides of a parallelogram drawn from a point, their sum (resultant) is represented by the diagonal of the parallelogram passing through that point. A diagram on the slide illustrates this with a parallelogram OACB, where vectors OA and OB are the adjacent sides, and the diagonal OC represents the resultant vector R. The instructor then draws a separate diagram on the screen, showing two vectors a and b originating from a common point O, and then completing the parallelogram to show the resultant vector R as the diagonal. The instructor uses a yellow pen to draw the vectors and the parallelogram, emphasizing the construction process.

The lecture systematically introduces two graphical methods for vector addition. It first explains the Triangle Law, where vectors are added head-to-tail, and the resultant is the vector from the start of the first to the end of the second. It then presents the Parallelogram Law, where vectors are placed tail-to-tail, and the resultant is the diagonal of the parallelogram they form. Both methods are shown to be equivalent, providing different visual approaches to the same mathematical operation.

Loading lesson…