CS604 Midterm Online Quiz

0%

CS604-Midterm

1 / 50

__________ directory includes essential system boot files including the kernel image.

2 / 50

rm and [r]mkdir commands are used to _____________ directory.

3 / 50

Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.

4 / 50

When a process opens its first file explicitly it will get descriptor number _________

5 / 50

If a system is not in a safe state, there can be No deadlocks.

6 / 50

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

7 / 50

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

8 / 50

The nice value helps in assigning ______ to a process.

9 / 50

Managing Secondary Storage Involves all of the Following except

10 / 50

Banker‟s algorithm is used for ________________

11 / 50

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

12 / 50

The critical section problem can be solved by the following except

13 / 50

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

14 / 50

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

15 / 50

A process consists of __________

16 / 50

Which register holds the smallest legal physical memory address for a process?

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

________________ is an integer variable accessible through wait and signal which are atomic operations.

21 / 50

A major problem with priority scheduling algorithms is ______.

22 / 50

Which of the Following is not an Operating System.

23 / 50

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

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

25 / 50

The Operating system is a layer of software between _________ and ___________.

26 / 50

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

27 / 50

Which of the following is correct definition for wait operation?

28 / 50

Starvation is infinite blocking caused due to unavailability of resources.

29 / 50

Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.

30 / 50

The following requirement for solving critical section problem is known as ______. “There exists a bound on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted.”

31 / 50

Hardware provide basic computing resource.

32 / 50

A dashed line is used to represent a _________ in Resource Allocation Graph.

33 / 50

A time sharing system is

34 / 50

In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________

35 / 50

Linux is a version of _______ operating system.

36 / 50

I/O instructions are Privileged Instructions.

37 / 50

command displays the contents of current working directory.

38 / 50

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

39 / 50

You can terminate a foreground process by pressing --------------

40 / 50

Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.

41 / 50

You can display all of the signals supported by your system, along with their numbers, by using the -----------command

42 / 50

___________ is used in real time operating systems.

43 / 50

The critical section problem can be solved by the following except

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

45 / 50

copy file1 file2 is an example of ______ OS view.

46 / 50

 

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

47 / 50

The interval from the time of submission to the time of completion is the ______

48 / 50

An absolute pathname starts with the root directory (/) and a relative pathname starts with your home directory.

49 / 50

A system call________

50 / 50

The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.

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