Practice Questions

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/quantitative-aptitude/time-and-work/multiple-topics/asset-practice-questions-8016 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. 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)
  13. 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
  14. 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)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video presents a series of time and work problems, a common topic in quantitative aptitude. The instructor, Yash Jain Sir, systematically solves three distinct problems. The first problem involves three machines (P, Q, R) with different printing speeds, where machine P stops after 2 hours, and the remaining work is completed by machines Q and R. The solution uses the formula: (Time worked by P / P's alone time) + (Time worked by Q / Q's alone time) + (Time worked by R / R's alone time) = 1. The second problem features a work scenario where one man starts a job, and one more man joins him every day, with the total work being equivalent to 60 men working for 25 days. The solution involves summing the work done each day (1+2+3+...+n) and equating it to the total work. The third problem is an 'alternate days' problem where Anushka and Virat work on alternate days, with Anushka starting first. The solution calculates the work done in a two-day cycle and then determines the total number of days required. The video uses a digital whiteboard to write out the problems, formulas, and step-by-step calculations, with the instructor providing verbal explanations throughout.

Chapters

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

    The video opens with a title card for a 'TIME & WORK' lesson. The first problem (Q1) is presented on a green digital board. It states that machine P can print one lakh books in 8 hours, machine Q in 10 hours, and machine R in 12 hours. All machines start at 9 AM, but machine P stops at 11 AM. The question asks at what time the work will be completed. The instructor, Yash Jain Sir, is visible in a small window, and the Microsoft logo is in the top right corner. The problem is clearly laid out with the options (A) 11:30 AM, (B) 12 noon, (C) 12:30 PM, (D) 1:00 PM.

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

    The instructor begins solving Q1. He writes the formula for work: (Time worked by P / P's alone time) + (Time worked by Q / Q's alone time) + (Time worked by R / R's alone time) = 1. He identifies that machine P works for 2 hours (from 9 AM to 11 AM). He then sets up the equation: (2/8) + (x/10) + (x/12) = 1, where x is the time (in hours) that machines Q and R work together after P stops. He proceeds to solve this equation by finding a common denominator (120) and simplifying to 30 + 12x + 10x = 120, which becomes 22x = 90. He calculates x = 90/22, which is approximately 4.09 hours. The instructor then states that the work will be completed at 12:30 PM, which is 2 hours after 10:30 AM, but the calculation shows 4.09 hours after 11 AM, which would be 3:05 PM. The instructor's final answer is 12:30 PM, which is inconsistent with his calculation. The video shows the instructor writing the equation and the steps to solve it.

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

    The video transitions to the second problem (Q2). The problem states that 60 men can complete a work in 25 days. One man starts the work, and one more man joins him every day. The question asks how many days the work will be completed. The instructor writes the formula for total work: MEN * TIME. He calculates the total work as 60 * 25 = 1500 man-days. He then sets up the equation for the work done: 1*1 + 2*1 + 3*1 + ... + n*1 = 1500, which simplifies to the sum of the first n natural numbers: n(n+1)/2 = 1500. He multiplies both sides by 2 to get n(n+1) = 3000. He then solves the quadratic equation n^2 + n - 3000 = 0. The instructor states that the answer is 54 days, which corresponds to option (D). The video shows the step-by-step derivation of the equation and the final answer.

  4. 10:00 – 11:07 10:00-11:07

    The video presents the third problem (Q3) on 'Alternate Days Problems'. Anushka can complete a work in 9 days, and Virat can complete it in 12 days. They work on alternate days, with Anushka starting first. The question asks how many days the work will be completed. The instructor writes the work rates: Anushka's rate is 1/9 per day, and Virat's rate is 1/12 per day. He calculates the work done in a two-day cycle: (1/9 + 1/12) = (4/36 + 3/36) = 7/36. He then determines how many such cycles are needed: 36/7 = 5 cycles with a remainder of 1/7. He calculates the work done in 10 days (5 cycles) as 5 * (7/36) = 35/36. The remaining work is 1 - 35/36 = 1/36. On the 11th day, Anushka works and completes 1/9 of the work, which is more than the remaining 1/36. The instructor concludes that the work will be completed in 10 and 1/4 days, which is 10.25 days. The video ends with a 'THANKS FOR WATCHING' screen.

The video provides a comprehensive walkthrough of three different types of time and work problems. It begins with a standard problem involving multiple machines with different work rates, demonstrating the use of the work formula. It then moves to a more complex problem involving a changing workforce, requiring the sum of an arithmetic series. Finally, it tackles an 'alternate days' problem, which requires calculating the work done in a repeating cycle. The progression shows a clear increase in complexity, from a single formula application to a multi-step problem involving series and cycles. The instructor uses a digital whiteboard to clearly present the problems and calculations, making the solution process easy to follow.

Loading lesson…