CS604 Midterm Online Quiz

0%

CS604-Midterm

1 / 50

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

2 / 50

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

3 / 50

Linux uses ___________ directory to store system configuration files.

4 / 50

The procedure “The time at which the process finished working MINUS the arrival time of the process MINUS CPU burst for that process” will help calculate the _________.

5 / 50

Database, Complier, Video games are examples of ________.

6 / 50

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

7 / 50

The Home Directory for superuser in Linux and Unix is

8 / 50

I/O instructions are Privileged Instructions.

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

10 / 50

________ determines What will be done.

11 / 50

The process of switching from one process to another is called latency.

12 / 50

Binary semaphores are those that have only two values---------

13 / 50

The scheduling of ______ are done by the operating system.

14 / 50

The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.

15 / 50

The creating process is called a--------------- process while the new processes are called the -------------- of that process

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

17 / 50

Which of the following is NOT a Hardware Resource.

18 / 50

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

19 / 50

A major problem with priority scheduling algorithms is ______.

20 / 50

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

21 / 50

Mkfifo() is a _______.

22 / 50

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

23 / 50

A solution to the critical section problem must satisfy the following requirements

24 / 50

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

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

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

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

30 / 50

You can use the rm file1 command to __________ file1

31 / 50

_______ is also called Swapper.

32 / 50

------------has a hierarchical file system structure.

33 / 50

The main characteristic of a Real time system is

34 / 50

Cooperating processes never share any data, code, memory or state.

35 / 50

Banker‟s algorithm is used for ________________

36 / 50

The nice value helps in assigning ______ to a process.

37 / 50

DOS is single user operating system.

38 / 50

A_____ is an abstract key for accessing a file.

39 / 50

In Linux directory structure, there is ___________ root directory.

40 / 50

Kernel is responsible for scheduling the user level threads.

41 / 50

The execution of critical sections must NOT be mutually exclusive

42 / 50

OS helps manages the following except

43 / 50

A semaphore that cause Busy-Waiting is termed as .

44 / 50

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

45 / 50

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

46 / 50

/usr/X11R6 is used by the X Window System.

47 / 50

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

48 / 50

___________ is used in real time operating systems.

49 / 50

Linux Treats Devices as Files.

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

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