2BSCIT
Operating System
Full mark: 100
Group A
(Each question carries 1 mark)1. Multitasking is the logical extensions of ------
i). multiprogramming
ii). multithreading
iii). multicasting
iv). multiprocessing
2. Program is a ---
i). Passive entity
ii). Active entity
iii). Job Scheduling
iv). CPU Scheduling
3. A process is a program that performs a --- execution.
i). multi-thread
ii). single thread
iii). process state
iv). cpu scheduling
4. The state of the process is defined as …………..
i). The past activities of the process
ii). Partly activities of that process
iii). The current activity of that process
iv). Past condition of that process
5. The processes which needed an input & output devices to display the result are kept inside the ……
i). I/O queue
ii). Device queue
iii). Ready queue
iv). I/O request
6. CPU bound is defines as ……………
i). A process that uses more CPU time for doing IO
ii). A process that uses more CPU time for doing computation
iii). A process that uses equal CPU time for doing IO & computation
iv). All of the above
7. A process is defined as ……………..
i). A process to begin
ii). A program in execution
iii). A program to update
iv). A program in middle
8. Producer, consumer relationship is the ……………..
i). Software solution to the semaphore
ii). Hardware solution to the semaphore
iii). Software solution to the mutual exclusion
iv). Hardware solution to the mutual exclusion
9. The process is waiting for some event to occur is refers a …………..
i). New born state
ii). Waiting state
iii). Running state
iv). Ready state
10. Which is not a function of an operating system?
i). Job management
ii). Device management
iii). Security
iv). All of the above
11. The fundamental goal of an operating system is ……………..
i). To run hardware
ii). To execute user programs
iii). To run software
iv). None of the above
12. Spooling provides an important ………….
i). Data structure called ready queue
ii). Data structure called job pool
iii). Data structure called I/O queue
iv). All of the above
13. Assigning a value to the variables used in a semaphore is known as …………
i). Counting semaphore
ii). Initializing Semaphore
iii). General semaphore
iv). Binary semaphore
Group B
(Each question carries 2 marks)
14. Mainly time sharing environment is used to ……………
i). Provide interactive use of the computer
ii). Reduce the costs of the computer
iii). Allow the many users to share the resources
iv). Share the computer simultaneously
v). All of the above
15. A time sharing operating system …………
i). Allows the single user to share the computer simultaneously
ii). Allows the many users to share the computer simultaneously
iii). Allows the many users not to share the computer simultaneously
iv). Allows the many users to share the resources simultaneously
16. The process termination refers to ………….
i). Finish the execution of the first statement
ii). Finish the execution of the last statement
iii). Finish the execution of the mid last statement
iv). All of the above
17. Scheduler is mechanism on which…………….
i). The process will loaded into the CPU
ii). The selected process carries out
iii). Choose the process form ready queue
iv). All of the above
18. In multiprogramming environment, CPU switches from one process to another to achieve multitasking. At that time the process needs to save its state before switching takes place. Such type of process mechanism is known as …………
i). Process creation
ii). CPU scheduling
iii). Context switch
iv). Throughput
19. Semaphore is a ……………..
i). Constant variable
ii). Static variables
iii). Protected variable
iv). Private variable
20. There are two types of process i.e. independent and co-operating process. A process is independent if…..
i). It can be affected by the other processes
ii). It can't affect or affected by the other processes
iii). It can affect or affected by the other processes
iv). All of the above
21. P & V operation of the semaphore can ……… the values of the variables of the semaphore.
i). Copy & paste
ii). Run & move
iii). Access & alter
iv). Edit & delete
22. Dekker’s algorithm is the ……..
i). Software solution to the mutual exclusion
ii). Hardware solution to the mutual exclusion
iii). Software solution to the un-mutual exclusion
iv). Software solution to the producer, consumer relationship
Group C (Each question carries 4 marks)
23. When a process creates a new process, two possibilities exist in terms of execution. They are:
i). The parent continues its execution concurrently with its children.
ii). Parents can terminate its execution with out terminating its children.
iii). The parent waits until some or all of its children have terminated.
iv). All of the above
24. PCB contains many pieces of information associated with a specific process including …………..
i). CPU scheduling information & CPU registers
ii). I/O status & memory management information
iii). Accounting information & program counter
iv). Process state, pointer, process ID
v). All of the above
vi). None of the above
25. Generally CPU can't handle more then one process at a time but in time sharing system more then one process can enter into a CPU and execute. In this situation a type of relationship is maintain between the processes which is known as ……………
i). Producer consumer relationship
ii). Consumer producer relationship
iii). Mutual exclusion
iv). Synchronous communication
26. Each process has a segment of code, called a …………, in which the process may be changing common variables, updating a table, writing a file, and so on.
i). Mutual exclusion
ii). Critical section
iii). Critical region
iv). Process coordination
27. A solution to the critical section problem must satisfy the following three conditions. They are:
i). Mutual exclusion, progress, unbounded buffer
ii). Mutual exclusion, progress, bounded waiting
iii). Mutual exclusion, circular wait, bounded waiting
iv). Mutual exclusion, hold & wait, unbounded buffer
Group D
Each question carries 7 marks.
28. What is an operating system? Explain its functions.
29. Describe the time sharing system.
30. Explain the real time system
31. Explain spooling Concepts with its block diagram.
32. Draw a transition diagram of process states and explain each of them.
33. Define process control block.
34. Explain semaphore.
0 Comments