VU Final Term Past Papers
273 solved final term past paper MCQs for CS604 (Operating Systems) at Virtual University, each with the correct answer marked. Use them to learn the VU question style and test your recall. An independent study tool — not affiliated with VU.
Prefer a summary first? Read the CS604 final term handout.
Q1. A ________ (or an exception) is a software-generated interrupt caused either by an error (division by zero or invalid memory access) or by a user request for an operating system service.
Q2. Which register holds the smallest legal physical memory address for a process?
Q3. The process of switching from one process to another is called -----------------
Q4. The --------------semaphore provides mutual exclusion for accesses to the buffer pool and is initialized to the value 1.
Q5. Binary semaphores are those that have only two values---------
Q6. Addresses generated relative to part of program, not to start of physical memory are
Q7. Object files and libraries are combined by a ------------- program to produce the executable binary
Q8. Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
Q9. A page table needed for keeping track of pages of the page table is called --------------
Q10. 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.
Q11. Each page is a power of -------- bytes long in paging scheme.
Q12. _______ is a way to establish a connection between the file to be shared and the directory entries of the users who want to have aces to this file.
Q13. When a _____link is created, a directory entry for the existing file is created
Q14. The ___________ method requires each file to occupy a set of contiguous blocks on the disk.
Q15. Which part of the computer system helps in managing the file and memory management system?
Q16. Wrong use of wait and signal operations (in context with semaphores) can cause____ problem(s).
Q17. If a system is not in a safe state, there can be no deadlocks.
Q18. 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 ___________.
Q19. In _____________ page replace algorithm we will replace the page that has not been used for the longest period of time.
Q20. Overlays are implemented by the _________________
Q21. An acyclic graph does not allow directories to have shared subdirectories and files.
Q22. The size of pages and frames are same in logical memory and physical memory respectively.
Q23. 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 ______.
Q24. In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
Q25. Intel is basically designed for following Operating Systems except __________.
Q26. The execution of critical sections must NOT be mutually exclusive
Q27. The bottom layer in the layered approach of Operating System is-----------
Q28. You can display the contents (names of files and directories) of a directory in UNIX/Linux directory structure with the --------------- command.
Q29. ------------- spend more time doing IO than computations
Q30. ------------buffer places no practical limit on the size of the buffer
Q31. With ----------you use condition variables.
Q32. Deadlocks can be described more precisely in terms of a directed graph called a system ----------
Q33. The integer value of _________ semaphores can not be greater than 1.
Q34. Starvation is infinite blocking caused due to unavailability of resources.
Q35. The set of all physical addresses corresponding to the logical addresses is a ---------------- of the process
Q36. ---------------- indicates size of the page table
Q37. If validation bit is 0, it indicates a/an --------- state of segment.
Q38. In ______ allocation scheme free frames are equally divided among processes
Q39. Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
Q40. ________ is used to store data on secondary storage device, e.g., a source program(in C), an executable program.
Q41. The basic purpose of ________________is to help the users to utilize the hardware resources for completing different tasks in a simplified manner
Q42. User mode can run the Privileged instructions
Q43. _______________ wastes CPU cycles and hence is a problem in real multiprogramming system.
Q44. The __________________ requires that no reader will be kept waiting unless a writer has already obtained permission to use the shared object.
Q45. The process of holding at least one resource and waiting to acquire additional resources that are currently being held by other processes is known as_______.
Q46. The condition where a set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set, is termed as ________.
Q47. Banker’s algorithm is used for ________________
Q48. The ________ requires that once a writer is ready, that writer performs its write as soon as possible , if a writer waiting to access the object, no new readers may start reading.
Q49. Which command, Display permissions and some other attributes for prog1.c in your current directory?
Q50. In the C-Scan and C-Look algorithms, when the disk head reverses its direction, it moves all the way to the other end, without serving any requests, and then reverses again and starts serving requests.
Q51. In paged segmentation, we divide every segment in a process into __________pages.
Q52. Intel 80386 used paged segmentation with _________ level paging.
Q53. The logical address of Intel 80386 is _________
Q54. The Swap instruction which is the hardware solution to synchronization problem does not satisfy the ________ condition, hence not considered to be a good solution.
Q55. The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.
Q56. __________ integer shows the highest priority of a process in CPU scheduling
Q57. The priority of a process can be changed using ___________ command.
Q58. The integer value of ________semaphores can range over an unrestricted integer domain.
Q59. _____________ is a preemptive scheduling algorithm.
Q60. _____________ algorithm is used for solving n-process critical section problem.
Q61. Batch programs are usually _________ programs.
Q62. Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
Q63. A condition where a set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set is termed as ________.
Q64. A semaphore that cause Busy-Waiting is termed as ___________.
Q65. In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
Q66. _________ command to resume the execution of a suspended job in the foreground
Q67. __________ commands in Linux is used to copy file
Q68. The process id returned to the child process after successful fork system call execution is _____________.
Q69. In ________addressing, the recipient is not required to name the sender.
Q70. A solution to the critical section problem must satisfy the following requirements
Q71. Typically the execlp system call is used after a fork system call.
Q72. You can create a threads by using the pthread_create call.
Q73. The interval from the time of submission to the time of completion is the ______
Q74. Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____
Q75. IPC provides a mechanism to allow processes to communicate and to synchronize their actions without sharing the same__________
Q76. Linux is a version of _______ operating system.
Q77. Current working directory can be accessed using --------- Command.
Q78. Mkfifo is a _______.
Q79. ____ command gives a snapshot of the current processes.
Q80. Time interval when the I/O Devices are accessed is known as --------.
Q81. __________ directory includes essential system boot files including the kernel image.
Q82. ________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
Q83. A program in execution is called a _______________.
Q84. The manual pages can be read in Linux using ____ command.
Q85. The hardware mechanism that enables a device to notify CPU is called an -------------
Q86. The -------------- system call suspends the calling process.
Q87. You can use the ------------- command to display the status of suspended and background processes
Q88. You can terminate a foreground process by pressing --------------
Q89. A time sharing system is
Q90. The main characteristic of a Real time system is
Q91. Shared libraries and kernel modules are stored in directory
Q92. ______scheduler selects the process from the job pool and put them in main memory.
Q93. In indirect inter process communication, a sender_____mention the name of the recipient.
Q94. The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
Q95. _______ is also called Swapper.
Q96. Linux OS can support multiple users at a time
Q97. The Operating system is a layer of software between _________ and ___________.
Q98. The major advantage of multi-programming system is
Q99. Command-line interpreter is also called __________ in some operating systems.
Q100. I/O instructions are Privileged Instructions.
Q101. In Linux directory structure, there is ___________ root directory.
Q102. Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in _____________ directory.
Q103. Taking the CPU from one process and giving the CPU to another process is termed as
Q104. Bounded Buffer is a buffer of ____________ size
Q105. In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
Q106. If the fork system call fails, it returns
Q107. When a process opens its first file explicitly it will get descriptor number _________
Q108. I MB or 1 megabyte is equivalent to----
Q109. ------------has a hierarchical file system structure.
Q110. You can use the ---------command in UNIX to create a directory.
Q111. Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
Q112. The creating process is called a--------------- process while the new processes are called the -------------- of that process
Q113. The _______ are used for communication between related or unrelated processes on the same system or unrelated processes on different systems.
Q114. A_____ is an abstract key for accessing a file.
Q115. You can display all of the signals supported by your system, along with their numbers, by using the ----------- command
Q116. The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
Q117. First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
Q118. The Shortest-Job-First Scheduling algorithm can be
Q119. Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
Q120. OS helps manages the following except
Showing the first 120 of 273 MCQs.