Q1. To access the services of operating system, the interface is provided by the:
(a) system calls
(b) API
(c) library
(d) assembly instructions
(e) none of the above
Q2. Which one of the following is not true?
(a) kernel is the program that constitutes the central core of the operating system
(b) kernel is the first part of operating system to load into memory during booting
(c) kernel is made of various modules which can not be loaded in running operating system
(d) kernel remains in the memory during the entire computer session
(e) all are correct
Q3. By operating system, the resource management can be done via:
(a) time division multiplexing
(b) space division multiplexing
(c) both (a) and (b)
(d) none of the mentioned
(e) code division multiplexing
Q4. In operating system, each process has its own :
(a) address space and global variables
(b) open files
(c) pending alarms, signals and signal handlers
(d) all of the mentioned
(e) none of the above
Q5. What is the ready state of a process?
(a) when process is scheduled to run after some execution
(b) when process is unable to run until some task has been completed
(c) when process is using the CPU
(d) none of the mentioned
(e) all of the above
Q6. A process stack does not contain which of the following?
(a) function parameters
(b) local variables
(c) return addresses
(d) PID of child process
(e) all of the above
Q7. The address of the next instruction to be executed by the current process is provided by the:
(a) CPU registers
(b) program counter
(c) process stack
(d) pipe
(e) all of the above.
Q8. A Process Control Block(PCB) does not contain which of the following :
(a) Code
(b) Stack
(c) Heap
(d) bootstrap program
(e) Program Counter
Q9. The Process Control Block is :
(a) Process type variable
(b) Data Structure
(c) a secondary storage section
(d) a Block in memory
(e) none of the above
Q10. The objective of multi-programming is to :
(a) Have some process running at all times
(b) Have multiple programs waiting in a queue ready to run
(c) To minimize CPU utilization
(d) To maximize CPU utilization
(e) Both (a) and (d)
Q11. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called _____.
(a) job queue
(b) ready queue
(c) execution queue
(d) process queue
(e) priority queue
Q12. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
(a) first-come, first-served scheduling
(b) shortest job scheduling
(c) priority scheduling
(d) none of the mentioned
(e) last in last our scheduling
Q13. Time quantum is defined in:
(a) shortest job scheduling algorithm
(b) round robin scheduling algorithm
(c) priority scheduling algorithm
(d) multilevel queue scheduling algorithm
(e) all of the above
Q14. Which one of the following can not be scheduled by the kernel?
(a) kernel level thread
(b) user level thread
(c) process
(d) none of the mentioned
(e) kernel can schedule each thread
Q15. CPU scheduling is the basis of ____________.
(a) multiprocessor systems
(b) multiprogramming operating systems
(c) larger memory sized systems
(d) None of these
(e) all of the above
