LRTF

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/operating-system/cpu-scheduling/ljf-hrrn/asset-lrtf after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Programming, Data Structures, OOP & Java: 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, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: Data Interpretation
  18. Basis of Physics: Physics
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture covers CPU scheduling algorithms, specifically Longest Job First (LJF) and its pre-emptive variant, Longest Remaining Time First (LRTF). The instructor defines LJF, noting on-screen text that "Process having longest Burst Time will get scheduled first." He demonstrates a non-preemptive example using a table of five processes (P1-P5) with varying arrival and burst times. He constructs a Gantt chart, showing how P1 runs first, followed by P4, P5, P3, and finally P2, based on the longest available burst time. The second half introduces LRTF, emphasizing its pre-emptive nature where the process with the longest *remaining* time is chosen, even if it was already running.

Chapters

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

    The instructor introduces the Longest Job First algorithm, highlighting on-screen text that states "Process having longest Burst Time will get scheduled first." He presents a table with five processes (P1-P5) and their Arrival/Burst Times. He then draws a timeline (Gantt chart) to solve a non-preemptive example. He starts with P1 at time 0, runs it for 3 units (finishing at t=3). At t=3, he compares available processes P2 (BT=2), P3 (BT=4), and P4 (BT=5), selecting P4 because it has the longest burst time. He continues this logic, selecting P5 (BT=6) which runs from t=8 to t=14, then P3 (BT=4) from t=14 to t=18, and finally P2 (BT=2) from t=18 to t=20.

  2. 2:00 – 3:42 02:00-03:42

    The topic shifts to Longest Remaining Time First (LRTF), described as pre-emptive. A table shows three processes (P1-P3) arriving at time 0 with burst times 2, 4, and 8. The instructor draws a Gantt chart showing P3 running initially. He updates the remaining burst times in the table (crossing out original values and writing new ones, e.g., P3's BT changes from 8 to 4). He demonstrates preemption by switching between P3 and P2 as their remaining times fluctuate. At time 8, when remaining times for P1, P2, and P3 are all equal (2 units), he switches to P1, then P2, then P3, finishing the schedule at time 11. This illustrates how LRTF handles ties and preemption dynamically.

The lecture distinguishes between non-preemptive and pre-emptive scheduling based on job length. LJF minimizes average waiting time but can cause starvation for short jobs. LRTF adds pre-emption, allowing shorter jobs to run if their remaining time becomes the longest relative to others, though the example shows frequent context switching. Both algorithms prioritize longer tasks, contrasting with Shortest Job First. The visual Gantt charts and table updates provide clear evidence of the scheduling logic.

Loading lesson…