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-8016 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 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…