Operating Systems (Question bank) (Set-1)
Q1: A variable partition memory system has at some point in time the following hole sizes in the given order :- 20k, 15k, 40k, 60k, 10k, 25k A new process is to be loaded. Which hole size would be filled using best-fit, first-fit and worst-fit respectively?
Q2: Explain the following:
(a) Batch Processing
(b) Multiprocessing
(c) Multitasking
(d) Real time operating system
Q3: What is round robin scheduling? Explain taking any example. Can it be useful for a single user system? If yes, then explain. If no, then why not?
Q4: Describe the difference between short term, medium term and long term scheduling.
Q5: What is the difference between dedicated and virtual device?
Q6: What is a dead lock? What are the-conditions for a deadlock to occur? How it can be avoided?
Q7: Suppose that the head of moving head-disk with 20 tracks, numbered 0 to 199, has just finished a request at track 125. The queue of the requests is kept in FIFO order: 86,147,91, 177, 94, 150, 102, 175, 130.
What is the total number of head movements needed to satisfy requests for the following disk Scheduling algorithms (i) FCFS (ii) SSTF (iii) Scan
Q8: Discuss the structure of directory and its implementation in detail.
Q9: What are the various free space management techniques? Discuss.
Q10: What is a swap space?
Q11: What is a time sharing system?
Q12: Distinguish between pipe and output redirection.
Q13: Why it is necessary to reallocate a program in memory?
Q14: What is a process?
Q15: Why protection of file is required?
Q16: Name any two network operating systems.
Q17: What do you understand by thrashing?
Q18: Explain what is FILE ALLOCATION TABLE
Q19: What is Virtual Memory?
Q20: What is an Operating System? Discuss in detail how the operating system can be classified into different categories?
Q21: Distinguish between preemptive and non-preemptive scheduling policies.
Q22: Explain the various Directory structure used in operating system for storing files. Give merits and demerits of all directory structure.
Q23: What would be the effect of the system running too many I/O jobs?
Q24: If a space allocation system could use two different sizes of allocation, e.g., 4K bytes and
512 bytes, how could this be used to minimize fragmentation?
Q25: Distinguish between disk caching and RAM disk and indicate typical applications of each.
Q2: Explain the following:
(a) Batch Processing
(b) Multiprocessing
(c) Multitasking
(d) Real time operating system
Q3: What is round robin scheduling? Explain taking any example. Can it be useful for a single user system? If yes, then explain. If no, then why not?
Q4: Describe the difference between short term, medium term and long term scheduling.
Q5: What is the difference between dedicated and virtual device?
Q6: What is a dead lock? What are the-conditions for a deadlock to occur? How it can be avoided?
Q7: Suppose that the head of moving head-disk with 20 tracks, numbered 0 to 199, has just finished a request at track 125. The queue of the requests is kept in FIFO order: 86,147,91, 177, 94, 150, 102, 175, 130.
What is the total number of head movements needed to satisfy requests for the following disk Scheduling algorithms (i) FCFS (ii) SSTF (iii) Scan
Q8: Discuss the structure of directory and its implementation in detail.
Q9: What are the various free space management techniques? Discuss.
Q10: What is a swap space?
Q11: What is a time sharing system?
Q12: Distinguish between pipe and output redirection.
Q13: Why it is necessary to reallocate a program in memory?
Q14: What is a process?
Q15: Why protection of file is required?
Q16: Name any two network operating systems.
Q17: What do you understand by thrashing?
Q18: Explain what is FILE ALLOCATION TABLE
Q19: What is Virtual Memory?
Q20: What is an Operating System? Discuss in detail how the operating system can be classified into different categories?
Q21: Distinguish between preemptive and non-preemptive scheduling policies.
Q22: Explain the various Directory structure used in operating system for storing files. Give merits and demerits of all directory structure.
Q23: What would be the effect of the system running too many I/O jobs?
Q24: If a space allocation system could use two different sizes of allocation, e.g., 4K bytes and
512 bytes, how could this be used to minimize fragmentation?
Q25: Distinguish between disk caching and RAM disk and indicate typical applications of each.