adplus-dvertising
frame-decoration

Question

The data structure suitable for scheduling processes is _______ .

a.

List

b.

Heap

c.

Queue

d.

Stack

Posted under Computer Architecture

Answer: (c).Queue

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The data structure suitable for scheduling processes is _______ .

Similar Questions

Discover Related MCQs

Q. The sub-routine service procedure, is similar to that of the interrupt service routine in ________ .

Q. When an instruction is read from the memory, it is called

Q. Which activity does not take place during execution cycle?

Q. Pseudo instructions are

Q. Which of the following is a Pseudo instruction?

Q. The number of instructions needed to add a numbers and store the result in memory using only one address instruction is

Q. Computers use addressing mode techniques for _____________________.

Q. _________ register keeps track of the instructions stored in program stored in memory.

Q. The addressing mode used in an instruction of the form ADD X Y, is

Q. In a program using subroutine call instruction, it is necessary

Q. n bits in operation code imply that there are ___________ possible distinct operators.

Q. The instruction ‘ORG O’ is a

Q. The BSA instruction is

Q. A group of bits that tell the computer to perform a specific operation is known as

Q. The load instruction is mostly used to designate a transfer from memory to a processor register known as

Q. The operation executed on data stored in registers is called

Q. MRI indicates

Q. Self-contained sequence of instructions that performs a given computational task is called

Q. Microinstructions are stored in control memory groups, with each group specifying a

Q. What is the content of Stack Pointer (SP)?