All Courses
Get the App Signup / Login
Sign in Open App
Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Tests  >  Test: Aperiodic Scheduling - Computer Science Engineering (CSE) MCQ

Test: Aperiodic Scheduling - Computer Science Engineering (CSE) MCQ


Test Description

15 Questions MCQ Test - Test: Aperiodic Scheduling

Test: Aperiodic Scheduling for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Test: Aperiodic Scheduling questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Aperiodic Scheduling MCQs are made for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Aperiodic Scheduling below.
Solutions of Test: Aperiodic Scheduling questions in English are available as part of our course for Computer Science Engineering (CSE) & Test: Aperiodic Scheduling solutions in Hindi for Computer Science Engineering (CSE) course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Aperiodic Scheduling | 15 questions in 25 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
Test: Aperiodic Scheduling - Question 1
Save

 Which algorithm is based on Jackson’s rule?

Detailed Solution for Test: Aperiodic Scheduling - Question 1

Explanation: The EDD or earliest due date is based on Jackson’s rule. The Jackson’s rule states that for a given a set of n independent tasks, any algorithm that executes the tasks in the order of nondecreasing deadlines is optimal with respect to reducing the maximum lateness. EDF is the earliest deadline first, LL is the least laxity and the LST is the least slack time first.

Test: Aperiodic Scheduling - Question 2
Save

What does EDD stand for?

Detailed Solution for Test: Aperiodic Scheduling - Question 2

Explanation: The earliest due date requires all tasks to be sorted by their deadlines and it is based on Jackson’s rule. If the deadlines are known, EDD algorithm can be used.

1 Crore+ students have signed up on EduRev. Have you? Download the App
Test: Aperiodic Scheduling - Question 3
Save

Which of the following can be implemented as static scheduling algorithm?

Detailed Solution for Test: Aperiodic Scheduling - Question 3

Explanation: The EDD can be implemented as static scheduling algorithm if the deadlines are known in advance and it follows Jackson’s rule.

Test: Aperiodic Scheduling - Question 4
Save

What does EDF stand for?
Detailed Solution for Test: Aperiodic Scheduling - Question 4

Explanation: The EDF stands for earliest deadline first. This algorithm is optimal with respect to minimizing the maximum lateness and is implemented as dynamic scheduling algorithm for a set of n independent tasks with arbitrary arrival times, any algorithm that at any instant executes the task with the earliest absolute deadline among all the ready tasks is optimal with respect to minimizing the maximum lateness.

Test: Aperiodic Scheduling - Question 5
Save

Which algorithm is dynamic scheduling algorithm?
Detailed Solution for Test: Aperiodic Scheduling - Question 5

Explanation: The EDF or earliest deadline first can be implemented as a dynamic scheduling algorithm.

Test: Aperiodic Scheduling - Question 6
Save

In which scheduling, the task priorities are a monotonically decreasing function of laxity?
Detailed Solution for Test: Aperiodic Scheduling - Question 6

Explanation: In the least laxity algorithm, the laxity can be changed dynamically which shows that the task priorities are a monotonically decreasing function of laxity.

Test: Aperiodic Scheduling - Question 7
Save

 Which scheduling algorithm is an optimal scheduling policy for mono-processor system?
Detailed Solution for Test: Aperiodic Scheduling - Question 7

Explanation: The least laxity algorithm is a dynamic scheduling algorithm and hence it can be implemented as an optimal scheduling policy for the mono-processor system. The LL scheduling algorithm is also a preemptive scheduling.

Test: Aperiodic Scheduling - Question 8
Save

 Which scheduling algorithm cannot be used with a standard OS providing fixed priorities?
Detailed Solution for Test: Aperiodic Scheduling - Question 8

Explanation: The least laxity algorithm cannot be used with a standard OS providing fixed priorities because of its dynamic property.

Test: Aperiodic Scheduling - Question 9
Save

 Who proposed LDF algorithm?
Detailed Solution for Test: Aperiodic Scheduling - Question 9

Explanation: The latest deadline first or LDF is proposed by Lawler which performs a topological sort. It is based on the total order compatible with the partial order with respect to the task graph.

Test: Aperiodic Scheduling - Question 10
Save

 What does LDF stand for?
Detailed Solution for Test: Aperiodic Scheduling - Question 10

Explanation: The LDF or latest deadline first is a scheduling algorithm which is proposed by Lawler.

Test: Aperiodic Scheduling - Question 11
Save

 Which algorithm is non-preemptive and can be used with a mono processor?
Detailed Solution for Test: Aperiodic Scheduling - Question 11

Explanation: The latest deadline first or LDF is a non-preemptive scheduling algorithm and can be used with a mono processor whereas LL or least laxity is a preemptive scheduling algorithm.

Test: Aperiodic Scheduling - Question 12
Save

 Which algorithm requires the periodic checks of the laxity?
Detailed Solution for Test: Aperiodic Scheduling - Question 12

Explanation: The LL scheduling algorithm requires the knowledge of the execution times and the periodic check of the laxity.

Test: Aperiodic Scheduling - Question 13
Save

Who developed the heuristic algorithm?
Detailed Solution for Test: Aperiodic Scheduling - Question 13

Explanation: The heuristic algorithm is developed by Stankovic and Ramamritham in 1991.

Test: Aperiodic Scheduling - Question 14
Save

Which algorithm can be used if the preemptive is not allowed?
Detailed Solution for Test: Aperiodic Scheduling - Question 14

Explanation: The heuristic algorithm was proposed by Stankovic and Ramamritham in 1991 can be used if the preemption is not allowed.

Test: Aperiodic Scheduling - Question 15
Save

Deadline interval – execution time =
Detailed Solution for Test: Aperiodic Scheduling - Question 15

Explanation: The laxity is defined as the deadline interval minus the execution time. It is also known as the slack.

Information about Test: Aperiodic Scheduling Page
In this test you can find the Exam questions for Test: Aperiodic Scheduling solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Aperiodic Scheduling, EduRev gives you an ample number of Online tests for practice

Top Courses for Computer Science Engineering (CSE)

Download as PDF

Top Courses for Computer Science Engineering (CSE)

Important Questions for Aperiodic Scheduling

Find all the important questions for Aperiodic Scheduling at EduRev.Get fully prepared for Aperiodic Scheduling with EduRev's comprehensive question bank and test resources. Our platform offers a diverse range of question papers covering various topics within the Aperiodic Scheduling syllabus. Whether you need to review specific subjects or assess your overall readiness, EduRev has you covered. The questions are designed to challenge you and help you gain confidence in tackling the actual exam. Maximize your chances of success by utilizing EduRev's extensive collection of Aperiodic Scheduling resources.

Aperiodic Scheduling MCQs with Answers

Prepare for the Aperiodic Scheduling within the Computer Science Engineering (CSE) exam with comprehensive MCQs and answers at EduRev. Our platform offers a wide range of practice papers, question papers, and mock tests to familiarize you with the exam pattern and syllabus. Access the best books, study materials, and notes curated by toppers to enhance your preparation. Stay updated with the exam date and receive expert preparation tips and paper analysis. Visit EduRev's official website today and access a wealth of videos and coaching resources to excel in your exam.

Online Tests for Aperiodic Scheduling

Practice with a wide array of question papers that follow the exam pattern and syllabus. Our platform offers a user-friendly interface, allowing you to track your progress and identify areas for improvement. Access detailed solutions and explanations for each test to enhance your understanding of concepts. With EduRev's Online Tests, you can build confidence, boost your performance, and ace Aperiodic Scheduling with ease. Join thousands of successful students who have benefited from our trusted online resources.
© 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