answersLogoWhite

0

Definition of queue discipline

Updated: 12/19/2022
User Avatar

Wiki User

16y ago

Best Answer

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

User Avatar

Wiki User

16y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Definition of queue discipline
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is mean by line discipline?

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


What is the definition of discipline according to you?

The definition of discipline according to me is that you get a punishment that makes you realize that what you did was wrong and you'll do better next time. A discipline at home might be a early bed time @ 7:00 p.m. A discipline at school might be a detention after school for 30 minutes. That's the definition of discipline according to me.


What is the Definition of lack of discipline?

It is the ability not to do what is required him to do.


What word starting with a consonant is trailed by four vowels?

"Queue" is a word starting with a consonant and followed by four vowels in a row.


What is the definition of physical discipline?

Physical discipline is the ability of the brain to tell the body when enough is enough. Physical discipline has to do with the ability to exercise and be fit without sacrificing the basic needs of the body.


What is definition of circular queue?

A queue is simply a FIFO i.e first in first out. In queue we've front and rear. Front is the initial or first location of the queue whereas rear indicates the last entry location in the queue. In the circular queue the location of front and rear will be the same IF the total space of the circular queue is utilized. Each element has its position no. for insertion , if we set the 5th element as the front element then after every insertion the ptr indicates the 5th element as front. in deletion, the fifth element is deleted every time it is the rear position. after deletion of an element the queue rotates and every time the rear indicates the 5th element of the circular queue. and every time the 5th location element is deleted.


How do you draw a queue?

One definition of queue is a line of people or vehicles waiting their turn. You could draw a bunch of people waiting in line or a line of vehicles waiting to go through a toll booth or to board a ferry.


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 )


What is the definition of circular queue?

A queue is simply a FIFO i.e first in first out. In queue we've front and rear. Front is the initial or first location of the queue whereas rear indicates the last entry location in the queue. In the circular queue the location of front and rear will be the same IF the total space of the circular queue is utilized. Each element has its position no. for insertion , if we set the 5th element as the front element then after every insertion the ptr indicates the 5th element as front. in deletion, the fifth element is deleted every time it is the rear position. after deletion of an element the queue rotates and every time the rear indicates the 5th element of the circular queue. and every time the 5th location element is deleted.


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 definition of dicipline?

Behavior. some with good discipline is well be behaved and a person with out discipline is not


Which queue most efficient queue using array?

circular queue