Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider all the processes are arriving at la...
Start Learning for Free
Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Pi and Pi+1 for any i and service time of Pi is Si. If t > Si for every i then, what should be the strategy to schedule the processes?
- a)FCFS
- b)Shortest Job First
- c)Round Robin
- d)Shortest Remaining Time Firs
Correct answer is option 'A'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Consider all the processes are arriving at large time intervals. Let t...
If t>Si then all the processes are serviced in FCFS based because when the next process arrives the previous process is already completed.
Most Upvoted Answer
Consider all the processes are arriving at large time intervals. Let t...
Is the time interval between two processes and Si is the service time of Pi, then the average waiting time for Pi can be calculated using the formula:
Average Waiting Time = (t + S1 + S2 + ... + Si-1) / i
This formula assumes that the arrival time of the first process is 0, and subsequent processes arrive at time intervals of t.
To understand why this formula works, let's break it down:
- t represents the time interval between two processes. This represents the time that Pi has to wait before it can start its execution.
- S1, S2, ..., Si-1 represent the service times of the processes that arrived before Pi. These processes must be served before Pi can start its execution.
- i represents the number of processes that arrived before Pi.
So, the total waiting time for Pi is the sum of the time interval t and the service times of all the processes that arrived before Pi. Dividing this total waiting time by the number of processes that arrived before Pi gives us the average waiting time.
Note that this formula assumes that the processes arrive at large time intervals, which means that the waiting time for each process is independent of the previous processes. If the processes arrive at shorter time intervals or if there are dependencies between the processes, this formula may not accurately represent the average waiting time.
Average Waiting Time = (t + S1 + S2 + ... + Si-1) / i
This formula assumes that the arrival time of the first process is 0, and subsequent processes arrive at time intervals of t.
To understand why this formula works, let's break it down:
- t represents the time interval between two processes. This represents the time that Pi has to wait before it can start its execution.
- S1, S2, ..., Si-1 represent the service times of the processes that arrived before Pi. These processes must be served before Pi can start its execution.
- i represents the number of processes that arrived before Pi.
So, the total waiting time for Pi is the sum of the time interval t and the service times of all the processes that arrived before Pi. Dividing this total waiting time by the number of processes that arrived before Pi gives us the average waiting time.
Note that this formula assumes that the processes arrive at large time intervals, which means that the waiting time for each process is independent of the previous processes. If the processes arrive at shorter time intervals or if there are dependencies between the processes, this formula may not accurately represent the average waiting time.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer?
Question Description
Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer?.
Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer?.
Solutions for Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer?, a detailed solution for Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer? has been provided alongside types of Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Piand Pi+1for any i and service time of Piis Si. If t > Sifor every i then, what should be the strategy to schedule the processes?a)FCFSb)Shortest Job Firstc)Round Robind)Shortest Remaining Time FirsCorrect answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup