Practice Questions

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-a-aptitude/time-and-work/multiple-topics/asset-practice-questions-8019 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: 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
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  12. MOCK TEST:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on solving work and time problems, presented by an instructor named Yash Jain Sir. The video begins with an introduction to a problem where Deepika and Ranveer complete a task together, and the goal is to find Deepika's share of the earnings. The instructor demonstrates two methods to solve this. The first method, the LCM method, involves calculating the total work as the Least Common Multiple of their individual completion times (20 and 15 days), which is 60 units. This allows for the calculation of their individual work rates (Deepika: 3 units/day, Ranveer: 4 units/day). The total earnings are then divided in the ratio of their work rates (3:4), resulting in Deepika's share being Rs. 24,000. The second method, the Efficiency method, uses the inverse relationship between time and efficiency. The time ratio is 20:15, which simplifies to 4:3, so the efficiency ratio is 3:4, leading to the same result. The video then transitions to a second problem about robots completing a contract, using the formula M1 * E1 * T1 = M2 * E2 * T2 to find the number of additional robots needed. Finally, a summary slide presents a 'Two Second Trick' for combined work problems: if A takes 'a' days and B takes 'b' days, their combined time is (a*b)/(a+b). The video concludes with a 'Thanks for Watching' screen.

Chapters

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

    The video opens with a title card for 'TIME & WORK' and then transitions to a lecture slide. The instructor, Yash Jain Sir, presents the first problem: 'Q1: Deepika does a work in 20 days while Ranveer does the same work in 15 days. They worked together and earned Rs 56000 to complete the task. Find the share of Deepika?'. The options are (A) Rs. 18000, (B) Rs. 22000, (C) Rs. 24000, (D) Rs. 32000. The instructor introduces the problem and the concept of finding shares based on work done.

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

    The instructor begins solving the first problem using 'Method 1 (Using LCM Method)'. He writes on the board that 'total work = LCM(20,15)'. He calculates the LCM of 20 and 15, which is 60, and writes 'total = 60 units'. He then calculates the work rate for Deepika as 60/20 = 3 units/day and for Ranveer as 60/15 = 4 units/day. He explains that the ratio of their work is 3:4, and the total earnings of Rs. 56000 are to be divided in this ratio. He calculates Deepika's share as (3/7) * 56000 = Rs. 24000, which corresponds to option (C).

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

    The instructor introduces 'Method 2 (Using Efficiency Method)'. He writes the formula 'Total Work = Efficiency * Time' and states that 'Time ∝ 1/Efficiency'. He calculates the time ratio of Deepika to Ranveer as 20:15, which simplifies to 4:3. He then states that the efficiency ratio is the inverse, 3:4. He uses this ratio to find Deepika's share: (3/7) * 56000 = Rs. 24000. The video then transitions to a new problem about robots, stating: 'A contract is to be completed in 52 days and 125 identical robots were employed each operational for 7 hours a day. After 39 days, 5/7 of the work was completed. How many additional robots would be required to complete the work on time, if each robot is now operational for 8 hours a day?'. He writes the formula M1 * E1 * T1 = M2 * E2 * T2 and begins to substitute values.

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

    The instructor continues solving the robot problem. He calculates the remaining time as 52 - 39 = 13 days. He sets up the equation: 125 * 7 * 39 = x * 8 * 13, where x is the number of robots needed for the remaining work. He simplifies the equation to find x = 250. He then calculates the additional robots required as 250 - 125 = 125. The video then shows a summary slide with 'Case 1: Alone works are given, task is to find the combined work?' and 'Case 2: Alone work of A is given, combined work of A and B are given, task is to find the alone work of B?'. He presents a 'Two Second Trick' for Case 1: Product/Sum = (a*b)/(a+b). The video ends with a 'THANKS FOR WATCHING' screen.

The video provides a comprehensive tutorial on work and time problems, focusing on two primary methods for calculating shares and completion times. It effectively demonstrates the LCM method, which converts work into a common unit to find individual contributions, and the Efficiency method, which uses the inverse relationship between time and efficiency. The core concept is that the share of earnings or the amount of work done is proportional to the individual's work rate or efficiency. The video also introduces a practical application with the robot problem, using the formula for work (M * E * T) to solve for an unknown variable. The final summary reinforces the key formulas and tricks, making the concepts accessible for quick problem-solving, particularly for competitive exams.

Loading lesson…