In operationg system, Round Robin Scheduling means : (1) A kind of scheduling (2) Repetition policy (3) A memory allocation policy (4) A process allocation policy

In operationg system, Round Robin Scheduling means : (1) A kind of scheduling (2) Repetition policy (3) A memory allocation policy (4) A process allocation policy
by

1 Answer

Answer :

A kind of scheduling
by

Related questions

The Simplest CPU – scheduling algorithm is ______. (1) SJF scheduling algorithm (2) Round robin scheduling algorith (3) Multilevel scheduling algorithm (4) FCFS scheduling algorithm

Description : The Simplest CPU – scheduling algorithm is ______. (1) SJF scheduling algorithm (2) Round robin scheduling algorith (3) Multilevel scheduling algorithm (4) FCFS scheduling algorithm

Last Answer : FCFS scheduling algorithm

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria. (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Description : A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time ... (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Last Answer : (B) Round Robin Scheduling

Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Description : Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Last Answer : Answer: 2

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

LPP is exactly used in solving what kind of resource allocation problems? a. Production planning and scheduling b. Transportation c. Sales and advertising d. All of the above

Description : LPP is exactly used in solving what kind of resource allocation problems? a. Production planning and scheduling b. Transportation c. Sales and advertising d. All of the above

Last Answer : d. All of the above

Which one among the following is not included in the basic functions of operating system? 1) Job Control 2) Job Scheduling 3) Memory Management 4) Data Management

Description : Which one among the following is not included in the basic functions of operating system? 1) Job Control 2) Job Scheduling 3) Memory Management 4) Data Management

Last Answer : 1) Job Control

What does DMA stand for? A) Distinct Memory Access B) Direct Memory Access C) Direct Module Access D) Direct Memory Allocation

Description : What does DMA stand for? A) Distinct Memory Access B) Direct Memory Access C) Direct Module Access D) Direct Memory Allocation

Last Answer : Answer : B

DMA stands for ________ 1) Direct Memory Access 2) Distinct Memory Access 3) Direct Module Access 4) Direct Memory Allocation

Description : DMA stands for ________ 1) Direct Memory Access 2) Distinct Memory Access 3) Direct Module Access 4) Direct Memory Allocation

Last Answer : 1) Direct Memory Access

DMA stands for ________ 1 Direct Memory Access 2 Distinct Memory Access 3 Direct Module Access 4 Direct Memory Allocation

Description : DMA stands for ________ 1 Direct Memory Access 2 Distinct Memory Access 3 Direct Module Access 4 Direct Memory Allocation

Last Answer : 1 Direct Memory Access

What type of a structure is this? a) sequence b) case c) repetition d) process

Description : What type of a structure is this? a) sequence b) case c) repetition d) process

Last Answer : Answer: b Explanation: This is a case structure. Certain cases are given along with a default case in the case structure

What type of structure is this? a) sequence b) case c) repetition d) process

Description : What type of structure is this? a) sequence b) case c) repetition d) process

Last Answer : Answer: c Explanation: This is a repetition structure. The action performed by a repetition structure must eventually cause the loop to terminate. Otherwise, an infinite loop is created

The action performed by a ___________ structure must eventually cause the loop to terminate. a) sequence b) case c) repetition d) process

Description : The action performed by a ___________ structure must eventually cause the loop to terminate. a) sequence b) case c) repetition d) process

Last Answer : Answer: c Explanation: The action performed by a repetition structure must eventually cause the loop to terminate. Otherwise, an infinite loop is created

Which of the following is not a flowchart structure? a) Process b) Sequence c) Repetition d) Case

Description : Which of the following is not a flowchart structure? a) Process b) Sequence c) Repetition d) Case

Last Answer : Answer: a Explanation: There are basically four flowcharting structures: • Decision • Repetition • Case • Sequence

Who wants to do a round robin story?

Description : Who wants to do a round robin story?

Last Answer : It was extremly crowded in there. Everyone was Christmas shopping. Nooks and books were all being rung up. Then, I looked across the crowded, chaotic space and saw….

Why did Charlotte Doyle tell jaggery about the round robin?

Description : Why did Charlotte Doyle tell jaggery about the round robin?

Last Answer : What is the answer ?

What is used to see if a client is still connected to a NetWare server? A. Spoofing TCP/SAP B. Watchdog packet C. GNS Round Robin D. DNS Round Robin

Description : What is used to see if a client is still connected to a NetWare server? A. Spoofing TCP/SAP B. Watchdog packet C. GNS Round Robin D. DNS Round Robin

Last Answer : Watchdog packet

The modes of a MAC to share a transmission medium are ___. A. Round Robin B. Reservation C. Contention D. All the above

Description : The modes of a MAC to share a transmission medium are ___. A. Round Robin B. Reservation C. Contention D. All the above

Last Answer : A. Round Robin

