[Question Paper] Operating System (Old Course) [September / 2013]
•
0 likes•60 views
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - IV [Operating System] (Old Course). [Year - September / 2013] . . . Solution Set of this Paper is Coming soon . . .
![O p e r a t i n g S y s t e m
Q u e s t i o n P a p e r ( S e p t e m b e r – 2 0 1 3 ) [ O l d C o u r s e ]
1 | Page
M u m b a i B . S c . I T S t u d y
F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e
– Kamal T.
Time: 3 Hours Total Marks: 100
N.B.: (1) All Questions are Compulsory.
(2) Answer any four questions from Question Nos. 2 to 7.
Q.1 Attempt The Following Question: (20 Marks)
(A) Explain various functions of Operating System. (10)
(B) Explain FCFS Algorithm with proper example. (10)
Q.2 Attempt The Following Question: (20 Marks)
(A) Explain Real Time OS. Explain its types. (6)
(B) Explain Multiprogrammed OS with diagram. (7)
(C) Explain Distributed OS. Explain its types. (7)
Q.3 Attempt The Following Question: (20 Marks)
(A) What is OS? Explain various services provided by OS. (6)
(B) Explain Caching. (7)
(C) Explain Preemptive and Non-Preemptive Algorithm. (7)
Q.4 Attempt The Following Question: (20 Marks)
(A) Explain various Multithreaded Model in detail. (6)
(B) What is Scheduling? Explain Long-Term and Short-Term Scheduling. (7)
(C) What is process? Explain various process states with neat diagram. (7)
Q.5 Attempt The Following Question: (20 Marks)
(A) What are Best-fit, First-fit and Next-fit Algorithms? Explain with neat diagram. (6)
(B) Explain various File Operations. (7)
(C) How paging is performed explain in detail. (7)](https://image.slidesharecdn.com/os-qp-old-course-september-2013-170802123723/85/Question-Paper-Operating-System-Old-Course-September-2013-1-320.jpg)
![O p e r a t i n g S y s t e m
Q u e s t i o n P a p e r ( S e p t e m b e r – 2 0 1 3 ) [ O l d C o u r s e ]
2 | Page
M u m b a i B . S c . I T S t u d y
F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e
– Kamal T.
Q.6 Attempt The Following Question: (20 Marks)
(A) Explain advantages and disadvantages of a GUI Based Operating System. (6)
(B) What is Deadlock? What is Resources Allocation Graph? (7)
(C) Explain PCB. (7)
Q.7 Attempt The Following Question: (20 Marks)
(A) Write note on Semaphores. (6)
(B) Explain various technique in Memory Management. (7)
(C) Explain Deadlock Avoidance Techniques. (7)](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
Recommended
More Related Content
What's hot
What's hot (20)
Similar to [Question Paper] Operating System (Old Course) [September / 2013]
Similar to [Question Paper] Operating System (Old Course) [September / 2013] (20)
More from Mumbai B.Sc.IT Study
More from Mumbai B.Sc.IT Study (20)
Recently uploaded
Recently uploaded (20)
[Question Paper] Operating System (Old Course) [September / 2013]
- 1. O p e r a t i n g S y s t e m Q u e s t i o n P a p e r ( S e p t e m b e r – 2 0 1 3 ) [ O l d C o u r s e ] 1 | Page M u m b a i B . S c . I T S t u d y F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e – Kamal T. Time: 3 Hours Total Marks: 100 N.B.: (1) All Questions are Compulsory. (2) Answer any four questions from Question Nos. 2 to 7. Q.1 Attempt The Following Question: (20 Marks) (A) Explain various functions of Operating System. (10) (B) Explain FCFS Algorithm with proper example. (10) Q.2 Attempt The Following Question: (20 Marks) (A) Explain Real Time OS. Explain its types. (6) (B) Explain Multiprogrammed OS with diagram. (7) (C) Explain Distributed OS. Explain its types. (7) Q.3 Attempt The Following Question: (20 Marks) (A) What is OS? Explain various services provided by OS. (6) (B) Explain Caching. (7) (C) Explain Preemptive and Non-Preemptive Algorithm. (7) Q.4 Attempt The Following Question: (20 Marks) (A) Explain various Multithreaded Model in detail. (6) (B) What is Scheduling? Explain Long-Term and Short-Term Scheduling. (7) (C) What is process? Explain various process states with neat diagram. (7) Q.5 Attempt The Following Question: (20 Marks) (A) What are Best-fit, First-fit and Next-fit Algorithms? Explain with neat diagram. (6) (B) Explain various File Operations. (7) (C) How paging is performed explain in detail. (7)
- 2. O p e r a t i n g S y s t e m Q u e s t i o n P a p e r ( S e p t e m b e r – 2 0 1 3 ) [ O l d C o u r s e ] 2 | Page M u m b a i B . S c . I T S t u d y F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e – Kamal T. Q.6 Attempt The Following Question: (20 Marks) (A) Explain advantages and disadvantages of a GUI Based Operating System. (6) (B) What is Deadlock? What is Resources Allocation Graph? (7) (C) Explain PCB. (7) Q.7 Attempt The Following Question: (20 Marks) (A) Write note on Semaphores. (6) (B) Explain various technique in Memory Management. (7) (C) Explain Deadlock Avoidance Techniques. (7)