Question
DOS is a single user operating system.
- True
- False
Question
The major advantage of multi-programming system is
- More than one jobs can be processed at a given time
- CPU utilization can be increases
- Jobs can be completed quickly
- All of the given
Question
Linux OS can support multiple users at a time
- True
- False
Question
_________ command is used to change the directory.
- ls
- cp
- cd
- mv
Question
I/O instructions are Privileged instruction.
- True
- False
Question
The nice value helps in assigning ______ to a process.
- Priority
- Weight
- Time
- Scheduling
Question
Which part of the computer system helps in managing the file and memory management system?
- Operating System
- Device Drivers
- Application Software
- Hardware
Question
Physical memory is broken down into fixed-sized blocks, called ________ and Logical memory is divided into blocks of the same size, called _________.
- Frames, pages
- Pages, Frames
- Frames, holes
- Holes, segments
Question
The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a _________ address, and the address it gets translated to by the MMU is called a _________ address.
- Virtual, physical
- Hexadecimal, Binary
- Valid, invalid
- Physical, Virtual
Question
When a ________link is created, a directory entry for the existing file is created
- Soft
- None of the given
- Hard
- Soft or Hard
Question
If a system is not in a safe state, there can be no deadlocks.
- True
- False
Question
If a process continues to fault, replacing pages, for which it then faults and brings back in right away. This high paging activity is called _________.
- paging
- thrashing
- page fault
- CPU utilization
Question
An acyclic graph does not allow directories to have shared subdirectories and files.
- True
- False
Question
A modification of free-list approach in free space management is to store the addresses of n free blocks in the first free block, known as _________.
- counting
- linked list
- bit vector
- grouping
Question
Following is NOT true about Virtual memory.
- Virtual memory help in executing bigger programs even greater in size that of main memory.
- Virtual memory makes the processes to stuck when the collective size of all the processes becomes greater than the size of main memory.
- Virtual memory also allows files and memory to be shared by several different processes through page sharing.
- Virtual memory makes the task of programming easier because the programmer need not worry about the amount of physical memory.
Question
_________ indicates size of the page table.
- translation look-aside buffers
- Page-table length register (PTLR)
- Page-table base register (PTBR)
- Page offset
Question
If validation bit is 0, it indicates a/an ________ state of segment.
- protected
- shared
- legal
- illegal
Question
Which command display permissions and some other attributes for prog1.c in your current directory?
- ls –l prog1.c
- ls –d prog1.c
- ls file prog1.c
- ls –l prog1.c /Directory
Question
The logical address of Intel 80386 is _________.
- 36 bits
- 48 bits
- 64 bits
- 128 bits
Question
The main memory is usually divided into partitions, one for __________ and other for __________.
- Operating System, User processes
- Operating system, CPU
- Processes, Virtual Memory
- Base Register, Limit Register
Question
_________ keep in memory only those instructions and data that are needed at any given time.
- Fragmentation
- Paging
- Swapping
- Overlays
Question
In Swapping technique of Memory Management, the total amount transfer time is directly proportional to the ___________.
- amount of memory swapped
- amount of space on backing store
- space on main memory
- all the given options are correct
Question
The major criterion in the selection of a particular algorithm is that we want to ___________.
- minimize the number of page faults
- increase efficiency
- reduce running time of page replacement algorithm
- maximize the number of page faults
Question
A dashed line is used to represent a __________ in Resource Allocation Graph.
- Claim edge
- Request edge
- Assignment edge
- Allocation edge
Question
Banker’s algorithm is used for ___________.
- Deadlock avoidance
- Deadlock detection
- Deadlock prevention
- Deadlock removal
Question
_________ algorithm is used in Deadlock avoidance.
- Bakery
- Banker’s
- Mutual exclusion
- Safe Sequence
Question
The segment table maps the ___________ to physical addresses.
- Page addresses
- Shared page addresses
- One-dimensional logical addresses
- Two-dimensional logical addresses
Question
What do we name to an address that is loaded into the memory-address register of the memory?
- Logical address
- Physical address
- Binary addresses
- None of the given options
Question
Following is not the classical problem of synchronization.
- Bounded buffer problem
- Reader writer problem
- Dining philosophers problem
- Counting Semaphore problem
Question
When the address used in a program gets converted to an actual physical RAM address, it is called _________.
- Execution
- Loading
- Address Binding
- Compiling
Question
Address Binding will be at _______ in Multiprogramming with Fixed Tasks (MFT)
- Run time
- Load time
- Dynamic time
- None of the given options
Question
The condition in which a set {P0, P1… Pn} of waiting processes must exist such that P0 is waiting for a resource that is held by P1, P1 is waiting for a resource that is held by P2, and so on, Pn-1 is waiting for a resource held by Pn, and Pn is waiting for a resource held by P0. This condition is known as _________.
- Mutual exclusion
- Hold and wait
- No preemption
- Circular wait
Question
Deadlock detection and recovery technique is exactly similar to deadlock avoidance technique to handle deadlock in the system.
- True
- False
Question
The size of pages and frames are same in logical memory and physical memory respectively.
- True
- False
Question
Optimal Page Replacement Algorithm provides a benchmark in assessing other page replacement algorithms.
- True
- False
Question
To eliminate external fragmentation in segmentation the scheme used is __________.
- Fixed size partition scheme
- Variable size partition scheme
- Fixed size paging scheme
- Variable size paging scheme
Question
The process id returned to the child process after successful fork system call execution is __________.
- 0
- 1
- 2
- 3
Question
Shared libraries and kernel modules are stored in __________ directory.
- /bin
- /dev
- /boot
- /lib
Question
_________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.)
- Critical Analysis
- Critical Section
- Critical Path
- Critical Code
Question
Round Robin algorithm is similar to __________ scheduling but preemption is added to switch between processes.
- Shortest Job First
- Shortest Remaining Time First
- First Come First Serve
- None of these
Question
You can use the mv file1 file2 command to move __________.
- file1 to file2
- file2 to file1
- this command will not work for moving files
- None of the option is correct.
Question
A process is said to be in critical section if it executes code that manipulates shared data.
- True
- False
Question
When process opens its first file explicitly it will get descriptor number ________.
- 1
- 2
- 3
- 4
Question
A parent process calling _________ system call will be suspended until children process terminates.
- wait
- fork
- exit
- exec
Question
A solution to the critical section problem must satisfy the following requirements except
- Progress
- Mutual Exclusion
- Bounded Waiting
- Race Condition