CS604 Midterm Online Quiz

0%

CS604-Midterm

1 / 50

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

2 / 50

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

3 / 50

__________ displays information about the top processes.

4 / 50

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

5 / 50

Operating system enables the user to use the Hardware Resources.

6 / 50

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

7 / 50

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

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

9 / 50

A process is said to be in critical section if it executes code that manipulates shared data

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

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

15 / 50

command displays the contents of current working directory.

16 / 50

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

17 / 50

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

18 / 50

This condition is known as ______________.  

19 / 50

______scheduler selects the process from the job pool and put them in main memory.

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

21 / 50

The nice value helps in assigning ______ to a process.

22 / 50

------------ register contains the size of the process

23 / 50

Operating System provides services such as Managing Primary and Secondary Storage, Processes and Allowing user to manage his/her files and directories.

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

n-process critical section problem can be solved by using

28 / 50

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

29 / 50

_____________ is a preemptive scheduling algorithm.

30 / 50

The Purpose of Operating System is to generate Executable Programs and to _______ them.

31 / 50

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

32 / 50

Current working directory can be accessed using --------- Command.

33 / 50

Linux is a version of _______ operating system.

34 / 50

Managing Secondary Storage Involves all of the Following except

35 / 50

___________ algorithm is used in Deadlock avoidance.

36 / 50

A time sharing system is

37 / 50

A system call________

38 / 50

What do we name to an address that is loaded into the memory-address register of the memory?

39 / 50

_________________ scheduling allows a process to move between queues.

40 / 50

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

41 / 50

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

42 / 50

In ________addressing, the recipient is not required to name the sender.

43 / 50

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

44 / 50

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

45 / 50

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

46 / 50

In ---------addressing; the recipient is not required to name the sender.

47 / 50

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

48 / 50

The Shortest-Job-First Scheduling algorithm can be

49 / 50

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

50 / 50

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

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