CS604 Midterm Online Quiz

0%

CS604-Midterm

1 / 50

I/O instructions are Privileged Instructions.

2 / 50

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

3 / 50

Bounded Buffer is a buffer of ____________ size

4 / 50

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

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

6 / 50

The Shortest-Job-First Scheduling algorithm can be

7 / 50

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

8 / 50

POSIX is a standard developed by ANSI

9 / 50

The critical section problem can be solved by the following except

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

11 / 50

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

12 / 50

Starvation is infinite blocking caused due to unavailability of resources.

13 / 50

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

14 / 50

Kernel is responsible for scheduling the user level threads.

15 / 50

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

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

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

18 / 50

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

19 / 50

The Home Directory for superuser in Linux and Unix is

20 / 50

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

21 / 50

_________________ scheduling allows a process to move between queues.

22 / 50

The major advantage of multi-programming system is

23 / 50

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

24 / 50

Which of the following is correct definition for wait operation?

25 / 50

All threads within a process share the ________ address space.

26 / 50

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

27 / 50

Which of the Following is not an Operating System.

28 / 50

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

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

30 / 50

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

31 / 50

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

32 / 50

Hardware provide basic computing resource.

33 / 50

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

34 / 50

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

35 / 50

The Top-down view is that it is a program that acts as an intermediary between a user of a computer and the computer hardware, and makes the computer system convenient to use.

36 / 50

____ command display the status of a process.

37 / 50

The correct command for compiling C program named program.c in Linux environment is

38 / 50

Swapper is also termed as Short term scheduler.

39 / 50

A process consists of __________

40 / 50

________ determines What will be done.

41 / 50

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

42 / 50

A pathname is the list of directories separated by _________.

43 / 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.”

44 / 50

Batch programs are usually _________ programs.

45 / 50

In indirect inter process communication, a sender_____mention the name of the recipient.

46 / 50

-------- command gives a snapshot of the current processes.

47 / 50

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

48 / 50

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

49 / 50

copy file1 file2 is an example of ______ OS view.

50 / 50

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

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