CS604 Midterm Online Quiz

0%

CS604-Midterm

1 / 50

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

2 / 50

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

3 / 50

User mode can run the Privileged instructions.

4 / 50

You can use the ------------- command to display the status of suspended and background processes

5 / 50

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

6 / 50

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

7 / 50

The _______ are used for communication between related or unrelated processes on the same system or unrelated processes on different systems.

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

9 / 50

The Home Directory for superuser in Linux and Unix is

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

A semaphore that cause Busy-Waiting is termed as .

18 / 50

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

19 / 50

___________ algorithm is used in Deadlock avoidance.

20 / 50

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

21 / 50

Hardware provide basic computing resource.

22 / 50

The Shortest-Job-First Scheduling algorithm can be

23 / 50

You can use the rm file1 command to __________ file1

24 / 50

Time interval when the I/O Devices are accessed is known as --------.

25 / 50

This condition is known as ______________.  

26 / 50

Database, Complier, Video games are examples of ________.

27 / 50

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

28 / 50

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

29 / 50

_______ is also called Swapper.

30 / 50

A Process „A‟ that has finished working but its parent process has also finished its execution. In this state the process „A‟ will be called as _____ process.

31 / 50

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

32 / 50

Linux is a version of _______ operating system.

33 / 50

Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____

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

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

36 / 50

A time sharing system is

37 / 50

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

38 / 50

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

39 / 50

Bounded Buffer is a buffer of ____________ size

40 / 50

Cache is non-volatile memory.

41 / 50

__________ displays information about the top processes.

42 / 50

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

43 / 50

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

44 / 50

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

45 / 50

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

46 / 50

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

47 / 50

The critical section problem can be solved by the following except

48 / 50

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

49 / 50

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

50 / 50

If the fork system call fails, it returns

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