BSc IT Sem I 2019 20 2019-20 OPERATING SYSTEM Question Paper - Mumbai University | munotes
Loading PDF...
Older exam
None: this is the earliest we hold
Newer exam
2019-20 - IMPERATIVE PROGRAMMING
Semester-end · 2019 20
→
Questions asked in this paper
-
Q2 Attempt any three. 15 marks
- a. Explain the structure of page table entry,
- b. Explain FIFO page replacement algorithm with proper example Explain various ways of tracking memory usage
- d. Explain various phases of logical dump Explain various operations
- f. Consider a reference string: 1,2,3,4,2,1 The number of frames in memory is 4. Find out the number of page fault using optimal page replacement algorithm and LRU algorithm
-
Q3 Attempt any three, 15 marks
- a. Explain process of DMA transfer
- b. Explain SSF scheduling algorithm with example
- c. What is deadlock? Explain conditions for resource deadlock
- d. Explain Banker’s algorithm for multiple resources with example
- e. Explain various ways of recovery from deadlock
- f. Explain two phase locking and starvation Ga, Attempt any three. (15)
- a. Explain Type-1 and Type -2
- b. Explain characteristics of clouds
- c. Explain VMware-hosted architecture with components
- d. Explain Master-Slave and Symmetric multiprocessor operating systems Explain various network services in distributed systems
- f. Explain various elements of distributed system based on CORBA QS. Attempt any three, (15)
- a. Explain ext4 file system
- b. Explain concept of intents Explain operation of buddy algorithm in linux
- d. Explain various design goals of android Explain various attributes used in MFT records,
- f. Explain I/O request packet
Read from the scan above, so a character or two may differ. The scan is the original.
Something wrong on this page? Report it and we will check it against the scan.
Quick Help
No. The full paper opens straight away, with no login and nothing to pay.
Related Resources
Something wrong with this paper? Report it.
Connected Papers
BSc IT / Sem I · 57 papers
Questions? Email contact@munotes.in
Done!