Operating System Final Term Previous Paper

Universt XYZ Final-Term Examination-Spring 2018 Course Code: CS-313 Course Title: Operating System Concept Teacher’s Name: XYZ Total Marks: 50 Date And Time: Total Time: 2 Hours Student’s Name: Reg. No.: ---------------------------------------------------------------------------------------------------------------------------------------------- Students are advised to read and follow these instructions: 1. Write your Registration Number, other relevant information on the front page of the answer booklet sign it in the appropriate space. 2. Point out any discrepancy (torn pages, loose sheets etc.) to the invigilating staff. 3. Do not share/borrow stationery items and calculator. 4. Manage your time according to the marks allotted to the respective questions. 5. Please ensure that the area in your threshold is clean. You will be charged for any material which can be classified as ‘helping in the paper’ found near you. 6. Ask for clarifications by the Course Instructor only within the first 15 minutes of the start of the paper. 7. Mobile phones are not allowed in the Examination Hall. 8. Attempt all questions. 9. The marks for each question are written in parentheses ( ). Q-1: How can interrupts be used to improve processor utilization during I/O activity? B: Multi-programming (or multi-tasking) enables more than a single process to apparently execute simultaneously. How is this achieved on a uniprocessor? C: Describe a sequence the sequence of step that occur when a timer interrupt occurs that eventually results in a context switch to another application. (12) Q2: FIFO is also known FCFS, given below is the data with processes ID, their arrival time and their burst time. Find out the a. Average completion time b. Average waiting time ii) Round Robin is another scheduling algorithm how it works? Given below the question with processes ID, Arrival time and their Service time. The time quantum is 4 quanta. Find out the following a. Average completion time b. Average waiting time (7+7) Marks Q-3: Given below the figure what this figure depicts. Illustrate the working of interrupt or system call. How operating system saves the previous state and load the new one and vice versa. (10)
Q-4: Priority scheduling is a method of scheduling processes based on priority. Given below the example data find out the response time, average completion and waiting time of each process. (6) ii) Discuss the following (8) a. Preemptive scheduling b. Five states of process c. Long term scheduler d. Short term scheduler

Comments

Post a Comment

Popular posts from this blog

Magnifier- Magnifying Glass Privacy Policy

    Privacy Policy App built the Magnifier app as a Free app. This SERVICE is provided by App at no cost and is intended for use as is. This page is used to inform visitors regarding my policies with the collection, use, and disclosure of Personal Information if anyone decided to use my Service. If you choose to use my Service, then you agree to the collection and use of information in relation to this policy. The Personal Information that I collect is used for providing and improving the Service. I will not use or share your information with anyone except as described in this Privacy Policy. The terms used in this Privacy Policy have the same meanings as in our Terms and Conditions, which are accessible at Teleprompter unless otherwise defined in this Privacy Policy. Information Collection and Use For a better experience, while using our Service, I may require you to provide us with certain personally identifiable information. The information that I request will...
Read more

Boot Windows Oops, we get this horrible error! new method

Image
Whenever you use a partitioning tool against an installed system, there's a chance of a problem, filesystem corruption and who knows what else. There is no guarantee for success. Re-partitioning of installed operating systems is risky. This is why you should always create your setup BEFORE installations, so you never have to face this kind of problem. Repair unbootable Windows installation Following the instructions, we will boot from the Windows installation disc. Click on Repair your computer: And you will see this menu: Let Windows repair itself. It should do a pretty good job. Indeed, we're up and running. Windows 7 will start booting and recommend you run check disk against your disk, offering yet another hint that the resizing procedure messed things up a little. You should indeed let the tool run. And soon, you'll see the login menu: And here we can see the changes in My Computer and the Disk Management. One thing that Windows 7 does not report corr...
Read more

Lab. No 8 Shortest Job First Operating System

Lab. No 8 Shortest Job First Shortest-Job-First (SJF) is a non-preemptive discipline in which waiting job (or process) with the smallest estimated run-time-to-completion is run next. In other words, when CPU is available, it is assigned to the process that has smallest next CPU burst. The SJF scheduling is especially appropriate for batch jobs for which the run times are known in advance. Since the SJF scheduling algorithm gives the minimum average time for a given set of processes, it is probably optimal. The SJF algorithm favors short jobs (or processors) at the expense of longer ones. The obvious problem with SJF scheme is that it requires precise knowledge of how long a job or process will run, and this information is not usually available. Like FCFS, SJF is non-preemptive therefore; it is not useful in timesharing environment in which reasonable response time must be guaranteed. Direction: Shortest Job First Algorithm In C++. #include #include void main() { int i, j, n, proce...
Read more