Scheduling Criteria

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/operating-system/cpu-scheduling/basics-criteria/asset-scheduling-criteria after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Section A: General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, GK- Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Directions (Direction Test), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Powers and Exponents (Surds and Indices), Algebra, Probability, Mental Ability, Age Problems, Partnership, Statistics, Arithmetic, Speed Mathematics and Basic Mathematics, Miscellaneous
  5. Section A: English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Articles, Sentence Construction, Preposition, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Modals, Active Passive Voice (Voice), Sentence Correction (Error Correction), Adverb, Conjunction, Cloze Test (Cloze Passage)
  6. Section A: Hindi Language & Comprehension: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  7. Section B: 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++, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  8. Section B: 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, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  9. Section B: 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
  10. Section B: 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
  11. Section B: 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
  12. Section B: 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
  13. Section B: 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
  14. Section B: 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
  15. Section B: Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  16. Section B: 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
  17. Section B: Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Section B: Mathematics: Linear Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  19. Section B: Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  20. Section B: Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  21. DSSSB Previous Year Paper:
  22. 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 educational video provides a comprehensive overview of CPU scheduling criteria in Operating Systems, presented by Sanchit Jain from Knowledge Gate. The lecture begins by establishing that different scheduling algorithms possess unique properties that may favor specific classes of processes. Consequently, specific criteria are essential for the efficient selection of an algorithm. The instructor systematically defines and illustrates four key metrics: CPU utilization, throughput, waiting time, and response time. Using visual analogies such as a bank teller, a car assembly line, and queues of people, he clarifies abstract concepts. The session concludes by summarizing the primary goals of scheduling: maximizing utilization and throughput while minimizing turnaround, waiting, and response times. A crucial note is added that scheduling algorithms primarily affect waiting time in the ready queue rather than I/O execution time. The video serves as a foundational guide for understanding how operating systems manage process execution efficiently.

Chapters

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

    The video opens with a slide titled "Scheduling criteria". The text reads, "Different CPU-scheduling algorithms have different properties, and the choice of a particular algorithm may favour one class of processes over another." The instructor explains that because algorithms vary in their properties, selecting the right one requires considering specific criteria. He emphasizes that the choice of algorithm can inherently favor one type of process over another, making the selection process critical for system efficiency. He gestures with his hands to emphasize the different properties and the need for a structured approach to selection. The slide also mentions that "in order to efficiently select the scheduling algorithms following criteria should be taken into consideration".

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

    The first metric introduced is "CPU utilization". The slide text defines this as "Keeping the CPU as busy as possible." An image of a bank teller is displayed to provide a real-world analogy. The instructor explains that just as a bank teller should be kept busy serving customers to maximize efficiency, the CPU should be kept busy executing processes. He stresses that keeping the CPU busy is a fundamental goal of any scheduling algorithm to ensure hardware resources are not wasted. He points to the screen to draw attention to the text and the image. The visual of the bank teller helps students visualize the concept of resource utilization.

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

    The lecture moves to "Throughput", defined on the slide as "the number of processes that are completed per time unit". An image of a car assembly line illustrates this concept of continuous work completion. Next, "Waiting time" is defined as "the sum of the periods spent waiting in the ready queue." This is visualized with a photo of a long queue of people, highlighting the time spent waiting. Finally, "Response Time" is explained as "the time it takes to start responding, not the time it takes to output the response." An image of people waiting for food is used to show the moment service begins. The instructor clarifies that response time measures the delay until the first response, not the total task duration. He uses hand gestures to differentiate between starting and finishing. The visual of the food stall helps distinguish between response time and turnaround time.

  4. 10:00 – 10:17 10:00-10:17

    The video concludes with a summary slide containing a note. The text states, "The CPU-scheduling algorithm does not affect the amount of time during which a process executes I/O; it affects only the amount of time that a process spends waiting in the ready queue." The final point on the slide reads, "It is desirable to maximize CPU utilization and throughput and to minimize turnaround time, waiting time, and response time." The instructor reiterates these objectives, summarizing the trade-offs and goals of CPU scheduling. He underlines the key terms on the slide to emphasize their importance. The note clarifies the limitations of scheduling algorithms regarding I/O time.

The lecture effectively breaks down the complex topic of CPU scheduling into four measurable criteria. By using relatable analogies like bank tellers and assembly lines, the instructor makes abstract concepts like utilization and throughput concrete. The progression from system-centric metrics (utilization, throughput) to user-centric metrics (waiting time, response time) provides a logical flow. The final summary reinforces the dual goals of maximizing system efficiency and minimizing user wait times, while clarifying the specific scope of what scheduling algorithms can and cannot influence regarding I/O and execution time. This structured approach helps students understand the trade-offs involved in designing and selecting scheduling algorithms.

Loading lesson…