Centre for Distance and Online Education
Model Question Paper (MQP)
Name of Programme: Master of Computer Applications
Semester: I
Course Code: OMCA103
Course Name: Operating System
Instructions
This paper consists of three sections: A, B, and C. Answer all questions from Section A, any four questions from
Section B, and any three questions from Section C. Marks are indicated against each question.
• Section A: Multiple choice questions (MCQs)
Each question carries two marks
No. of questions: 10 (all to be answered)
Maximum marks: 10 x 2 = 20 marks
• Section B: Short answer questions (200-250 words)
Each question carries five marks
No. of questions: Six (answer any four)
Maximum marks: 4 x 5 = 20 marks
• Section C: Long answer questions (400-450 words)
Each question carries ten marks
No. of questions: Four (answer any three)
Maximum marks: 3 x 10 = 30 marks
Maximum marks: 70 marks
Exam duration: 3 hours
SECTION A: MCQ
Answer options
Sl. Question
A B C D
Killed by
A process can be terminated due All of the
1 Normal exit Fatal error another
to __________ mentioned
process
The address of the next
instruction to be executed by the Program
2 CPU registers Process stack Pipe
current process is provided by the counter
__________
In Operating Systems, which of
Shortest Job All of the
3 the following is/are CPU Priority Round Robin
First mentioned
scheduling algorithms?
Special
Semaphore is a/an _______ to Hardware for a Integer None of the
4 program for a
solve the critical section problem. system variable mentioned
system
Which one of the following is the Banker’s Round-robin Elevator Karn’s
5
deadlock avoidance algorithm? algorithm algorithm algorithm algorithm
Round robin scheduling falls Non-
Preemptive All of the None of the
6 under the category of preemptive
scheduling mentioned mentioned
____________ scheduling
A unique piece of information that
7 Cipher Plain Text Key Cipher
is used in encryption.
The device that deals with the bus
access control functions and bus bus allotment priority none of the
8 bus arbiter
handshake activities controller resolver mentioned
is_____________
Separate
The information about all files is Operating None of the
9 Swap space directory
kept in ____________ system mentioned
structure
Greater
The main objective in building the Greater Enhanced throughput and None of the
10
multi-microprocessor is throughput fault tolerance enhanced fault mentioned
tolerance
SECTION B: Short answer questions* (200-250 words)
Sl. No. Question Marks
Describe the distributed systems & variety of major reasons for building distributed
1 5
systems.
2 5
Using SJF algorithm calculate Average waiting time & Average time around time.
3 A Brief description on “Recovery from deadlock” 5
4 Give a brief description on LRU page replacement algorithm with example? 5
I. I. How do you relate Page fault with Thrashing?
5 2.5+2.5=5
II. II. Based on instructions and data, describe Flynn classified computer systems.
What is Encryption and decryption?
6 2.5+2.5
When the “Handshaking” occurs?
*Answer any four questions
SECTION C: Long answer questions* (400-450 words)
Sl. No. Question Marks
I. Describe the Directory structure and its types
1 7+3=10
II. What is the purpose ‘Bit Vector’.
I. Describe Page fault with an example
2 5+5=10
II. Describe the concept of File
I. Describe the types of Encryptions in a distributed environment
3 7+3=10
II. Describe the three features of NOS architecture.
I. Describe Semaphore
4 5+5
II. What is the difference of NOS & GOS
*Answer any three questions
****************************************************** END OF SHEET ******************************************************