CS604 Midterm Online Quiz

0%

CS604-Midterm

1 / 50

The returned code to the child process after successful fork system call execution is

2 / 50

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

3 / 50

A Process that has finished working, as well as its parent process has also finished its execution. In this state the process A will be called as _________ process.

4 / 50

This condition is known as ______________.  

5 / 50

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

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

7 / 50

/opt is used for storage of large applications.

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

9 / 50

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

10 / 50

Which of the Following is not an Operating System.

11 / 50

A process consists of __________

12 / 50

____ command gives a snapshot of the current processes.

13 / 50

Which part of the computer system helps in managing the file and memory management system?

14 / 50

The hardware mechanism that enables a device to notify CPU is called an -------------

15 / 50

Batch programs are usually _________ programs.

16 / 50

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

17 / 50

A time sharing system is

18 / 50

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

19 / 50

Cache is non-volatile memory.

20 / 50

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

21 / 50

A_______ is an integer variable that, apart from initialization is accessible only through two standard atomic operations: wait and signal.

22 / 50

Hardware provide basic computing resource.

23 / 50

n-process critical section problem can be solved by using

24 / 50

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

25 / 50

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

26 / 50

_____________ is a preemptive scheduling algorithm.

27 / 50

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

28 / 50

You can use the rm file1 command to __________ file1

29 / 50

Managing Secondary Storage Involves all of the Following except

30 / 50

You can display the contents (names of files and directories) of a directory in UNIX/Linux directory structure with the --------------- command.

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

32 / 50

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

33 / 50

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

34 / 50

In indirect inter process communication, a sender ________ mention the name of the recipient.

35 / 50

The critical section problem can be solved by the following except

36 / 50

Starvation is infinite blocking caused due to unavailability of resources.

37 / 50

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

38 / 50

A ---------------- (or an exception) is a software-generated interrupt caused either by an error (division by zero or invalid memory access) or by a user request for an operating system service.

39 / 50

____ is a virtual directory in Linux and Unix.

40 / 50

Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in _____________ directory.

41 / 50

Command-line interpreter is also called __________ in some operating systems.

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

43 / 50

The basic purpose of ________________is to help the users to utilize the hardware resources for completing different tasks in a simplified manner

44 / 50

___________ algorithm is used in Deadlock avoidance.

45 / 50

The nice value helps in assigning ______ to a process.

46 / 50

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

47 / 50

A pathname is the list of directories separated by _________.

48 / 50

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

49 / 50

Linux Treats Devices as Files.

50 / 50

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

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