set-10
451. The function(s) of the file system is (are):
To provide complete file naming freedom to the users and to permit controlled sharing of files
To provide for long and short-term storage of files with appropriate economic tradeoffs
To provide security against loss of information due to system failure
All of the above
452. Moving a process from main memory to disk is called:
Scheduling
Swapping
Caching
Spooling
453. In order to allow only one process to enter its critical section, binary semaphores are initialized to:
0
1
2
3
454. The state transition initiated by the user process itself in an operating system is:
Block
Wake up
Dispatch
Timer run out
455. Which of the following terms refers to the degree to which data in a database system are accurate and correct?
Data security
Data independence
Data validity
Data integrity
456. The total time to prepare a disk drive mechanism for a block of data to be read from it is:
Latency
Latency plus transmission time
Latency plus seek time
Latency plus seek time plus transmission time
457. The paging rate:
Should never be greater than 100 per second
Is greater for large programs
Is the number of I/O interrupts each second
Increases as the number of page faults increases
458. Thrashing:
Is a natural consequence of virtual memory systems
Can always be avoided by swapping
Always occurs on large computers
Can be caused by poor paging algorithms
459. The computational technique used to compute the disk storage address of individual records is called:
Bubble memory
Dynamic reallocation
Key fielding
Hashing
460. Capacity planning:
Requires detailed system performance information
Is independent of the operating system
Does not depend on the monitoring tools available
Is not needed in small installations
461. In a multiprogramming system, a set of processes is deadlocked if each process in the set is waiting for an event to occur that can be initiated only by another process in the set. Which of the following is not one of the four conditions that are necessary for deadlock to occur?
Non-preemption
Partial assignment of resources
Process suspension
Circular wait
462. Belady's anomaly occurs in:
Optimal replacement
LRU
FIFO
Both in FIFO and LRU
463. The CPU, after receiving an interrupt from an I/O device:
Halts for a predetermined time
Hands over control of the address bus and data bus to the interrupting device
Branches off to the interrupt service routine immediately
Branches off to the interrupt service routine after completion of the current instruction
464. Which of the following is not a characteristic of a daisy chaining priority control scheme?
Priority is programmable
It is relatively easy to add more devices to the chain
The failure of one device may affect other devices on the chain
The number of control lines is independent of the number of devices on the chain
465. An example of a system development program is:
Operating system
Database management systems
Performance monitors
Language translators
466. Which of the following is not a part of the operating system?
Supervisor
Job-control program
Performance monitor
Input/output control program
467. If special forms are needed for printing the output, the programmer specifies these through:
JCL
Utility programs
IPL
Load modules
468. Which of the following is not an advantage of multiprogramming?
Increased throughput
Shorter response time
Decreased operating system overhead
Ability to assign priorities to jobs
469. The problem of thrashing is affected significantly by:
Program structure
Primary-storage size
Program size
None of the above
470. Logical extension of multiprogramming of operating system is:
Time sharing
Single programming
Multi-tasking
Both (A) and (B)
471. Under multiprogramming, turnaround time for short jobs is usually...... and that for long jobs is slightly......
Lengthened; shortened
Shortened; shortened
Shortened; lengthened
Shortened; unchanged
472. Remote computing service involves the use of time-sharing and......
Multiprocessing
Batch processing
Interactive processing
Real-time processing
473. Under which circumstances the scheduling scheme is non-preemptive:
When a process switches from running to waiting state, when a process terminates
When a process switches from waiting to the ready state
When a process switches from waiting to the ready state
Both (A) and (B)
474. Under which circumstances the scheduling scheme is preemptive:
When a process switches from running to waiting state
When a process switches from running to the ready state
When a process switches from waiting to the ready state
Both (B) and (C)
475. ......gives control of the CPU to the process selected by the short-term scheduler.
Long-term scheduler
Dispatcher
Medium-term scheduler
None of the above
476. Which of the following are the functions of the dispatcher?
Swapping
Jumping to the proper location in the user program to restart that program
Scheduling
All of the above
477. Which of the following are CPU scheduling criteria?
CPU utilization
Dispatcher latency
Waiting time
Both (A) and (B)
478. Which of the following is true for the algorithms for allocating regions of contiguous memory?
First-fit
Best-fit
Next-fit
All of the above
479. The first-fit algorithm for allocating regions of contiguous memory does......
Scan memory region list from start for first fit
Scan memory region list from point of last allocation to next
Tends to leave small unusable regions, and slower due to requirement of searching the entire list
There is no such algorithm
480. The best-fit algorithm for allocating regions of contiguous memory does......
Scan memory regions from start for first fit
Pick the closest free region in the entire list
There is no such algorithm
Find the worst fit in the entire list
481. Which of the following are scheduling algorithms:
First come first serve
Priority scheduling
Shortest job first
All of the above
482. Routine is not loaded until it is called. All routines are kept on disk in a reloadable load format. The main program is loaded into memory & is executed. This type of loading is called ______.
Static loading
Dynamic linking
Dynamic loading
Overlays
483. Which of the following is crucial time while accessing data on the disk?
Seek time
Transmission time
Rotational time
Waiting time
484. The host repeatedly checks if the controller is busy until it is not. It is in a loop that status register’s busy bit becomes clear. This is called ______ and a mechanism for the hardware controller to notify the CPU that it is ready is called ______.
Interrupt and Polling
Polling and Interrupt
Polling and Spooling
Deadlock and Starvation
485. Unix Operating System is an ______.
Time Sharing Operating System
Multi-tasking Operating System
Multi-User Operating Systems
All of the Above
486. Which of the following memory allocation scheme suffers from External fragmentation?
Segmentation
Swapping
Pure demand paging
Paging
487. Information about a process is maintained in a ______.
Stack
Process Control Block
Translation Look aside Buffer
Program Control Block
488. Distributed OS works on the ______ principle.
File Foundation
Multi system image
Single system images
Networking image
489. The problem of fragmentation arises in ______.
Static storage allocation
Stack allocation storage
Stack allocation with dynamic binding
Heap allocation
490. Which file system does DOS typically use?
FAT16
NTFS
FAT32
WNFS
491. The program is known as ______ which interacts with the inner part of called kernel.
Compiler
Protocol
Device Driver
Shell
492. The time taken by the disk arm to locate the specific address of a sector for getting information is called ______.
Rotational Latency
Search Time
Seek Time
Response Time
493. Which file system does Windows 95 typically use?
FAT16
NTFS
FAT32
LMFS
494. Identify the odd thing in the services of operating system.
Accounting
Error detection and correction
Protections
Deadlock handling
495. Cryptography technique is used in ______.
Polling
Protection
Job Scheduling
File Management
496. Which of the following is not an advantage of multiprogramming?
Increased throughput
Shorter response times
Decreased operating system overhead
Ability to assign priorities to jobs
497. In ______ OS, the response time is very critical.
Multitasking
Online
Batch
Real-time
498. An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ______.
FCFS scheduling algorithm
Round robin scheduling algorithm
Shortest job-first scheduling algorithm
None of the above
499. Real-time systems are ______.
Primarily used on mainframe computers
Used for monitoring events as they occur
Used for program development
Used for real-time interactive users
500. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
Time-sharing
Preemptive scheduling
Spooling
Multiprogramming
501. Inter-process communication can be done through ______.
Mail
System calls
Messages
Traps
502. In Priority Scheduling, a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of starvation (low priority processes may never execute) is resolved by ______.
Terminating the process
Mutual Exclusion
Aging
Semaphore
503. CPU performance is measured through ______.
Throughput
Flops
MHz
None of the above
504. PCB = ______.
Program Control Block
Process Communication Block
Process Control Block
None of the above
505. Software is a program that directs the overall operation of the computer, facilitates its use, and interacts with the user. What are the different types of this software?
Operating system
Utilities
Language Compiler
All of the above
506. A ______ is software that manages the time of a microprocessor to ensure that all time-critical events are processed as efficiently as possible. This software allows the system activities to be divided into multiple independent elements called tasks.
Kernel
Processor
Shells
Device Driver
507. The primary job of the operating system of a computer is to ______.
Command Resources
Provide Utilities
Manage Resources
Be user-friendly
508. With the round-robin CPU scheduling in a time-shared system ______.
Using very large time slices degenerates into the first-come-first-served algorithm
Using extremely small time slices improves performance
Using extremely small time slices degenerates into the last-in-first-out algorithm
Using medium-sized time slices leads to the shortest request time first algorithm
509. Which of the following is a criterion to evaluate a scheduling algorithm?
CPU Utilization: Keep CPU utilization as high as possible
Throughput: Number of processes completed per unit time
Waiting Time: Amount of time spent ready to run but not running
All of the above
510. Which of the following is contained in Process Control Block (PCB)?
Process Number
Memory Limits
List of Open Files
All of the Above
511. Supercomputers typically employ ______.
Real-time Operating system
Desktop OS
Multiprocessors OS
None of the above
512. Round-robin scheduling is essentially ______ the preemptive version of ______.
FIFO
Shortest remaining
Shortest job first
Longest time first
513. A page fault occurs.
When the page is not in the memory
When the page is in the memory
When the process enters the blocked state
When the process is in the ready state
514. Which of the following will determine your choice of systems software for your computer?
Is the applications software you want to use compatible with it?
Is it expensive?
Is it compatible with your hardware?
Both (A) and (C)
515. Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements: wait(S); wait(Q); —; signal(S); signal(Q) and wait(Q); wait(S); —; signal(Q); signal(S); respectively. The above situation depicts a ______.
Semaphore
Signal
Deadlock
Interrupt
516. What is a shell?
It is a hardware component
It is a part in compiler
It is a command interpreter
It is a tool in CPU scheduling
517. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called ______.
Static loading
Dynamic linking
Dynamic loading
Overlays
518. In the blocked state:
The processes waiting for I/O are found
The process which is running is found
The processes waiting for the processor are found
None of the above
519. What is the memory from 1K - 640K called?
Extended Memory
Low Memory
Normal Memory
Conventional Memory
520. The process related to process control, file management, device management, information about system and communication that is requested by any higher-level language can be performed by ______.
Editors
System Call
Compilers
Caching
521. If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 67.
310
315
324
321
522. Multiprogramming systems ______.
Are easier to develop than single programming systems
Execute each job faster
Execute more jobs in the same time
Are used only on large mainframe computers
523. Which is not the state of the process?
Blocked
Ready
Running
Privileged
524. The solution to the Critical Section Problem is: Mutual Exclusion, Progress, and Bounded Waiting.
The statement is false
The statement is contradictory
The statement is true
None of the above
525. The problem of thrashing is affected significantly by ______.
Program structure
Primary storage size
Program size
None of the above
526. The state of a process after it encounters an I/O instruction is ______.
Ready
Idle
Blocked/Waiting
Running
527. The number of processes completed per unit time is known as ______.
Output
Efficiency
Throughput
Capacity
528. ______ is the situation in which a process is waiting on another process, which is also waiting on another process ... which is waiting on the first process. None of the processes involved in this circular wait are making progress.
Deadlock
Dormant
Starvation
None of the above
529. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
Time-sharing
Preemptive scheduling
Spooling
Multiprogramming
530. The mechanism that brings a page into memory only when it is needed is called ______.
Segmentation
Demand Paging
Fragmentation
Page Replacement
531. Switching the CPU to another Process requires saving the state of the old process and loading the new process state. This is called as ______.
Process Blocking
Time Sharing
Context Switch
None of the above
532. Which directory implementation is used in most Operating Systems?
Single level directory structure
Tree directory structure
Two level directory structure
Acyclic directory structures
533. The Banker’s algorithm is used:
To prevent deadlock in operating systems
To detect deadlock in operating systems
To rectify a deadlocked state
None of the above
534. A thread:
Is a lightweight process where the context switching is low
Is a lightweight process where the context switching is high
Is used to speed up paging
None of the above
535. ______ is a high-level abstraction over Semaphore.
Shared memory
Monitor
Message passing
Mutual exclusion
536. A tree-structured file directory system ______.
Allows easy storage and retrieval of file names
Is a much-debated unnecessary feature
Is not essential when we have millions of files
None of the above
537. Translator for low-level programming language were termed as:
Assembler
Linker
Compiler
Loader
538. Analysis which determines the meaning of a statement once its grammatical structure becomes known is termed as:
Semantic analysis
Regular analysis
Syntax analysis
General analysis
539. Load address for the first word of the program is called:
Linker address origin
Phase library
Load address origin
Absolute library
540. Symbolic names can be associated with:
Information
Operand
Data or instruction
Mnemonic operation
541. The translator which performs macro expansion is called a:
Macro processor
Micro pre-processor
Macro pre-processor
Assembler
542. Shell is the exclusive feature of:
UNIX
System software
DOS
Application software
543. A program in execution is called:
Process
Procedure
Instruction
Function
544. Interval between the time of submission and completion of the job is called:
Waiting time
Throughput
Turnaround time
Response time
545. A scheduler which selects processes from secondary storage device is called:
Short-term scheduler
Medium-term scheduler
Long-term scheduler
Process scheduler
546. The scheduling in which CPU is allocated to the process with the least CPU-burst time is called:
Priority Scheduling
Round Robin Scheduling
Shortest job-first Scheduling
Multilevel Queue Scheduling
547. The term ‘page traffic’ describes:
Number of pages in memory at a given instant
Number of papers required to be brought in at a given page request
The movement of pages in and out of memory
Number of pages of executing programs loaded in memory
548. The “turn-around” time of a user job is the:
Time since its submission to the time its results become available
Time duration for which the CPU is allotted to the job
Total time taken to execute the job
Time taken for the job to move from assembly phase to completion phase
549. Which of the following can be used as a criterion for classification of data structures used in language processing?
Nature of a data structure
Lifetime of a data structure
Purpose of a data structure
All of the above
550. Memory utilization factor shall be computed as follows:
Memory in use/allocated memory
Memory in use/total memory connected
Memory allocated/free existing memory
Memory committed/total memory available
550. Memory utilization factor shall be computed as follows:
Memory in use/allocated memory
Memory in use/total memory connected
Memory allocated/free existing memory
Memory committed/total memory available
Last updated