The Token Ring implementation works on the __ mode. A. Contention B. Reservation C. Round Robin D. None

Description : The Token Ring implementation works on the __ mode. A. Contention B. Reservation C. Round Robin D. None

Last Answer : C. Round Robin

Explain Round Robin algorithm with suitable example.

Description : Explain Round Robin algorithm with suitable example.

Last Answer : It is preemptive scheduling algorithm. A small unit of time known as a time quantum or time slice is used for pre-emption of a currently running process. Ready queue is implemented as a circular ... has received 1 time quantum, the CPU returns to process P1 for an additional time quantum. 

A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? (A) OS maintains only scheduling and accounting information for each thread. (B) OS maintains only CPU registers for each thread. (C) OS does not maintain a separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Description : A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following ... separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Last Answer : (B) OS maintains only CPU registers for each thread.

Which of the following information not included in memory table? A) The allocation of main memory to process. B) The allocation of secondary memory to process C) Any information needed to manage virtual memory D) Any information about the existence of file

Description : Which of the following information not included in memory table? A) The allocation of main memory to process. B) The allocation of secondary memory to process C) Any information needed to manage virtual memory D) Any information about the existence of file

Last Answer : D) Any information about the existence of file

Which scheduling policy is most suitable for a time-shared operating system?

Description : Which scheduling policy is most suitable for a time-shared operating system?  A) Shortest job first B) Round robin C) First come first serve D) Elevator

Last Answer : Which scheduling policy is most suitable for a time-shared operating system?  Round robin

By using data compression technique, what can be done in the data storage place of memory and disk ? a) increment b) Reduction c) Transfer d) Repetition

Description : By using data compression technique, what can be done in the data storage place of memory and disk ? a) increment b) Reduction c) Transfer d) Repetition

Last Answer : b) Reduction

A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion

Description : A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion

Last Answer : (C) medium term scheduling

The work of setting up objectives for selling activities, determining and scheduling the steps necessary to achieve these objectives is known as…………. A. Selling B. Sales policy C. Sales programme D. Sales planning

Description : The work of setting up objectives for selling activities, determining and scheduling the steps necessary to achieve these objectives is known as…………. A. Selling B. Sales policy C. Sales programme D. Sales planning

Last Answer : D. Sales planning

........... is a large kernel, including scheduling file system, networking, device drivers, memory management and more. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Description : ........... is a large kernel, including scheduling file system, networking, device drivers, memory management and more. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Last Answer : A) Monolithic kernel

........... is a large kernel containing virtually the complete operating system, including, scheduling, file system, device drivers and memory management. A) Multilithic kernel B) Monolithic kernel C) Micro kernel D) Macro kernel

Description : ........... is a large kernel containing virtually the complete operating system, including, scheduling, file system, device drivers and memory management. A) Multilithic kernel B) Monolithic kernel C) Micro kernel D) Macro kernel

Last Answer : B) Monolithic kernel

Why do i get a memory allocation error in Joomla 1.5?

Description : Why do i get a memory allocation error in Joomla 1.5?

Last Answer : answer:The error is generated by PHP, so the variables would be there instead. Here's an article for Drupal specifically From that: ------------- That indicates that Drupal needed more memory than PHP was ... root ------------- On your own box, for development, probably go with the top option.

Compare the memory organization schemes of contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues External fragmentation?

Description : Compare the memory organization schemes of contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues External fragmentation?

Last Answer : 1. Compare the memory organization schemes of contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues: a. External fragmentationb. Internal fragmentation

DMA stands for: a. Direct memory access b. Direct memory allocation c. Data memory access d. Data memory allocation

Description : DMA stands for: a. Direct memory access b. Direct memory allocation c. Data memory access d. Data memory allocation

Last Answer : a. Direct memory access

Explain the concept of memory allocation for object.

Description : Explain the concept of memory allocation for object.

Last Answer : The memory space for object is allocated when it is declared & not when the class is specified. The member functions are created & placed in memory space only once when they are defined as a ... (object 1, object 2, object 3) has its own separate memory space for its member variables.

What is dynamic memory allocation? Explain with example.

Description : What is dynamic memory allocation? Explain with example.

Last Answer : Allocating memory at run time (when program is in execution) is called as dynamic memory allocation. Dynamic memory allocation use malloc ( ) and calloc ( ) functions to allocate memory at run time. C++ supports these ...  sample *ptr=new sample;  ptr->getdata();  ptr->putdata(); }

Function of memory management unit is : (A) Address translation (B) Memory allocation (C) Cache management (D) All of the above

Description : Function of memory management unit is : (A) Address translation (B) Memory allocation (C) Cache management (D) All of the above

Last Answer : Answer: A

Describe memory allocation for objects.

Description : Describe memory allocation for objects.

