文件名称:Lecture_07-(Queues)
-
所属分类:
- 标签属性:
- 上传时间:2013-04-20
-
文件大小:338.83kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
The queue structure is a simple structure like the stack.
The difference from the stack is that the first elements to enter the queue get processed first.
That is, service requests get added to the end of the list. That is why, it is also defined as First In First Out (FIFO) storage.
The queue is an ordered waiting list.
Those requesting a specific service enter an ordered list to get that service.
The first element to get added to the list gets served first. (First-come first-served "FCFS")
The difference from the stack is that the first elements to enter the queue get processed first.
That is, service requests get added to the end of the list. That is why, it is also defined as First In First Out (FIFO) storage.
The queue is an ordered waiting list.
Those requesting a specific service enter an ordered list to get that service.
The first element to get added to the list gets served first. (First-come first-served "FCFS")
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Lecture_07 (Queues).pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.