OS OBJECTIVE For Students-1

1.
If a process fails, most operating system write the error information to a

______
a) new file b) another running process c) log file d) none of the

mentioned
2. The FCFS algorithm is particularly troublesome for ____________
a) operating systems b) multiprocessor systems

c) time sharing systems d) multi programming systems
3. For an effective operating system, when to check for deadlock?
a) every time a resource request is made at fixed time intervals

b) at fixed time intervals c) every time a resource request is made d)
none
4. Which one of the following is a real time operating system?

a) Windows CE b) RTLinux c) VxWorks d) All of the mentioned
5. On systems where there are multiple operating system, the decision to load
a particular one is done by _____________
a) process control block b) file control block c) boot loader d)

bootstrap
6. What are the types of distributed operating systems?
a) Zone based Operating system b) Level based Operating system

c) Network Operating system d) All of the mentioned
7. In Unix, Which system call creates the new process?

a) fork b) create c) new d) none of the mentioned
8 The entry of all the PCBs of the current processes is in __________
a) Process Register b) Program Counter

c) Process Table d) Process Unit
9 A single thread of control allows the process to perform __________

a) only one task at a time b) multiple tasks at a time
c) only two tasks at a time d) all of the mentioned
10. Which process can be affected by other processes executing in the
system?
a) cooperating process b) child process

c) parent process d) init process
11. What are the types of distributed operating systems?
a) Zone based Operating system b) Level based Operating system

c) Network Operating system d) All of the mentioned
12. In Unix, Which system call creates the new process?

b) fork b) create c) new d) none of the mentioned
13. The entry of all the PCBs of the current processes is in __________
a) Process Register b) Program Counter

c) Process Table d) Process Unit
14. A single thread of control allows the process to perform __________

a) only one task at a time b) multiple tasks at a time
c) only two tasks at a time d) all of the mentioned
15. Which process can be affected by other processes executing in the system?
a) cooperating process b) child process

c) parent process d) init process
16. If a process fails, most operating system write the error information to a ______
a) new file b) another running process c) log file d) none of the

mentioned
17. The FCFS algorithm is particularly troublesome for ____________
a) operating systems b) multiprocessor systems

c) time sharing systems d) multi programming systems
18. For an effective operating system, when to check for deadlock?
a) every time a resource request is made at fixed time intervals

b) at fixed time intervals c) every time a resource request is made d) none
19. Which one of the following is a real time operating system?

a) Windows CE b) RTLinux c) VxWorks d) All of the mentioned
20. On systems where there are multiple operating system, the decision to load a
particular one is done by _____________
a) process control block b) file control block c) boot loader d) bootstrap

II Fill in the blanks
1. In priority scheduling algorithm, when a process arrives at the ready queue, its
priority is compared with the priority of ____________
2. The real difficulty with SJF in short term scheduling is ____________
3. When several processes access the same data concurrently and the outcome of the
execution depends on the particular order in which the access takes place is called
________
4. The address of the next instruction to be executed by the current process is

provided by the ____
5. To access the services of the operating system, the interface is provided by the
___________
6. When a process is in a “Blocked” state waiting for some I/O service. When the
service is completed, it goes to the _________
7. A deadlock avoidance algorithm dynamically examines the __________ to ensure
that a circular wait condition can never exist.
8. For real time operating systems, interrupt latency should be ____________
9. The child process completes execution, but the parent keeps executing, then the
child process is known as __________
10. The interval from the time of submission of a process to the time of completion is
termed as ____________
11. To access the services of the operating system, the interface is provided by the
___________
12. When a process is in a “Blocked” state waiting for some I/O service. When
the service is completed, it goes to the __________
13. A deadlock avoidance algorithm dynamically examines the __________ to
ensure that a circular wait condition can never exist.
14. For real time operating systems, interrupt latency should be ____________
15. The child process completes execution, but the parent keeps executing, then the
child process is known as __________
16. The interval from the time of submission of a process to the time of completion
is termed as ____________
17. In priority scheduling algorithm, when a process arrives at the ready queue, its
priority is compared with the priority of ____________
18. The real difficulty with SJF in short term scheduling is ____________
19. When several processes access the same data concurrently and the outcome of
the execution depends on the particular order in which the access takes place is
called ________
20.The address of the next instruction to be executed by the current process is

provided by the ____

OS OBJECTIVE For Students-1

Uploaded by

Copyright:

Available Formats

OS OBJECTIVE For Students-1

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

OS OBJECTIVE For Students-1

Uploaded by

Copyright:

Available Formats

1.

If a process fails, most operating system write the error information to a

a) new file b) another running process c) log file d) none of the

2. The FCFS algorithm is particularly troublesome for ____________

a) operating systems b) multiprocessor systems

3. For an effective operating system, when to check for deadlock?

a) every time a resource request is made at fixed time intervals

4. Which one of the following is a real time operating system?

a) process control block b) file control block c) boot loader d)

6. What are the types of distributed operating systems?

a) Zone based Operating system b) Level based Operating system

7. In Unix, Which system call creates the new process?

8 The entry of all the PCBs of the current processes is in __________

a) Process Register b) Program Counter

9 A single thread of control allows the process to perform __________

a) cooperating process b) child process

a) Zone based Operating system b) Level based Operating system

12. In Unix, Which system call creates the new process?

a) Process Register b) Program Counter

14. A single thread of control allows the process to perform __________

a) cooperating process b) child process

a) new file b) another running process c) log file d) none of the

17. The FCFS algorithm is particularly troublesome for ____________

a) operating systems b) multiprocessor systems

18. For an effective operating system, when to check for deadlock?

a) every time a resource request is made at fixed time intervals

19. Which one of the following is a real time operating system?

a) process control block b) file control block c) boot loader d) bootstrap

priority is compared with the priority of ____________

2. The real difficulty with SJF in short term scheduling is ____________

4. The address of the next instruction to be executed by the current process is

service is completed, it goes to the _________

7. A deadlock avoidance algorithm dynamically examines the __________ to ensure

that a circular wait condition can never exist.

8. For real time operating systems, interrupt latency should be ____________

child process is known as __________

13. A deadlock avoidance algorithm dynamically examines the __________ to

ensure that a circular wait condition can never exist.

child process is known as __________

priority is compared with the priority of ____________

20.The address of the next instruction to be executed by the current process is

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.