Last Answer : The memory space for object is allocated when they are declared and not when the class is specified. The member functions are created and placed in memory space only once when they are ... are essential because the member variables will hold different data values for different objects.

What process is done by the data compression while encoding the data ? a) Identifying repetition in the data b) Reducing repetition in the data c) Eliminating repetition in the data d) All of these

Description : What process is done by the data compression while encoding the data ? a) Identifying repetition in the data b) Reducing repetition in the data c) Eliminating repetition in the data d) All of these

Last Answer : d) All of these

Consumer's sovereignty means: (1) consumers are free to spend their income as they like. (2) consumers have the power to manage the economy. (3) consumer's expenditures influence the allocation of resources. (4) consumer goods are free from government control,

Description : Consumer's sovereignty means: (1) consumers are free to spend their income as they like. (2) consumers have the power to manage the economy. (3) consumer's expenditures influence the allocation of resources. (4) consumer goods are free from government control,

Last Answer : (1) consumers are free to spend their income as they like. Explanation: Consumer sovereignty means that buyers ultimately determine which goods and services remain in production. In unrestricted markets, ... to motivate producers. So ultimately it means how the consumers want to spend their incomes.

Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it facilitates putting some set of processes into memory and a choice is made from that. IV. Because it does not allow to adjust the set of in-core processes. Which of the following is true ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Description : Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it ... ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Last Answer : (D) I and III

Scheduling provides information about the (A) Proper utilisation of machines (B) Means to minimise idle time for machines (C) Time of completion of job (D) Time of starting of job and also about how much work should be completed during a particular period

Description : Scheduling provides information about the (A) Proper utilisation of machines (B) Means to minimise idle time for machines (C) Time of completion of job (D) Time of starting of job and also about how much work should be completed during a particular period

Last Answer : (D) Time of starting of job and also about how much work should be completed during a particular period

Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: Image With reference to current allocation, is system safe? If so, what is the safe sequence? (A) No (B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Description : Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: With reference to current allocation, is system safe? If so, ... B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Last Answer : (C) Yes, P4 P3 P1 P2

The ability to find an individual item in a file immediately _____ is used. 1) File allocation table 2) Directory 3) Sequential access 4) Direct access 4 5) None of these

Description : The ability to find an individual item in a file immediately _____ is used. 1) File allocation table 2) Directory 3) Sequential access 4) Direct access 4 5) None of these

Last Answer : Answer :1

The ability to find an individual item in a file immediately _____ is used: a) file allocation table b) directory c) sequential access d) direct access e) None of The Above

Description : The ability to find an individual item in a file immediately _____ is used: a) file allocation table b) directory c) sequential access d) direct access e) None of The Above

Last Answer : a) file allocation table

Necessary conditions for deadlock are: a) Non preemptive and circular wait b) Mutual exclusion and partial allocation c) Both of The Above d) None of The Above

Description : Necessary conditions for deadlock are: a) Non preemptive and circular wait b) Mutual exclusion and partial allocation c) Both of The Above d) None of The Above

Last Answer : b) are privileged calls that are used to perform resource management functions, which are controlled by the operating system

FAT stands for 1) File Accomdation Table 2) File Access Tape 3) File Allocation Table 4) File Activity Table

Description : FAT stands for 1) File Accomdation Table 2) File Access Tape 3) File Allocation Table 4) File Activity Table

Last Answer : 3) File Allocation Table

Allocation of a resources in a time dependent fashion to several program simultaneously called 1) multi tasking 2) multi user 3) time sharing 4) None

Description : Allocation of a resources in a time dependent fashion to several program simultaneously called 1) multi tasking 2) multi user 3) time sharing 4) None

Last Answer : 3) time sharing

FAT stands for 1 File Accomdation Table 2 File Access Tape 3 File Allocation Table 4 File Activity Table

Description : FAT stands for 1 File Accomdation Table 2 File Access Tape 3 File Allocation Table 4 File Activity Table

Last Answer : 3 File Allocation Table

Allocation of a resources in a time dependent fashion to several program simultaneously called 1 multi tasking 2 multi user 3 time sharing 4 None

Description : Allocation of a resources in a time dependent fashion to several program simultaneously called 1 multi tasking 2 multi user 3 time sharing 4 None

Last Answer : 3 time sharing

Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Description : Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Last Answer : B) Static allocation

Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Description : Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Last Answer : B) Static allocation

Which interface is used to connect SAP Central Process Scheduling in an SAP ECC system? A. Platform Agent B. XBP C. JXBP D. BW-SCH

Description : Which interface is used to connect SAP Central Process Scheduling in an SAP ECC system? A. Platform Agent B. XBP C. JXBP D. BW-SCH

Last Answer : B. XBP

In process scheduling, …………………… determines when new processes are admitted to the system. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above

Description : In process scheduling, …………………… determines when new processes are admitted to the system. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above

Last Answer : A) long term scheduling