[Question Paper] Operating System (Old Course) [June / 2014]
•
0 likes•47 views
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - IV [Operating System] (Old Course). [Year - June / 2014] . . . 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 ( J u n e – 2 0 1 4 ) [ 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.
Q.1 Attempt The Following Question: (10 Marks)
(A) Explain Scheduling. (5)
(B) Explain different Types of files. (5)
Q.2 Attempt Any Three From The Following: (15 Marks)
(A) Explain Real Time OS. (5)
(B) Explain Multitasking with example. (5)
(C) Explain Distributed OS. (5)
(D) What is Assembler? (5)
Q.3 Attempt Any Three From The Following: (15 Marks)
(A) Explain various types of the system calls. (5)
(B) Explain various services provided by OS. (5)
(C) Explain concept of Virtual Machine. (5)
(D) Explain Aging Techniques. (5)
Q.4 Attempt Any Three From The Following: (15 Marks)
(A) Explain FCFS with example. (5)
(B) Explain threading model in detail. (5)
(C) Explain Long-Term and Short-Term Scheduling. (5)
(D) Explain various Process States with Neat Diagram. (5)
Q.5 Attempt Any Three From The Following: (15 Marks)
(A) What are Best-Fit, First-Fit and Next-Fit Algorithms? (5)
(B) Explain any one technique for Memory Management in detail. (5)
(C) Explain Memory Management. (5)
(D) How paging is performed explain in detail. (5)](https://image.slidesharecdn.com/os-qp-old-course-june-2014-170802123747/85/Question-Paper-Operating-System-Old-Course-June-2014-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 ( J u n e – 2 0 1 4 ) [ 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 Any Three From The Following: (15 Marks)
(A) Explain various free space management methods. (5)
(B) Define deadlock? Explain characteristic of deadlock? (5)
(C) How Disk Management. (5)
(D) Explain various File Operation. (5)
Q.7 Attempt Any Three From The Following: (15 Marks)
(A) What are the benefits of principle of protection? (5)
(B) Explain different types of file assess method. (5)
(C) Explain characteristics of Good Password. (5)
(D) Explain Security. (5)](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) [June / 2014]
Similar to [Question Paper] Operating System (Old Course) [June / 2014] (18)
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) [June / 2014]
- 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 ( J u n e – 2 0 1 4 ) [ 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. Q.1 Attempt The Following Question: (10 Marks) (A) Explain Scheduling. (5) (B) Explain different Types of files. (5) Q.2 Attempt Any Three From The Following: (15 Marks) (A) Explain Real Time OS. (5) (B) Explain Multitasking with example. (5) (C) Explain Distributed OS. (5) (D) What is Assembler? (5) Q.3 Attempt Any Three From The Following: (15 Marks) (A) Explain various types of the system calls. (5) (B) Explain various services provided by OS. (5) (C) Explain concept of Virtual Machine. (5) (D) Explain Aging Techniques. (5) Q.4 Attempt Any Three From The Following: (15 Marks) (A) Explain FCFS with example. (5) (B) Explain threading model in detail. (5) (C) Explain Long-Term and Short-Term Scheduling. (5) (D) Explain various Process States with Neat Diagram. (5) Q.5 Attempt Any Three From The Following: (15 Marks) (A) What are Best-Fit, First-Fit and Next-Fit Algorithms? (5) (B) Explain any one technique for Memory Management in detail. (5) (C) Explain Memory Management. (5) (D) How paging is performed explain in detail. (5)
- 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 ( J u n e – 2 0 1 4 ) [ 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 Any Three From The Following: (15 Marks) (A) Explain various free space management methods. (5) (B) Define deadlock? Explain characteristic of deadlock? (5) (C) How Disk Management. (5) (D) Explain various File Operation. (5) Q.7 Attempt Any Three From The Following: (15 Marks) (A) What are the benefits of principle of protection? (5) (B) Explain different types of file assess method. (5) (C) Explain characteristics of Good Password. (5) (D) Explain Security. (5)