CS604 Midterm Online Quiz

0%

CS604-Midterm

1 / 50

_____________ determines How to do something.

2 / 50

_________ command to resume the execution of a suspended job in the foreground

3 / 50

A parent process calling __________ system call will be suspended until children process terminates.

4 / 50

Linux uses ___________ directory to store system configuration files.

5 / 50

If the system can allocate resources to each process in some order and still avoid a deadlock then it said to be in ______ state.

6 / 50

In Unix/ Linux, by default the standard output file is attached to the ___________

7 / 50

Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.

8 / 50

Banker‟s algorithm is used for ________________

9 / 50

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 ________.

10 / 50

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________.  

11 / 50

Which of the Following is not an Operating System.

12 / 50

A time sharing system is

13 / 50

Managing Secondary Storage Involves all of the Following except

14 / 50

POSIX is a standard developed by ANSI

15 / 50

_________buffer places no practical limit on the size of the buffer

16 / 50

In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.

17 / 50

_____ system call is used to write to a file or FIFO or any other IPC channel.

18 / 50

n-process critical section problem can be solved by using

19 / 50

_________________ scheduling allows a process to move between queues.

20 / 50

An operating system is a control program that manages the execution of user programs to prevent errors and improper use of a computer.

21 / 50

Operating system enables the user to use the Hardware Resources.

22 / 50

The critical section problem can be solved by the following except

23 / 50

The time it takes for the dispatcher to stop one process and start another running is known as the-----------.

24 / 50

If the fork system call fails, it returns

25 / 50

User mode can run the Privileged instructions.

26 / 50

A process is said to be in critical section if it executes code that manipulates shared data

27 / 50

OS helps manages the following except

28 / 50

-------- command gives a snapshot of the current processes.

29 / 50

The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.

30 / 50

Shared libraries and kernel modules are stored in directory

31 / 50

___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).

32 / 50

In Layered Approach of OS, the Layer highest Layer is User Interface layer.

33 / 50

Linux is a version of _______ operating system.

34 / 50

______scheduler selects the process from the job pool and put them in main memory.

35 / 50

In Linux directory structure, there is ___________ root directory.

36 / 50

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 ________.

37 / 50

First-Come, First-Served (FCFS) is a --------------scheduling algorithm.

38 / 50

In ---------addressing; the recipient is not required to name the sender.

39 / 50

___________ is a solution to the problem of indefinite blockage of low-priority processes.

40 / 50

The Purpose of Operating System is to generate Executable Programs and to _______ them.

41 / 50

The Shortest-Job-First Scheduling algorithm can be

42 / 50

The execution of critical sections must NOT be mutually exclusive

43 / 50

Preventing a condition of ________ to happen, deadlocks can be prevented to happen.  

44 / 50

The main characteristic of a Real time system is

45 / 50

I/O instructions are Privileged Instructions.

46 / 50

___________ algorithm is used in Deadlock avoidance.

47 / 50

I MB or 1 megabyte is equivalent to----

48 / 50

A program in execution is called a _______________.

49 / 50

A system call________

50 / 50

First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.

Your score is

The average score is 36%

0%

Qunoot e Nazilah
Dua e Hajat
4 Qul
6 Kalma
Dua-e-Akasha
Darood Akbar
Surah Fatiha
Dua-e-Ganj Ul Arsh
Dua-e-Jamilah
Ayat-ul-Kursi