721. Match: (a) Disk scheduling – Round-robin; (b) Batch – SCAN; (c) Time sharing – LIFO; (d) Interrupt processing – FIFO

Operating System • Scheduling & Processing • UGC NET Paper 2 Computer Science JUNE 2010

722. Dijkstra’s banker's algorithm solves __.

Operating System • Concurrency Control • UGC NET Paper 2 Computer Science JUNE 2010

723. On I/O interrupt, CPU __.

Operating System • Interrupt Handling • UGC NET Paper 2 Computer Science JUNE 2010

724. Poisson(λ=20/hr), P(no requests in 45 min) = __.

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

725. Block caches are used to

Operating System • Caching • UGC NET Paper 2 Computer Science JUNE 2010

726. Software that creates a job queue is the

Operating System • Job Management • UGC NET Paper 2 Computer Science JUNE 2010

727. Virtual memory is

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

728. A process can be in how many states?

Operating System • Processes • UGC NET Paper 2 Computer Science JUNE 2010

729. Command to view a file 24 lines at a time is

Operating System • Shell Commands • UGC NET Paper 2 Computer Science JUNE 2010

730. Mutual exclusion relationship means

Operating System • Synchronization • UGC NET Paper 2 Computer Science JUNE 2010

731. To prevent low-priority starvation in priority scheduling use?

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

732. Partitions 100K,500K,200K,300K,600K; process 426K with first-fit goes to?

Operating System • Memory Allocation (First-Fit) • UGC NET Paper 2 Computer Science JUNE 2010

733. Which memory allocation suffers external fragmentation?

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

734. In UNIX, change process priority with?

Operating System • Process Management • UGC NET Paper 2 Computer Science JUNE 2010

735. For round-robin with n processes, switch time s, and period ≤ t, quantum q must satisfy:

Operating System • CPU Scheduling: Round-Robin • UGC NET Paper 2 Computer Science JUNE 2010

736. With m identical resources and processes with max demands 3, 4, 6, deadlock is impossible if m ≥:

Operating System • Deadlock: Resource Allocation • UGC NET Paper 2 Computer Science JUNE 2010

737. In an LP with 3 basic and 2 non-basic variables, possible number of basic solutions is

Operating System • Linear Programming • UGC NET Paper 2 Computer Science JUNE 2010

738. If a dual LP is unbounded, its primal is

Operating System • Linear Programming • UGC NET Paper 2 Computer Science JUNE 2010

739. Which OS is best suited for client–server networks?

Operating System • Network OS Features • UGC NET Paper 2 Computer Science JUNE 2010

740. Everything below the system-call interface and above hardware is the:

Operating System • OS Architecture: Kernel • UGC NET Paper 2 Computer Science JUNE 2010