Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Part 13 - First Come First Serve(FCFS) Scheduling Algorithm
Play lesson

Operating System - Part 13 - First Come First Serve(FCFS) Scheduling Algorithm

5.0 (0)
6 learners

What you'll learn

This course includes

  • 9 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Keywords

Full Transcript

Part-1: Introduction to Operating system: Part-2: What is Operating system and Goals of OS Part-3: Dual Mode Operation. Part-4: Loader and Linker Part-5: Types of loaders: Compile and Go loader Part-6: Types of Loaders: Simple Loader or General Loader Part-7: Types of loaders: Absolute Loader and Bootstrap Loader Part-8: Types of loaders: Relocatable/Relative/Reallocation loader Part-9: Introduction to process management Part-10: Differences between process and program Part-11: Process State Diagram Part-12: CPU Scheduling and Scheduling Criteria's Questions answered in this video are: 1) non-preemptive scheduling algorithm 2) gantt chart 3) arrival time 4) how to write gantt chart for the given problem 5) first come first serve scheduling algorithm 6) how to calculate average waiting time 7) how to calculate average turnaround time 8) how to calculate throughput

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere