Basic Concepts
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper-2 | Programming & Data Structures: 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
- Paper-2 | Databases / DBMS & SQL: 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
- Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- Paper-2 | 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
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
- Paper-2 | 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, Run Time Environment
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video presents a structured lesson on solving time and work problems, a common topic in quantitative aptitude. The instructor begins by introducing the fundamental concept that the total work is considered as 1 unit or 100%. The first problem demonstrates that if a person completes 25% of the work in one day, they will take 4 days to complete the entire task, which is calculated as 100% / 25% = 4 days. The second problem involves a two-person scenario where Modi Ji completes 4/5 of the work, and Kejriwal Ji completes the remainder. The solution is found by subtracting the completed portion from the total: 1 - 4/5 = 1/5. The video then establishes two key assumptions for solving such problems: work done per day is constant, and total work is 1 unit. Finally, it applies the formula Total Work = Efficiency × Number of Persons × Number of Days, using the example of a person making 5 chairs per day to calculate the total output for one person over 6 days (30 chairs) and for 10 people over 6 days (300 chairs). The lesson concludes with a summary of the core formula and its components.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title card for 'TIME & WORK' and transitions to a lecture. The instructor, Yash Jain Sir, presents the first problem: 'Person 'A' can do 25% work in one day. In how many days 'A' can complete the work?'. He explains that the total work is 100%, and since the person completes 25% per day, the number of days required is 100% / 25% = 4 days. He writes '25% 25% 25% 25%' and 'total: 4 days' on the screen to illustrate the calculation.
2:00 – 5:00 02:00-05:00
The instructor moves to the second problem: 'Modi Ji completes 4/5 of work and left. Kejriwal Ji joins and completes the remaining work, what part of the work was completed by Kejriwal Ji?'. He writes the equation 4/5 + x = 1, where x is the part completed by Kejriwal Ji. He solves for x, showing that x = 1 - 4/5 = 1/5. The video then presents two 'Basic Assumptions': 1. Amount of work done by a person should be equal on all days. 2. Total amount of work is considered as 1 unit or 100%. An example is given: '100 chairs in 5 days'. The instructor then introduces the formula for total work: Total Work = Efficiency × Number of Persons × Number of Days, and applies it to two scenarios: (i) one person making 5 chairs per day for 6 days, resulting in 30 chairs, and (ii) 10 people making 5 chairs per day for 6 days, resulting in 300 chairs.
5:00 – 5:37 05:00-05:37
The video concludes with a final slide that displays the formula 'Total Work = Efficiency * Number of Persons * Number of Days' and a list of definitions for the variables: Work, Men, Efficiency, and Time. The screen then transitions to a blue, abstract background with the text 'THANKS FOR WATCHING' in white, marking the end of the lesson.
The video provides a clear, step-by-step tutorial on solving time and work problems. It begins with a simple, intuitive example to establish the core concept of dividing total work by daily work rate. It then progresses to a more complex problem involving fractions and the concept of remaining work. The lesson is structured around two fundamental assumptions that form the basis for all calculations. The final segment consolidates the learning by introducing a universal formula, 'Total Work = Efficiency × Number of Persons × Number of Days', and demonstrates its application with concrete examples, effectively teaching students a systematic approach to this type of quantitative problem.