GATE Exam (Mechanical) Asked Question on Alligation Rule
Duration: 13 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- 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
- 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
- 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
- AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
- 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
- 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- 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
- 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
- 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
- Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
- Live Classes: ISRO Live classes
- Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video is an educational lecture on the topic of 'Mixtures & Alligations,' presented by an instructor named Yash Jain. The lecture begins with an introduction to the topic, followed by a detailed explanation of how to solve a problem involving the average weight of two combined classes. The instructor uses the alligation method, a technique for finding the mean value of a mixture, to solve the problem. He demonstrates the method by setting up a diagram with the given values (30 and 15) and the number of students (40 and 20), then calculates the difference and ratio to find the combined average. The video also shows the application of the standard weighted average formula as an alternative method. The lecture concludes with a final answer and a thank you message.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with an animated title card featuring a cartoon scientist in a lab, with the word 'MIXTURE' visible at the bottom. This transitions to a presentation slide with a geometric background. The slide displays the title 'MIXTURES & ALLIGATIONS' and credits the instructor as 'By Yash Jain'. A small video window in the bottom right corner shows the instructor, Yash Jain, who is wearing glasses and a red shirt. He introduces the topic of mixtures and alligations, explaining that it is a common topic in competitive exams like the GATE exam, particularly for the Mechanical Branch.
2:00 – 5:00 02:00-05:00
The instructor presents a problem on the screen: 'Q: The average weight of a class of 40 students is 30 and the average weight of a class of 20 students is 15. Find the average weight of the combined class?'. He states that this is a question asked in the GATE Exam for the Mechanical Branch. He begins to solve the problem using the alligation method. He writes the two average weights, 30 and 15, on a diagram. He then writes the number of students, 40 and 20, next to their respective weights. He explains that the difference between the two values is 15 (30 - 15), which he writes on the diagram.
5:00 – 10:00 05:00-10:00
The instructor continues to solve the problem using the alligation method. He writes the difference (15) and the number of students (40 and 20) on the diagram. He then explains that the ratio of the two groups is 40:20, which simplifies to 2:1. He uses this ratio to find the combined average. He writes the formula for the weighted average: (40*30 + 20*15) / (40+20). He calculates the numerator as 1200 + 300 = 1500 and the denominator as 60. He then divides 1500 by 60 to get 25. He confirms that the combined average weight is 25.
10:00 – 12:54 10:00-12:54
The instructor reiterates the solution, showing the final answer of 25 on the screen. He explains that the combined average is 25, which is closer to 30 than to 15, because there are more students in the class with an average weight of 30. He then shows the standard formula for weighted average: x = (n1*x1 + n2*x2) / (n1 + n2). He substitutes the values into the formula and arrives at the same answer, 25. The video ends with a 'THANKS FOR WATCHING' screen.
The video provides a clear and structured lesson on solving mixture and alligation problems. It begins with an introduction to the topic and then presents a specific, exam-relevant problem. The instructor effectively demonstrates two methods to solve the problem: the alligation method, which uses a visual diagram to find the ratio and average, and the standard weighted average formula. The progression from problem statement to solution, with clear step-by-step calculations, makes the concept accessible. The video successfully connects the theoretical method to a practical application, reinforcing the learning objective.