CS604 Midterm Online Quiz

0%

CS604-Midterm

1 / 50

A semaphore that cause Busy-Waiting is termed as .

2 / 50

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.

3 / 50

The Home Directory for superuser in Linux and Unix is

4 / 50

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

5 / 50

The execution of critical sections must NOT be mutually exclusive

6 / 50

You can use the ---------command in UNIX to create a directory.

7 / 50

_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.

8 / 50

Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .

9 / 50

All threads within a process share the ________ address space.

10 / 50

Starvation is infinite blocking caused due to unavailability of resources.

11 / 50

Taking the CPU from one process and giving the CPU to another process is termed as

12 / 50

A pathname is the list of directories separated by _________.

13 / 50

Database, Complier, Video games are examples of ________.

14 / 50

POSIX is a standard developed by ANSI

15 / 50

__________ integer shows the highest priority of a process in CPU scheduling

16 / 50

The major advantage of multi-programming system is

17 / 50

Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------

18 / 50

Each page is a power of -------- bytes long in paging scheme.

19 / 50

n-process critical section problem can be solved by using

20 / 50

OS helps manages the following except

21 / 50

User Goal of OS is that It easy to use, reliable, safe and fast.

22 / 50

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.

23 / 50

Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.

24 / 50

If the fork system call fails, it returns

25 / 50

In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.

26 / 50

Using _________system, we can create a new process in Linux.

27 / 50

__________ displays information about the top processes.

28 / 50

If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.

29 / 50

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

30 / 50

The -------------- system call suspends the calling process.

31 / 50

____ is a virtual directory in Linux and Unix.

32 / 50

In Layered approach of OS, Lowest Layer is known as ________.

33 / 50

Banker‟s algorithm is used for ________________

34 / 50

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

35 / 50

 

IPC provides a mechanism to allow processes to communicate and to synchronize their actions without sharing the same__________

36 / 50

________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.

37 / 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.

38 / 50

Operating System is the Manager of Hardware Resources.

39 / 50

You can create a threads by using the pthread_create() call.

40 / 50

Kernel is responsible for scheduling the user level threads.

41 / 50

Operating system enables the user to use the Hardware Resources.

42 / 50

____ command display the status of a process.

43 / 50

The main characteristic of a Real time system is

44 / 50

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

45 / 50

The nice value helps in assigning ______ to a process.

46 / 50

The critical section problem can be solved by the following except

47 / 50

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

48 / 50

The bottom layer in the layered approach of Operating System is-----------

49 / 50

A semaphore that cause Busy-Waiting is termed as ___________.

50 / 50

A time sharing system is

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