Operating System COMPUTER SCIENCE 3RD SEMESTER MODEL QUESTION PAPER



Operating System COMPUTER SCIENCE  3RD SEMESTER MODEL QUESTION PAPER

MODEL QUESTION PAPER

Test/Date and Time

Semester/year

Course/Course Code

Max Marks

Ex: I test/6 th week of sem 10-11 AM

IV SEM

Operating System

 

20

Year: 2015-16

Course code:15CS43T

Name of Course coordinator :

Units:1,2 Co: 1,2

Note:   Answer all questions

Questio n no

Question

CL

C O

PO

1

Explain OS in user’s view and system’s view.                                                                                                  (5)

U

1

1,2

2

Explain the computer system architecture                                                                                                  (5)

U

1

1,2

3

Consider the following set of process with the length of the CPU burst time given in milliseconds

Process       Burst time          Priority P1                       9                3

P2                       11              1

P3                       3                3

The processes are assumed to have arrived in the order P1, P2, P3 all at time 0. What is the waiting time and turnaround time of each process

for FCFS & PRIORITY scheduling algorithms?                                                                                                  (5)

A

2

1,2

4

What is a process? Draw and explain the state transition diagram of a

process.

U

2

1,2


 Format for Student Activity Assessment

DIMENSION

Unsatisfactory 1

Developing 2

Satisfactory 3

Good 4

Exemplary 5

Score

Collection of data

Does not collect any information relating to the topic

Collects very limited information; some relate to the topic

Collects some basic information; refer to the topic

Collects relevant information; concerned to the topic

Collects a great deal of information; all refer to the topic

3

Fulfill team’s roles & duties

Does not perform any duties assigned to the team role

Performs very little duties

Performs nearly all duties

Performs all duties

Performs all duties of assigned team roles with presentation

4

Shares work equally

Always relies on others to do the work

Rarely does the assigned work; often needs reminding

Usually does the assigned work; rarely needs reminding

Does the assigned job without having to be reminded.

Always does the assigned work without having to be reminded and on given time

frame

3

Listen to other Team mates

Is always talking; never allows anyone else to speak

Usually does most of the talking; rarely allows others to speak

Listens, but sometimes talk too much

Listens and contributes to the relevant topic

Listens and contributes precisely to the relevant topic and exhibit leadership qualities

3

 

 

 

TOTAL

13/4=3.25=4

*All student activities should be done in a group of 4-5 students with a team leader

 
Diploma in Computer science & Engineering
IV- Semester
Course Title: Operating System
Time: 3 Hours Max Marks: 100
PART-A
Answer any SIX   questions. Each carries 5 marks. 5X6=30 Marks
1. Write a note on client/server computing.
2. Explain the contents of PCB with neat diagram.
3. Explain the different scheduling criteria.
4. Write a note on critical-section problem and the solution to solve it.
5. How deadlock can be avoided using resource allocation graph? Explain
6. What is fragmentation? Differentiate between internal and external fragmentation.
7. Explain swapping technique with a neat diagram
8. Write a note on Copy-on-write.
9. Discuss briefly client-server model of file sharing

PART-B
Answer any SEVEN full  questions each carries 10 marks. 10X7=70 Marks
1. What are the different operating system operations.

2. Different activities in connection with process management, memory management and storage management
3. Consider the following set of process with the length of the CPU burst time given in milliseconds

Process Burst Time Priority
P1                10                3
P2                 13            1
P3                 3                  3
P4        8                   4
The processes are assumed to have arrived in the order P1, P2, P3 & P4 all at time 0.

a. Draw the Gantt chart for FCFS and PRIORITY scheduling algorithms.
b. What is the waiting time and turnaround time of each process for FCFS & PRIORITY scheduling algorithms.
c. Calculate the average waiting time and average turnaround time for FCFS & PRIORITY scheduling algorithms.
 
4. Explain the different operations on processes.
5. Explain the banker’s algorithm.

6. List and explain different structure of the page table with a neat diagram

7. Explain the contiguous memory allocation.

8. Consider the following reference string: 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. How many page faults would occur for the following page replacement algorithm assuming 3 page frames: 1) LRU 2) FIFO 3) Optimal Page Replacement.
9. List out common file types with their extension and functions

10. Explain Tree-structured directory and Acyclic-graph directory with a neat diagrams

Popular Posts