Practice Questions

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/NTA-UGC-NET-PAPER-2/paper-1-unit-5-mathematical-reasoning-and-aptitude/time-and-work/multiple-topics/asset-practice-questions-8019 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Course Overview: About the Course
  2. Paper - 1 | Unit - 1 | Teaching Aptitude: Nature, Objectives & Characteristics of Teaching, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Teaching-Learning Aids & ICT Integration, Evaluation, Assessment & Measurement
  3. Paper - 1 | Unit - 2 | Research Aptitude: Introduction to Research, Validity & Reliability, Research Paradigms & Types of Research, Research Process Steps, Research Ethics, Writing & Publication
  4. Paper - 1 | Unit - 3 | Comprehension: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions)
  5. Paper - 1 | Unit - 4 | Communication: Communication Basics, Language and Semiotics, Types of Communication, Communication Models, Mass Communication, Mass Media, Journalism, General Knowledge and General Studies related to Communication
  6. Paper - 1 | Unit - 5 | Mathematical Reasoning and Aptitude: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Number System, Percentage, Ratio and Proportion (Ratios), Simple Interest and Compound Interest, Speed Time and Distance, Powers and Exponents (Surds and Indices), Profit and Loss, Average, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Verbal Analogy (Word Based Analogy), Divisibility Rules, Calendar, Miscellaneous, Time and Work, Algebra
  7. Paper - 1 | Unit - 6 | Logical Reasoning: Syllogisms, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Venn Diagram, School Of Thoughts, Fallacy, Western Logic
  8. Paper - 1 | Unit - 7 | Data Interpretation: Data Interpretation
  9. Paper - 1 | Unit - 8 | Information and Communication Technology: MS Office Applications, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Electronic Data Interchange and E-Commerce, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Emerging Technologies, Terms & Abbreviations, Artificial Intelligence, Society, Law & Ethics, Keyboard Shortcuts, Website, Browser & Services
  10. Paper - 1 | Unit - 9 | People Development and Environment: Ecosystem, Biomes & Environmental Issues, MDG & SDG, Air Pollution, Water Pollution, Soil, Noise Pollution and Waste Management, Natural Resources, Energy & Disaster Management, Global Environmental Conventions – COP, Protocols & ISA
  11. Paper - 1 | Unit - 10 | Higher Education System: Vedic Education, Jainism & Buddhism, Ancient Universities, Pre-Independence Commissions, Post-Independence Policy, Higher Education Structure & Accreditation, Universities & Learning Programmes, Types of Education & NEP 2020
  12. Paper 2 | Unit 1 | Discrete Structures and Optimization: Propositional and Predicate Logic, Set Theory, Relations, Functions, Permutation and Combination, Probability, Graph Theory, Group Theory, Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Optimization
  13. Paper 2 | Unit 2 | Computer System Architecture: Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Basics of COA, Register Transfer and Microoperations, Programming the Basic Computer, Instr Formats & Modes, Control Unit Design, Pipelining, Input Output Organisation, Cache Memory Organization, Multiprocessors
  14. Paper 2 | Unit 3 | Programming Languages and Computer Graphics: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, HTML Basics, XML, JavaScript-Basics, Java, Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, OOPS with C++, Java Fundamentals
  15. Paper 2 | Unit 4 | Database Management Systems: 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  16. Paper 2 | Unit 5 | System Software and Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  17. Paper 2 | Unit 6 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  18. Paper 2 | Unit 7 | Data Structures and Algorithms: 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
  19. Paper 2 | Unit 8 | Theory of Computation and Compilers: 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
  20. Paper 2 | Unit 9 | Data Communication and Computer Networks: 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, Mobile Technology, Cloud Computing and IoT, Cloud Computing
  21. Paper 2 | Unit 10 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  22. Live Classes: NTA UGC NET 2025 Live Class
  23. Paper 1 | Full Mock Tests:
  24. Paper 2 | Full Mock Tests:
  25. Paper 1 | Previous Year Papers:
  26. Paper 2 | Previous Year Papers:
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…