801. Preemptive priority scheduling (dynamic): a=2 waiting, b=1 running, q=1; P1–P4 arrivals as given. Finish times P1,P2,P3,P4 =

Operating System • CPU Scheduling • UGC NET Paper 2 Computer Science JUNE 2014

802. After P1’s extra R1 & R3, the system is ___.

Operating System • Deadlock Avoidance • UGC NET Paper 2 Computer Science JUNE 2014

803. Match deadlock handling techniques: a.Timeout ordering protocol b.Prevention c.Detection d.Recovery → codes? (i) Timeout ordering (ii) Prevention (iii) Detection (iv) Recovery

Operating System • Deadlock Handling • UGC NET Paper 2 Computer Science JUNE 2014

804. Disk queue requests to cylinders [98,183,37,122,14,124,65,67], head at 53 moving toward 0. Total head movements for SSTF and SCAN =

Operating System • Disk Scheduling • UGC NET Paper 2 Computer Science JUNE 2014

805. Pages 0–7, frames=4. Reference string missing—cannot compute LRU vs Optimal faults.

Operating System • Disk Scheduling • UGC NET Paper 2 Computer Science JUNE 2014

806. Which is NOT true about disk-arm scheduling?

Operating System • Disk Scheduling • UGC NET Paper 2 Computer Science JUNE 2014

807. Match file allocation: a=Contiguous,b=Linked,c=Indexed,d=Multi-level indexed codes below.

Operating System • File Systems • UGC NET Paper 2 Computer Science JUNE 2014

808. Unix free disk blocks list is stored in the ___.

Operating System • File Systems • UGC NET Paper 2 Computer Science JUNE 2014

809. Space to store bitmap of 1.3 GB disk with 512 B blocks =

Operating System • File Systems: Bitmaps • UGC NET Paper 2 Computer Science JUNE 2014

810. Paged system: TLB hit 70%, TLB=30 ns, mem=100 ns. Effective access time = ___.

Operating System • Memory Management • UGC NET Paper 2 Computer Science JUNE 2014

811. On a uniprocessor with arrival rate λ=5/min and service time=6 s, CPU utilization ρ is:?

Operating System • Performance Modeling • UGC NET Paper 2 Computer Science JUNE 2014

812. Linux OS uses

Operating System • Process Scheduling • UGC NET Paper 2 Computer Science JUNE 2014

813. Match schedulers: a=ML feedback,b=FCFS,c=SPN,d=RR codes below.

Operating System • Scheduling • UGC NET Paper 2 Computer Science JUNE 2014

814. What does `seq 1 2 10` print on Linux?

Operating System • Shell Utilities • UGC NET Paper 2 Computer Science JUNE 2014

815. Which is non-portable in Windows 2000?

Operating System • Windows Architecture • UGC NET Paper 2 Computer Science JUNE 2014

816. Assignment problem: (a) minimize cost, (b) special case of transportation, (c) one activity per resource. Which?

Operating System • Combinatorial Optimization • UGC NET Paper 2 Computer Science JUNE 2014

817. Java uses threads to enable the environment to be _____.

Operating System • Concurrency • UGC NET Paper 2 Computer Science JUNE 2014

818. Given process–resource graph, is system deadlocked? If yes, which?

Operating System • Deadlock • UGC NET Paper 2 Computer Science JUNE 2014

819. Three processes peak 2,5,7 share m resources. For which m no deadlock?

Operating System • Deadlock • UGC NET Paper 2 Computer Science JUNE 2014

820. Safety algorithm time complexity for n processes & m resource types is:

Operating System • Deadlock Avoidance • UGC NET Paper 2 Computer Science JUNE 2014