answersLogoWhite

0

IN QUEueing theory,it is like how we serve people in waiting line ---

1.fcfs

2.round robin

3.sjf

4. siro

5.fifo

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

Definition of queue discipline?

Standing behind the person in fornt and not cutting in front of anybody that was there before you.


What is mean by line discipline?

It means staying in a line (or queue) of people: not pushing, not jumping in front.


What do you understand by the value neatness?

I understand that neatness is a self discipline. You have to want to make yourself be neat!


What are types of Queue?

Queue is a data structure which is based on FIFO that is first in first out. Following are the types of queue: Linear queue Circular queue Priority queue Double ended queue ( or deque )


Why do some kids want their parents to discipline them more?

They must be very clever to understand that discipline is good for them. They know they will grow up a better person than ones that have no or very little discipline.


What is the plural of queue?

Queues is the plural of queue.


Which queue most efficient queue using array?

circular queue


What is difference between job queue and ready queue?

Ready queue contain all the jobs that are ready to execute.so the job queue and the ready queue are one and the same.


Queue in a sentence?

He added the download to the queue.(Line)I saw a queue in the park(waiting line)


What is linear queue?

What is linear queue


What are the difference between priority queue and queue?

This chapter presents two ADTs: Queues and Priority Queues. In real life a queue is a line of customers waiting for service of some kind. In most cases, the first customer in line is the next customer to be served. There are exceptions, though. For example, at airports customers whose flight is leaving imminently are sometimes taken from the middle of the queue. Also, at supermarkets a polite customer might let someone with only a few items go first.The rule that determines who goes next is called a queueing discipline. The simplest queueing discipline is called FIFO, for "first-in-first-out." The most general queueing discipline is priority queueing, in which each customer is assigned a priority, and the customer with the highest priority goes first, regardless of the order of arrival. The reason I say this is the most general discipline is that the priority can be based on anything: what time a flight leaves, how many groceries the customer has, or how important the customer is. Of course, not all queueing disciplines are "fair," but fairness is in the eye of the beholder.The Queue ADT and the Priority Queue ADT have the same set of operations and their interfaces are the same. The difference is in the semantics of the operations: a Queue uses the FIFO policy, and a Priority Queue (as the name suggests) uses the priority queueing policy.As with most ADTs, there are a number of ways to implement queues Since a queue is a collection of items, we can use any of the basic mechanisms for storing collections: arrays, lists, or vectors. Our choice among them will be based in part on their performance--- how long it takes to perform the operations we want to perform--- and partly on ease of implemen


What is the difference between a priority queue and a circular queue?

A circular queue is similar to the normal queue with the difference that queue is circular queue ; that is pointer rear can point to beginning of the queue when it reaches at the end of the queue. A priority queue is a queue in which each element is inserted or deleted on the basis of their priority. A higher priority element is added first before any lower priority element. If in case priority of two element is same then they are added to the queue on FCFS basis (first come first serve).