CSE316 OPERATING SYSTEM
1:36 PM CSE316 0 Comments

SESSION 2013-2014

CSE316: OPERATING SYSTEM CONCEPT

Time Allowed: 03:00 hrs Max. Marks: 100

PART A

Q1 (a) Give an abstract view of components of a computer system.
(b) Job of Security is to defend a system from external and internal attacks. Comment?
(c) Differentiate between preemptive and non-preemptive scheduling?
(d) What is busy waiting?
(e) What is Difference between Deadlock avoidance and Deadlock prevention?
(f) List the names of attributes which are helpful in identifying files.
(g) What do you mean by Dynamic Linking and Dynamic Loading?
(h) What are the solution of external fragmentation?
(i) What are two limitation of using pipes in IPC?
(j) What do you mean by file descriptors?

PART B

Q2 (a) Explain the methods through which the user interacts with the operating systems?

(b) What do you mean by operating system? Explain the structure of various operating systems.

Q3 (a) Write a program for listing all environment variables.

(b) Explain Memory Layout of C program with Suitable Examples.

Q4(a) Consider a following Page String : 1,2,4,3,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6

How many page fault would occur for the LRU Replacement algorithm assuming two, three frames? Initially all frames are empty.

(b) Compare paging with segmentation with respect to the amount of memory required by the address translation structures in order to convert virtual addresses to physical addresses.

Q5 (a) In almost every case many files are stored on the same disk. The main problem is how to allocate space to these files so that the disk space utilized effectively and files can be access quickly. Discuss the methods along with its advantage and disadvantages in details.

(b) (i) What is seek time? Why rotation latency is usually not considered in disk scheduling?

(ii) Except FCFS, none of the disk scheduling discipline is truly fair (starvation may occur) explain why this assertion is true. Also explain why fairness is an important goal in time sharing system.

Q6 (a) Write a short note on following:

(i) Named Pipes

(ii) Pipes

(iii) popen and pclose

(b) The parent process passes the data or message to child process using the method of IPC. Explain which method is used for this type of communication along with an example.

--End of Question Paper--

SESSION- 2014-2015

CSE316: OPERATING SYSTEM CONCEPT

Time Allowed: 03:00 hrs Max. Marks: 100

PART A

Q1 (a) What is a system call?
(b) What are the different states in which a process resides until its execution is completed?
(c) What is context switching?
(d) What is role of long term scheduler?
(e) What are environment variable?
(f) What is dynamic memory allocation?
(g) How deadlocks are different from starvation?
(h) Draw the wait-for-graph corresponding to this resource allocation graph. Find out whether there is is a deadlock or not?

(i) What is the deference between logical and physical address?
(j) What do you mean by external fragmentation?

PART B

Q2 (a) List five services provided by an operating system. Explain how each provides convenience to the users. Explain also in which cases it would be impossible for user-level programs to provide these services.

(b) What are difference between user level thread and kernel level threads? Under what circumstances is one type better than the other?

Q3 (a) Consider the following scenario of five processes with priority, burst and Arrival Time Calculate average waiting time and average turn around time by showing Gantt-Charts for
Process Priority Burst time Arrival Time
P1 10 3 0
P2 3 1 5
P3 2 3 2
P4 1 5 3
P5 5 2 1
i. Priority scheduling with PREEMPTIVE.
ii. Priority scheduling without PREEMPTIVE.

(b) i) Explain the differences with diagram between multilevel queue and multilevel feedback queue scheduling.
ii) Explain with example how the behavior variate when the time quantum for round robin scheduling is large or small.

Q4(a) Explain Banker's algorithm or deadlock avoidance with multiple instance of a recourse in detail with the help of example.

(b) Explain the following desk scheduling algorithms with the help of an example.
i) FCFS ii) SSTF iii) SCAN

Q5 (a) i) What is virtual memory? How demand paging supports the virtual memory? Explain in detail.
ii) How segmentation supports user view of memory?

(b) Consider the following page 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 three as frame size? Remember that all frames are initially empty.
i) LRU replacement
ii) FIFO replacement
iii) Optimal replacement

Q6 (a) Explain all the techniques dealing with inter process communication in detail.

(b) Write a program to show the usage of popen() and pclose(). Discuss with the expected outcome.

--End of Question Paper--

DOWNLOAD STUDY MATERIAL