Académique Documents
Professionnel Documents
Culture Documents
immediately)
END-TERM EXAMINATION
DECEMBER 2006
Exam Series Code: 100353DEC06200382
Time: 3 Hours
Maximum Marks: 75
Note: Q.1 is compulsory and attempt four from Question No. 2 to 9 selecting one
question from each unit
Q. 1.
(a) What is an interrupt?
(b) What are the distinctions between internal and external
fragmentation?
(c) List three advantages of user level threads over kernel level threads.
(d) What is monitor?
(e) What are the differences among deadlock avoidance, detection and
prevention?
(f) What are the differences between SCAN and C-SCAN disk
scheduling algorithms?
(g) What is a file control block?
(h) What are different file attributes and file operations in a typical file
system.
(8 x 2.5 = 20)
UNIT - I
Q. 2.
(a) Why are segmentation and paging sometimes combined into one
scheme? Compare paging with segmentation with respect to amount
of memory translation structures in order to convert virtual addresses
to physical addresses.
(6)
(b) Consider a simple segmentation system that has the following
segment table.
(4)
Starting Address
660
1752
222
996
Length (bytes)
248
422
198
604
Q. 3.
(a) A process contains eight virtual pages on disk and is assigned a fixed
allocation of four page frames in main memory. The following page
trace occurs
1,0,2,2,1,7,6,7,0,1,2,0,3,0,4,5,1,5,2,4,5,6,7,6,7,2,4,2,7,3,3,2,3
Show the successive page residing in the four frames using LRU
replacement policy. Compare the hit ratio in main memory.
(4)
(5)
(5)
Process Name
A
B
C
D
E
Arrival Time
0
1
3
9
12
Processing Time
3
5
2
5
5
Calculate the average waiting time and average turnaround time for FCFS,
Round Robin (Time slice=2) and shortest job first scheduling algorithms.
Q. 5.
(a) What are the conditions generally associated with reader-writer
problem?
(5)
(b) Show that Petersons solution to critical section problem satisfies all
the requirements of critical section solutions.
(5)
UNIT III
P0
P1
P2
P3
P4
Allocation
A B C D
0 0 1 2
1 0 0 0
1 3 5 4
0 6 3 2
0 0 1 4
A
0
1
2
0
0
Max
B C
0 1
7 5
3 5
6 5
6 5
D
2
0
6
2
6
Available
A B C D
1 5 2 0
(5)
----------------------------------------
END-TERM EXAMINATION
Third Semester [MCA] - DECEMBER 2005
Paper Code: MCA 201
Time: 3 Hours
Maximum Marks: 60
Note: Attempt any five questions. All questions carry equal marks.
(b) Describe the steps how a page fault is handled by the operating system.
UNIT II
Q. 4. (a) What are the necessary conditions for a deadlock to occur? Explain. 5
(b) Explain Bankers algorithm for deadlock avoidance.
5
Q. 5. (a) What are semaphores? How these are implemented?
UNIT - III
Q. 6. Suppose a disk queue with requests for I/O to blocks on cylinders:100, 175, 50, 120, 120, 20, 150, 75, 200
10
If the disk head is currently at 60, find out the total disk head movement for the
following algorithm:(a) FCFS
(b) SSTP
(c) SCAN
(d) LOOK
(e) C-SCAN
5
5
UNIT - IV
Q. 8. Explain the contiguous, linked and indexed file allocation techniques with
suitable example. What technique is used in Unix Operating System?
Q. 9. (a) What are the different file access methods?
(b) Explain the different directory structure?
10
5
5
----------------------------------------
END-TERM EXAMINATION
Third Semester [MCA] - DECEMBER 2004
Paper Code: MCA 201
Time: 3 Hours
Note: Attempt any five questions. All questions carry equal marks.
(b) How protection is provided by the operating system at the file system level?
Explain different protection mechanism.
6
Q. 2. (a) What is a process? How it differs from a program? Differentiate between a
multiprocessing system and a multiprocessor system.
6
(b) Explain the purpose of schedulers. With a neat diagram explain different
types of schedulers.
6
Q. 3. (a) What is a directory? Explain different directory structure.
(b)Explain the linked and indexed memory allocation technique for secondary
storage management. How file space is allocated in Unix Operating system?
6
Q. 4. (a) Differentiate between buffering and spooling.
4
(b) Explain pages segmentation memory management technique. What special
hardware are required for such a system?
8
Q. 5. (a) What is deadlock? Explain four necessary conditions for a deadlock to
occur.
6
6
Q. 6. (a) What do you mean by fragmentation? How the fragmentation problem can
be solved?
6
(b) What is device controller? State some advantages of placing functionality in
a device controller rather than in the kernel.
6
Q. 7. (a) What are the various algorithms for process scheduling? Explain each of
them.
8
(b) What are concurrent and cooperating processes? Explain.
12
----------------------------------------
END-TERM EXAMINATION
Third Semester [MCA] - DECEMBER 2003
Paper Code: MCA 201
Time: 3 Hours
Maximum Marks: 60
Note: Attempt any five questions.
Q. 1. (a) Define the essential properties of the following types of Operating Systems:6
(i) Batch
(iii) Time Sharing
(v) Network
(ii) Interactive
(iv) Real Time
(vi) Distributed
(b) What are the differences between a trap and an interrupt? What is the use of
each function?
6
Q. 2. (a) Describe the actions taken by a thread library to context switch between
user-level threads.
Q. 3. Consider the following set of process, with the length of the CPU burst time
given in milliseconds
12
Process
P1
P2
P3
P4
P5
Burst Time
10
1
2
1
5
Priority
3
1
3
4
2
The process are assumed to have arrived in the order P1,P2, P3, P4,P5 all at time 0.
(a) Draw four Gantt charts that illustrate the execution of these processes
using FCFS, SJF, A non preemptive priority and RR (quantum=1)
scheduling.
(b) What is the turnaround time of each process for each of the scheduling
algorithm in part (a)?
(c) What is the waiting time of each process for each of the scheduling
algorithm in part (a)?
(d) Which of the schedules in part (a) results in the minimal average waiting
time (over all process)?
6
(b) Consider a logical address space of eight pages of 1024 words each,
mapped onto a physical memory of 32 frames.
6
i. How many bits are there in the logical address?
ii. How many bits are there in the physical address?
12
(b) What problem could occur if a system allowed a file system to be mounted
simultaneously at more than one location?
6
Q. 7. Write short notes on any two :(a) PCB
(b) Segmentation
(c) Disk Structure
12
----------------------------------------
END-TERM EXAMINATION
Third Semester [MCA] - DECEMBER 2002
Paper Code: MCA 201
Time: 3 Hours
Maximum Marks: 60
Note: Attempt any five questions.
Q. 2. (a) What is spooling? How would an input spooling system designed to read
punched cards from a card reader to operate.
6
(b) Describe the actions taken by a kernel to context switch between processes.
6
Q. 3. Consider the following set of process, with the length of the CPU burst time
given in milliseconds:
12
Process
P1
P2
P3
P4
P5
Burst Time
10
1
2
1
5
Priority
3
1
3
4
2
The process are assumed to have arrived in the order P1,P2, P3, P4, P5 all at time 0.
(a) Draw four Gantt charts that illustrate the execution of these processes using
FCFS, SJF, A non preemptive priority (A smaller number implies a higher
priority) and RR (quantum) scheduling.
(b) What is the turnaround time of each process for each of the scheduling
algorithm in part (a)?
(c)What is the waiting time of each process for each of the scheduling algorithm
in part (a)?
Q. 4. (a) Write the difference between logical and physical address.
(b) Describe the following allocation algorithms.
(i) First Fit
(ii) Best Fit (iii) Worst Fit
Q. 5. (a) Why are segmentation and paging sometimes combined into one scheme? 6
(b) When virtual memory is implemented in a computing system it carries
certain cost and certain benefits. List those costs and the benefits. Explain what
measures you can take to ensure that this imbalance does not occur.
6
Q. 6. (a) What are the advantages and the disadvantages of recording the name of
creating program with the file attribute?
6
(b) How do caches help improve performance? Why do systems not use more
or large caches?
6
Q. 7. (a) State three advantages of placing functionality in a device controller, rather
than in the Kernel. State three disadvantages.
6
(b) How does DMA increase system concurrency? How does it complicate the
hardware design?
6
Q. 8. Write short notes on the following :(a) Demand Paging
(b) Process control block
12
----------------------------------------
END-TERM EXAMINATION
Third Semester [MCA] - DECEMBER 2000
Paper Code: MCA 201
Time: 3 Hours
Maximum Marks: 70
Note: Attempt any seven questions. All Question carry equal marks.
Q. 1. (a) Define User, Job and process. Explain the relation between user, job process
and address space.
(b) List benefit of spooling. Give one sentence explaining of each. Is spooling
feasible for all types of I/O devices?
Q. 2.
Q. 3.
Q. 4.
Q. 5.
Q. 6.
Q. 7.
Q. 8.
What are various page removal technique used for memory management?
Explain any two techniques.
Q. 9.
Q. 10. Describe the need of device management. Explain techniques used for
managing and allocating devices.
Q. 11. What are Direct Access Storage Devices? Give example and explain one of
them with diagram.
----------------------------------------
Note: Attempt Five questions in all including Q.no. 1. Which is compulsory. All question
carry equal marks.
Q.1 (a) Define operating system.
(b) What is Race condition?
(c) Define physical file system.
(d) What is job scheduling?
(e) What is a device controller?
(f) What is an interrupt vector?
Q.2 Describe various function of an operating system briefly.
Q.3 Explain the following briefly: (a) Segmented Memory Management
(b) Paged Memory Management
(c) Relevance of Multiprogramming to Memory Management
Q.4 (a) Define Semaphores. How these are useful and used? Explain with examples.
(b) What are the various criteria to be taken for selecting a scheduling policy?
Explain briefly with example.
Q.5 Differentiate between the following: (a) Multiplexing and Buffering
(b) Channels and Controls Units
(c) Dedicated and Shared devices
Q.6 (a) Differentiate between logical and physical file system with their relative merits and demerits.
(b) Describe the concept of fragmentation briefly.
Q.7 Write short notes on the following: (a) Virtual devices
(b) Direct Memory Access (DMA)
(c) Symbolic file system
(c)
(d)
(e)
(f)
Q2. What is an operating System? Define the Protected Mode and Supervisor
Mode.
(12)
Q3.
Q5.
(6)
(34=12)
Q6. Differentiate between the following:(a) Basic file system and Logical File System
(b) File systm Interface and File File System Implementation
(c) Directory Implementation and Directory Structure
(34=12)
(43=12)
Paper code:MCA201
Paper id44201
subject:operating system
(batch:20042008)
Time:3 hours
marks:60
Maximum
Q1
(2X10=20)
(a) What are the advantages of having different time quantum sizes on different level
of a multilevel queuing system?
(b) Write an algorithm to solve problem of critical section among two processes.
(c) Differentiate between constant linear velocity and constant angular velocity of disk
structure.
(d) Explain file allocation method implanted in unix.
(e)
(f) Consider a logical adderess space of eight pages of 1024 words each,mapped onto
a physical memory of 32frames.how many bits are there in the logical address?
How many bits are there in the physical address?
(g) Describe a mechanism by which one segment could belong to the address space of
two different processes?
(h) What is Beladys Anomaly?explain.
(i) degree of multiprogramming control the performance of the computing system
comment.
(j) How thread creation differ from that of process creation? Briefly explain.
UNITI
Q2
Q3
(a) why are segmentation and paging sometime combined into one scheme? What are their
Advantages and disadvantages?
(5)
(b) given the memory partition of 400K,100K,500K,800K (in order) how would each of the
Firstfit, bestfit and worstfit algorithms place processes of 190K,420,171K,540K(in
Order)?which algorithm makes the efficient use of memory?
(5)
UNITII
Q4
(6)
(b) when virtual memory is implemented in a computing system,it carries certain cost and
certain benefits. List thosecosts and the benefits. It is possible for the costs exceed the
benefits. Explain what measures you can take to ensure that this imbalance does not occur.(4)
Q5
consider the processes listed in the following table,usin g priority scheduling for:(a)preemptive
and (b) non preemptive
process
Arrival time
Burst time
Priority no.
A
0
2
2
B
0
7
4
C
1
3
1
D
3
1
5
Answer the following:
(i)
Draw gantt charts illustrating the exception og these processes.
(ii)
What is the turnaround time of each process?
(iii) What is the average throughout of each of these?
Note that the small interger value(of priority no) indicate high order of priority.
Q6
(10)
UNITIII
consider the following snapshots of a system:
P0
P1
P2
P3
P4
Allocation
ABCD
0012
1000
1354
0632
0014
Max
ABCD
0012
1750
2356
0652
0656
Available
ABCD
1520
Q7
(a) suppose that a disk has 5000 cylinder numbered 0 to 4999. The drive is currently at 143
and previous record was at 150. The queue of pending request, in FIFO is 28, 1470,913, 2050,
1509, 1022,20,389,4888,260. Starting from current head position, what is total distance that
disk moves to satisfy all pending request for each if the following algorithms:
(i) SSTF
(ii) SCAN
(iii) LOOK
(6)
(b)
(4)
UNITIV
Q8
(a) explain the sequential and direct file access method. How can a sequential file be
simulated on a direct access file? Explain.
(5)
(b) what is logical file system? How it is different from that of physical file system?
Explain with examples.
(5)
Q9
(5X2=10)
Note: Attempt five questions. Select one question from each unit including Q.1 which
is compulsory
(2x 10=20)
Q3
(a) Given the memory partition of 600K , 200K, 250K,500K (in order) how would each of
the first-fit, best-fit and worst-fit algorithms place processes of 128k, 581k, 411k,
221k (in order)? Which algorithm makes the efficient use of memory?
(5)
(b) What are the different ways to implement Least Recent Used algorithm, to determine
which page is decided as a victim page?
(5)
UNIT-II
Q4 Consider the processes listed in the following table:Processes
Arrival Time
Burst Time
Priority No.
P1
1
20
2
P2
4
16
1
P3
5
04
3
Answer the following:(a) Draw 3 Gantt charts for Priority (pre-emptive), SJF (non pre-emptive) and RR (with
the quantum 4).
(b) Calculate avg. waiting time for each of the above scheduling.
(c) Calculate avg. Turnaround time for each of the above scheduling. Note that the small
integer value (of priority No.) indicates high order of priority.
Q5
(a) Explain Readers-writers problem with its algorithm.
(b) How are synchronization tools helpful? Explain critical region and monitors.
(6)
(4)
UNIT-III
Q6
(a) What are the safety algorithm and Resource Request algorithm? Explain them with
example.
(5)
(b) Explain secondary storage structure having small variance in access time T(i, j). (5)
Q7
(a) Suppose that a disk drive has 2000 cylinders numbered 0 to 1999. The drive is
currently at 10 and previous record was at 140. The queue of pending requests, in
FIFO is 68, 1460, 811, 200, 1500, 1022, 28, 1389, 887, 160. Starting from current
head position, what is the total distance that disk moves to satisfy all pending request
for each algorithms:(i) SSTF
(ii) C-SCAN (iii) LOOK
(6)
(b) What are the differences between techniques of Buffering from that of Blocking?
Explain with example.
(4)
UNIT-IV
Q8
(a) How do caches help to improve performance of the systems? Why do no systems
use more or larger caches, if they are so useful? Explain with example.
(5)
(b) Explain Indexed and Contiguous file allocation methods with suitable example.
(5)
Q9 Write short notes on any two of the following:(a) Real-Time vs. Embedded Systems
(b) Multi-Level Feedback Queues
(c) Deadlock Prevention vs. Deadlock Avoidance
(5x2=10)
***********************
(2X10=20)
Q2. Discuss about safe state and usefulness of safety algorithm for Deadlock avoidance (10)
Q3. Describe the state transition model in which few states resides in secondary memory.
Also describe the use of these states.
(10)
Arrival Time
0.0 msec
0.5 msec
1.0 msec
(10)
Burst Time
6 ms
4 ms
10 ms
Find the weighted turnaround time for shortest job first technique and future knowledge
technique.
Q5. (a) List the disadvantages of paged memory management techniques and segmentation
memory management techniques.
(5)
(b) A variable partition memory system has given partition size 30K, 50K, 10K, 5K, and
20K. A new process of 15K is to be loaded. Which partition would be appropriate using first
fit, best fit and worst fit techniques. Explain your answer in detail.
(5)
Q6. (a) Is disk scheduling other than FCFS scheduling useful in a single user environment?
Explain your answer.
(4)
(b) Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. Initially head is
at cylinder 143 and the previous request was at cylinder 125. Consider the following head
requests:
86, 1470,913 ,1774 ,948 ,1509 ,1022 ,1750 ,130.
Determine the total distance for the following disk scheduling algorithms:
(i)
(ii)
C-SCAN
LOOK
(6)
Q7. List the differences between Linux Operating System and Windows XP operating
system in view of operating systems resources.
(10)
(2X5=10)
(a) Cryptography
(b) Block Multiplexing
(c) Beladys Anomaly
(d) System Calls
Time : 3Hours
Maximum Marks :60
Note : Attempt any five questions including Q.no.1 which is compulsory
Q1
UNIT-I
Q2
(5)
(b) explain Process Control Block. Draw the block diagram of process transition
states.
(5)
(c) What resources are used when a thread is created? How do they differ from those
used when a process is created? Describe the actions taken by a thread library to
context-switch between user-level threads.
(1+1+3)
OR
Q3
(a) Explain the term operating system. Differentiate between Hard operating system and
soft ooperating system.
(5)
(b) Write short note on multiple processor scheduling with the examples.
(5)
(c) Discuss and explain the scheduling criteria and its algorithms in brief.
(5)
UNIT-II
Q4
(a) Compare segmentation and paging schemes used in memory management. Give
their applications.
(6)
(b) Consider the following workoad:
Process
(i)
(ii)
Q5
Burst Time
Priority
Arrival Time
P1
50ms
4
0ms
P2
20 ms
1
20ms
P3
100ms
3
40ms
P4
40ms
2
60ms
Draw the Gantt chart to illustrate the cpu scheduling for shortest remaining
time, non-preemptive priority (a smaller priority number implies higher priority)
and round robin with quantum 30ms.
(6)
Calculate the turnaround time for each process in the above mentioned CPU
scheduling algorithms.
(3)
OR
(a) Define Semaphores. Write the functions for wait() and signal() used in semaphores.
Give the applications for binary semaphores and counting semaphores.
(1+2+2)
(b) Consider a system consisting of m resources of the same type which are being
shared by n processes. A process can request or release only one resource at a time.
Show that the system is deadlock free if the following two conditions hold:
(4)
(i) The maximum need of each process is between one resource and m resources.
(ii) The sum of all maximum needs is less than m+n.
(c) Consider the following page reference strings:-
(6)
1, 2, 3, 4, 2, 1, 5, 2, 3, 7, 6, 3, 5, 1, 2, 3, 6
How many page faults would occur for the following replacement algorithms, assuming
four frames? Assuming all frames are initially empty and first unique pages will cost one
fault each.
(i)
UNIT-III
Q6
(a) Compare the features of dedicated devices, shared devices and virtual device. Give
their respective applications.
(6)
(b) Explain buffering and multiplexing in device management.
(6)
(3)
OR
Q7
(6)
(3)
(c) Disk requests are made for disk driver to cylinders 10, 22, 20, 2, 40, 6 and 38. A seek
takes 6 msec per cylinder. The initial position of disk arm is at cylinder 20. How much
seek time is needed for the following:(6)
(i) FCFS
(ii) SSTF
(iii) C-SCAN
UNIT-IV
Q8
(a) Explain network related threats and give their respective solutions.
(4)
(4)
(4)
(3)
OR
Q9
(5X3=15)
**********
Note: Attempt any five questions. Select one question from each unit.
Q. 1 is compulsory.
Q1.
(10X2)
Q2.
(5X2=10)
(a) What is an operating system structure ? Explain the different Components of
operating system with merits and demerits.
(b) What is a Critical Section problem ? How it effects the System. System the
solution for improvement.
Q3.
(3)
(3)
(4)
P.T.O
UNIT-II
Q4.
(10)
(a) Define the Device Management. Explain various Techniques for
device management.
(b) What is Swap-Space Management? How it effects Device System ?
Q5.
Q6.
(10)
(a) Explain the Linux Operating System. Differentiate with Windows
Operating System.
(b) What is the Cryptography? Discuss its functionality in details.
Q7.
Explain in short:
(a) System threats
(b) Goals of protection
(c) Directory Implementation
UNIT-VI
Q8.
(10)
(a) Write about the file system structures. What is a basic file system?
(b) Describe the security problem for the system ? How to protect our
system from the security risk?
Q9.
Multi programming
Semaphores
Message passing
Demand paging
Multiple Paths