Home /Islamia University Bhawalpur (IUB) /Operating System

Operating System MS Computer Science/MSc Computer Science/PhD Computer Science 3 Semester/Term Islamia University Bhawalpur (IUB) 2014

Operating System MS Computer Science/MSc Computer Science/PhD Computer Science 3 Semester/Term Islamia University Bhawalpur (IUB) 2014 — page 1

Discussion

Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.

Your email is only used to send you replies and occasional Ustadni updates. It is never shown publicly.

Log in to post under your name

No questions yet — be the first to ask.

Need Paper? See all →

Need a paper or stuck on a question? Ask here — students reply and you get an email.

Ask about a paper
  • Ayesha Mustafa· 10 days ago

    BS ZOOLOGY first semester Animal diversity ZOOL 101 - university of Punjab 2025

    0 replies Reply →
  • Abubakar· 10 days ago

    Literary criticism

    1 reply Reply →
  • Guest· 11 days ago

    this paper consists of 60 marks but now we have 35 marks paper.

    1 reply Reply →
  • saira khalid· 1 month ago

    air past paper nhi h

    1 reply Reply →
Ad

Paper text

The Islamia Unibersity of ahabalpur, Pakistan

DEPARTMENT OF COMPUTER SCIENCE & IT

IUB Affiliated Colleges

Class: MCS (3 Semester) Final Term

Subject: Operating System

Time: 100 Minutes

Name: Nudvat Batool

ustadni.com

Session: 2014-16

Code: CSIT 31103

Total Marks: 45

Roll No. 2004

(21)

Q2. Short questions. Attempt all questions. Each question has three marks.

1. Define four CPU scheduling criteria.

2. Define critical section problem.

3. What are three classical problems of synchronization?

4. What is deadlock starvation?

5. What are the differences between Long term scheduler and Short term scheduler?

6. What are the differences between Preemptive and non-Preemptive scheduling?

7. Explain semaphores and write a short note on it.

Long questions. Attempt three questions. Each question has eight marks.

(24)

Q3. What are the differences between paging and segmentation?

Q4. Consider the following set of processes, with the length of the CPU-burst time given in seconds.

Calculate waiting time, throughput time for FCFS, Preemptive SJF, Round Robin and Priority

scheduling.

Process

PI

P2

P3

P4

PS

Burst Time

10.

Arrival Time

0

2

Priority

3

1

3

tadni.com

Q5. Define synchronization. Explain how Mutex and Semaphore are used to synchronization.

Q6. Explain deadlock prevention and deadlock avoidance.

visit website: ustadni.com