Scribd
Upload
12 views2 pages

Rtos QP 2

This document outlines the B. Tech First Internal Examination for the course ECT426 Real Time Operating Systems at Albertian Institute of Science & Technology. It includes a structured question paper with two parts: Part A contains short answer questions worth 3 marks each, and Part B consists of detailed questions worth 14 marks each. The exam covers topics such as advantages of real-time operating systems, scheduling algorithms, process states, and thread scheduling.

Uploaded by

Gregorious Jose C
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views2 pages

Rtos QP 2

This document outlines the B. Tech First Internal Examination for the course ECT426 Real Time Operating Systems at Albertian Institute of Science & Technology. It includes a structured question paper with two parts: Part A contains short answer questions worth 3 marks each, and Part B consists of detailed questions worth 14 marks each. The exam covers topics such as advantages of real-time operating systems, scheduling algorithms, process states, and thread scheduling.

Uploaded by

Gregorious Jose C
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Slot: C AISAT/Form/QPM17/F1

Reg. No.: ……………………… Name: ………………………….

ALBERTIAN INSTITUTE OF SCIENCE & TECHNOLOGY


B. Tech First Internal Examination (February 2025)
Branch and Semester: ECE S8
Course Code and Name: ECT426 REAL TIME OPERATING SYSTEMS
Max. Marks: 60 Duration: 2 Hours
Q.
Question Marks CO BL
No
Part A
Answer all questions, each question carries 3 marks

1 List any three advantages of Real Time operating System. 3 CO1 L1

2 Define an Operating System? List any two examples. 3 CO1 L1

3 Differentiate between Hybrid kernel and Exo kernel. 3 CO1 L2

4 List any three types of processor scheduling. 3 CO2 L1

Explain the Difference between Pre-emptive and Non-pre-emptive


5 3 CO2 L2
scheduling policies.
Define the following Scheduling algorithms.
6 (i) Priority 3 CO2 L1
(ii) Round robin
Part B
Answer all questions, each question carries 14 marks

7a Explain the significance of Process States in an Operating system. 7 CO1 L2

7b Describe the structure of Process Control Block. 7 CO1 L2

8a List the various Types of Operating system. 7 CO1 L1


Consider the following set of processes, with the length of CPU-
burst time given in milliseconds. The processes are assumed to
have arrived in the order P1, P2, P3, P4, P5, at all-time 0. Draw
8b four Gantt charts illustrating the execution of these processes using 7 CO2 L3
Round Robin, SJF (non-pre-emptive). What is the average waiting
time for each of the scheduling algorithms? (assume time
quantum=4)

Page 1 of 2
Slot: C AISAT/Form/QPM17/F1

9a Explain Thread Scheduling algorithm with an example. 7 CO2 L2

9b Explain the various CPU scheduling algorithms. 7 CO2 L2

Page 2 of 2

You might also like