Sie sind auf Seite 1von 120
© Gaterorum © Correspondence Course Computer Science & Engineering @ — > Operating System > Corser Design GATEFORUM Engineering Success « Basic concept of operating system * Process + Process states « Different system calls = Process control block = Shared memory model = Message passing model «= Communication in ciient server system = Remote procedure call = Threads * Single thread model * Multithread model = Types of threads = Types of scheduler * Scheduling criteria * Different scheduling algorithm = Concurrency «= Precedence graph = Fork and join constructs + Correspondence Course + All India Test Series + Classroom Coaching + eTutor-Online Classes 5 SEES eed SATE Fon Ecco Sov PU Wp boa ab open an a wee [CS| Correspondence Course Level - 1, CPU scheduling takes place when (A) Process switches from running state to waiting state (B) Process switches from running state to ready state (C) Process switches from waiting state to ready state (D) All of these 27 Non-preemptive scheduling takes place when L. Process switches from running state to waiting state IL. Process switches from running state to ready state IIL. When process terminates Which one of the following is true? (A) Tonly, (8) L&I only (©) T&Monly (YI, ATH 3. Which of the following statements is/are true? (A) One of the functions of operating system is to allocate resources to solve problems in a fair and efficient manner (B) Multiprogramming incieases CPU utilizati processes when the running process blocks (©) In a muttiprogramming and time-sharing environment, several users share the system simultaneously ' (D) All of these by switching to other ready mm ae my Problem of priority scheduling algorithm is (A) Deadtock (8) Spin-lock (©) Starvation (D) None of these Starvation can be avoided by <> /(A) Paging (B) Page replacement (C) Aging (D) Framing _&” CFS (first come first serve) scheduling can’t be used in i (A) Desktop system {Bf Time sharing system \ (©) Batch system (0) Local system i x Round-Robin (R-R) scheduling is similar to 1 (A) FCFS with preemption added to switch processes { (B) Non-preemptive SIF (©) Preemptive SF { (D) None of these . $ Conespondence Course + All India Test Series + Classroom Coaching + eTutor Online Classes “S RUG varied by GATE Foran Edina Sewn PV Ld No par of We Doct ay bo ropGaied or wad ary ‘nthout te wren pres. 30 |

Das könnte Ihnen auch gefallen