Scribd
Upload
12 views2 pages

Bca202 PRP

This document outlines the examination structure for the BCA II Semester course on Introduction to Operating Systems for the academic year 2022-23. It includes various sections with questions on topics such as process management, memory management, deadlock prevention, and scheduling algorithms. The exam consists of multiple-choice questions, descriptive questions, and problem-solving scenarios, totaling a maximum of 100 marks.

Uploaded by

leveluplabsavi01
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

Bca202 PRP

This document outlines the examination structure for the BCA II Semester course on Introduction to Operating Systems for the academic year 2022-23. It includes various sections with questions on topics such as process management, memory management, deadlock prevention, and scheduling algorithms. The exam consists of multiple-choice questions, descriptive questions, and problem-solving scenarios, totaling a maximum of 100 marks.

Uploaded by

leveluplabsavi01
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

Even Semester Examination 2022-23

BCA – II Semester
Subject Code: BCA202
INTRODUCTION TO OPERATING SYSTEM
Time: 03:00 Hrs. Maximum Marks: 100
SECTION- A
NOTE: Attempt all parts of the following question.
(10x2=20 Marks)
Q.1. Answer the following questions: (5x2=10 Marks)
i. Describe FCFS
ii. Describe context switch
iii. Define real time system
iv. State any two benefits of multithreaded programming?
v. Define swapping.
Q2. Clarify the following: (5x2=10 Marks)
i. Spooling
ii. Fragmentation
iii. Compaction
iv. Dynamic loading
v. Throughput
SECTION – ‘B’
NOTE: Attempt the following questions (10x2x2=40 Marks)
Q.3. Answer all parts:
(a)Define cooperating processes? Also explain the benefits of
cooperating processes? Q. 6. Answer all parts:
Or a) Consider the following page reference
Draw the process states diagram? And also explain the process state string: 1,2,3,4,1,2,5,1,2,3,4,5
diagram? How many page faults would occur for the following replacement
(b) Determine the different services provided by an operating algorithms, assuming three frames? Remember that all frames are initially
system? empty, so your first unique page will all cost one fault to
or Calculate the following
Determine the term critical section? What is the requirement for a FIFO replacement
critical section problem?
Q. 4. Answer all parts: LRU replacement
(a) Define deadlock. Describe various methods for deadlock OR
prevention? What is meant by file system? Discuss the different access methods?
or
Define thread? Compare user threads and kernel threads?
(b) Difference between external and internal fragmentation?
Or
Differentiate the first fit, best fit and worst fit allocation algorithms.
Give memory partitions of 300KB, 100KB, 400KB and 600KB,
compute how would each of the above processes of 250KB,
512KB, 205KB and 400KB in order?

SECTION – ‘C’
NOTE: Attempt the following questions. (20x2=40 Marks)
Q. 5. Answer all parts:
(a) Find the average waiting time (A.W.T) and average turnaround
time (A.T.A.T) for executing the following process using
(1) Preemptive short- job first (2) Non-preemptive short-job first?
PROCESS P1 P2 P3 P4 P5
BURST TIME 5 13 8 4 10
ARRIVAL TIME 0 1 2 3 4

OR
Explain the paging scheme for memory management.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy