# järjekord (1)

Õ: järjekorra kasutamine järjestuse tähenduses
on eksitav

olemus
(1) kontekstist sõltuv lineaarne ooterivi
= a context-dependent linear waitingline
https://duckduckgo.com/?q=queue&t=h_&iax=images&ia=images

https://en.wikipedia.org/wiki/Queueing_theory

(2) ooterivi andmestruktuurina
Wiktionary:
3. (computing) a data structure in which objects are added to one end, called the tail, and removed from the other, called the head (in the case of a FIFO queue); the term can also refer to a LIFO queue or stack where these ends coincide

ISO/IEC 2382:
loend, mille ehitusviis ja hooldus on sellised, et
järgmisena võetakse kõige varasemana salvestatud
andmeelement (FIFO printsiip)
= a list that is constructed and maintained so that the next data element to be retrieved is the one stored first.
NOTE. This method is characterized as "first in, first out" (FIFO).

https://en.wikipedia.org/wiki/Queue_(abstract_data_type)

https://en.wikipedia.org/wiki/Priority_queue

https://en.wikipedia.org/wiki/Double-ended_queue

# järjekord (1)

Õ: järjekorra kasutamine järjestuse tähenduses
on eksitav

olemus
(1) kontekstist sõltuv lineaarne ooterivi
= a context-dependent linear waitingline
https://duckduckgo.com/?q=queue&t=h_&iax=images&ia=images

https://en.wikipedia.org/wiki/Queueing_theory

(2) ooterivi andmestruktuurina
Wiktionary:
3. (computing) a data structure in which objects are added to one end, called the tail, and removed from the other, called the head (in the case of a FIFO queue); the term can also refer to a LIFO queue or stack where these ends coincide

ISO/IEC 2382:
loend, mille ehitusviis ja hooldus on sellised, et
järgmisena võetakse kõige varasemana salvestatud
andmeelement (FIFO printsiip)
= a list that is constructed and maintained so that the next data element to be retrieved is the one stored first.
NOTE. This method is characterized as "first in, first out" (FIFO).

https://en.wikipedia.org/wiki/Queue_(abstract_data_type)

https://en.wikipedia.org/wiki/Priority_queue

https://en.wikipedia.org/wiki/Double-ended_queue

Palun oodake...

# järjekord (1)

Õ: järjekorra kasutamine järjestuse tähenduses
on eksitav

olemus
(1) kontekstist sõltuv lineaarne ooterivi
= a context-dependent linear waitingline
https://duckduckgo.com/?q=queue&t=h_&iax=images&ia=images

https://en.wikipedia.org/wiki/Queueing_theory

(2) ooterivi andmestruktuurina
Wiktionary:
3. (computing) a data structure in which objects are added to one end, called the tail, and removed from the other, called the head (in the case of a FIFO queue); the term can also refer to a LIFO queue or stack where these ends coincide

ISO/IEC 2382:
loend, mille ehitusviis ja hooldus on sellised, et
järgmisena võetakse kõige varasemana salvestatud
andmeelement (FIFO printsiip)
= a list that is constructed and maintained so that the next data element to be retrieved is the one stored first.
NOTE. This method is characterized as "first in, first out" (FIFO).

https://en.wikipedia.org/wiki/Queue_(abstract_data_type)

https://en.wikipedia.org/wiki/Priority_queue

https://en.wikipedia.org/wiki/Double-ended_queue

Andmete allalaadimisel või töötlemisel esines tehniline tõrge.
Vabandame!