Welcome![Sign In][Sign Up]
Location:
Search - implementation of a queue

Search list

[OtherSSetQueue

Description: 本文件是实现队列结构的头文件,包含队列结构定义和实现函数-this document is the first cohort of documents, including queue structure definition and implementation function
Platform: | Size: 1024 | Author: 石增华 | Hits:

[Data structsQueue1.0

Description: 对底层队列的一个实现,包含有基本的操作如增 删 查 改 等-On the bottom of an implementation of the queue, including the operation of a basic search such as additions and deletions, etc.
Platform: | Size: 566272 | Author: xyl | Hits:

[Windows Developexperiment

Description: 实验室管理(C++)某高校物理实验室实行全天开放,学生可以根据自己的学习进度自行安排实验时间,但是每个实验有一个限定的时间,例如某实验要在近两周内完成。假设近期将要做的实验可以有周一下午、周三下午、周五下午三个时间(可以根据实际情况进行调整),不妨称为时间一、时间二、时间三,这三个时间做实验的学生可以用队列来存储。-Laboratory management (C++) The implementation of a university physics laboratory open day, students can progress according to their own experiments in self-arranged time, but each experiment has a limited time, such as an experiment in the near two weeks完成. Assuming the near future experiments can be done Monday afternoon, Wednesday afternoon, Friday afternoon, three hours (can be adjusted according to the actual situation), may be referred to as time 1 and time 2, time three, the three time to do experiments that students can used to store queue.
Platform: | Size: 6144 | Author: candy930 | Hits:

[Windows Developqueue

Description: 在c++环境下实现队列的定义,简单详细的分析了队列的构成及其作用-At c++ environment the definition of the queue implementation, a detailed analysis of a simple composition of the cohort and its role
Platform: | Size: 601088 | Author: 马丽 | Hits:

[Data structsqueue_linklist

Description: Implementation of a queue using a Linklist.-Implementation of a queue using a Linklist.
Platform: | Size: 1024 | Author: gowdd | Hits:

[OS programProcessManage(s)

Description: 1、 建立一个结点,即 PCB 块包括用户标识域、状态域(执行、等待、就绪)、 link 域。  2、 建立三个队列(执行队列、就绪队列、等待队列)。  3、 根据进程状态转换实现对三个队列的具体操作。具体的驱动可以采用时间片算法或手动调度的形式完成三个状态之间的转换 -1, the establishment of a node, that is, including the user ID PCB block a domain, the state of the domain (Executive, waiting, ready), link domain. 2, the establishment of the three queues (the implementation of the queue, ready queue, waiting queue). 3, in accordance with the process of conversion to achieve a state of the concrete operation of the three queues. Specific time-driven films can be used scheduling algorithm or manually complete the form of conversion between the three state
Platform: | Size: 386048 | Author: jenny | Hits:

[Data structsqueue

Description: 数据结构实现:队列(环形数组、链式实现)的基类实现。-Data structure implementation: queue (circular array, chain to achieve) is the base class implementation.
Platform: | Size: 1024 | Author: Robin.Wang | Hits:

[Software EngineeringLinux_server

Description: 这里包含了几个Linux服务器设计的文档。内容还很有含金量的。 目录:Linux环境并发服务器设计技术研究.pdf 基于并发服务器的网络通信的设计和实现.pdf 基于进程池的Linux并发服务器的研究.pdf 基于通信接口封装机制的网络并发服务器设计.pdf 基于主动队列管理的Linux并发服务器模型及负载均衡算法的研究.pdf-This contains a number of Linux server design document. It is very gold content of the content. Directory: Linux server environment for concurrent design technology. Pdf concurrent server-based network design and implementation of communication. Pdf concurrent process-based Linux server pool study. Pdf based on the mechanism of network communication interface package concurrent server designs. Pdf-based active queue management Linux-concurrent server model and load balancing algorithm. pdf
Platform: | Size: 1001472 | Author: 蛤蟆仙人 | Hits:

[Consoleprio

Description:   优先队列是0个或多个元素的集合,每个元素都有一个优先权或值,对优先队列执行的操作有1) 查找 2) 插入一个新元素 3) 删除.在最小优先队列(min priorityq u e u e)中,查找操作用来搜索优先权最小的元素,删除操作用来删除该元素 对于最大优先队列(max priority queue),查找操作用来搜索优先权最大的元素,删除操作用来删除该元素.优先权队列中的元素可以有相同的优先权,查找与删除操作可根据任意优先权进行. -Priority queue is 0 or more elements of the set, each element has a priority or value, on the implementation of priority queue operations are 1) search 2) insert a new element 3) Delete. At a minimum priority queue ( min priorityq ueue), the search operation to search for the smallest element of priority, the delete operation to remove the element to the maximum priority queue (max priority queue), the largest search operation to search the priority elements of the delete operation to Remove the element. priority queue elements can have the same priority, search and delete operation can be carried out according to any priority.
Platform: | Size: 1082368 | Author: bob | Hits:

[CSharpMultilevel_Queue_Scheduling

Description: 合肥工业大学操作系统课程设计-实现进程多级队列调度算法的模拟(附课程设计报告) 建立作业的数据结构描述;  使用两种方式产生作业:(a)自动产生, (b)手工输入;  在屏幕上显示每个作业的执行情况;  时间的流逝可用下面几种方法模拟:(a)按键盘,每按一次可认为过一个时间单位; (b) 响应WM_TIMER;  计算并显示一批作业的周转时间、平均周转时间、带权周转时间、平均带权周转时间。  将一批作业的执行情况存入磁盘文件,以后可以读出并重放; -Hefei University of technology courses on operating system design- to achieve multi-level queue scheduling process simulation (with course design report)  description of the data structure to establish operations  use two ways to create jobs: (a) automatically generated, (b) manual input  displayed on the screen for each job performance  the passage of time can be several ways to simulate the following: (a) by the keyboard, may have thought that every time a unit of time (b) response WM_TIMER  calculated and displayed batch job turnaround time, average turnaround time, with the right turnaround time, average turnaround time with the right.  Implementation of a batch job into a disk file, since you can read and playback
Platform: | Size: 655360 | Author: | Hits:

[OS Developfbqueue_attemper

Description: 合肥工业大学操作系统课程设计 进程/作业调度:多级反馈队列调度算法。 1建立作业的数据结构描述; 2使用两种方式产生作业:(a)自动产生, (b)手工输入; 3在屏幕上显示每个作业的执行情况; 4时间的流逝可用下面几种方法模拟:(a)按键盘,每按一次可认为过一个时间单位; (b) 响应WM_TIMER; 5计算并显示一批作业的周转时间、平均周转时间、带权周转时间、平均带权周转时间。 6将一批作业的执行情况存入磁盘文件,以后可以读出并重放;-Hefei University of Technology courses on operating system design process/job scheduling: Multi-level feedback queue scheduling algorithm. A description of the data structure to establish operations 2 production operations in two ways: (a) automatically generated, (b) manual input 3 of the screen on the implementation of each operation 4, the passage of time can be several ways to simulate the following : (a) by the keyboard, may have thought that every time a unit of time (b) response WM_TIMER 5 to calculate and display a number of turnaround time, average turnaround time, with the right turnaround time, average turnaround time with the right. 6, the implementation of a batch job into a disk file, since you can read and playback
Platform: | Size: 3756032 | Author: | Hits:

[ConsoleBankSchedual

Description: 设计和实现一个银行排队机系统,该系统对银行当前能提供服务的窗口统一调度,使用MFC模拟调度及排队窗口。-Queue design and implementation of a banking system that can provide services to the bank window to the current unified control, scheduling and queuing simulation using the MFC window.
Platform: | Size: 35960832 | Author: zhdxch | Hits:

[JSP/JavaDVDVendingMachine

Description: A java implementation of a DVD vending machine. Not a visual demo, but on where the use of queue s and there functions are demonstrated -A java implementation of a DVD vending machine. Not a visual demo, but on where the use of queue s and there functions are demonstrated
Platform: | Size: 41984 | Author: GHQST | Hits:

[OtherQUEUE

Description: C++ implementation of a queue structure
Platform: | Size: 2048 | Author: mrssuper | Hits:

[JSP/JavaHairCutTest

Description: 自己实现的一个java的理发店系统,主要是队列数据结构的应用-Own implementation of a java barber shop system, mainly the application of the queue data structure
Platform: | Size: 110592 | Author: Leofly | Hits:

[Otherqueue

Description: PROGRAM OF IMPLEMENTATION OF A QUEUE USING LINKEDLIST
Platform: | Size: 1024 | Author: kkkk | Hits:

[Windows Developqueue

Description: 用双头栈模拟队列,要求实现一个队列,提供Enqueue(&q, e)和Dequeue(&q, &e)两个接口 保证先进先出,用双头栈DStack实现(分A、B两个头),DStack只提供pushA(), popA(), pushB(), popB()等几个接口,不能访问任何位置i的元素,不能进行任意位置的插入、删除操作-Queue with a double stack simulation, called for a queue to provide Enqueue (& q, e) and Dequeue (& q, & e) two interfaces Ensure FIFO, with the double stack DStack implementation (points A, B two heads), DStack only pushA (), popA (), pushB (), popB (), and several other interfaces, you can not access any location of the element i , can not be inserted at any position, delete
Platform: | Size: 201728 | Author: wang | Hits:

[AI-NN-PRa-single-channel-analog

Description: 本课程设计要求模拟实现一个的单道批处理系统的作业调度。通过具体的作业队列、作业调度算法等功能的实现,加深对单道批处理系统的作业调度实现过程的理解。-The course design requirements to achieve a single-channel analog batch job scheduling system. Through specific job queue, job scheduling functions such as implementation of the single channel deepening batch job scheduling system to achieve understanding of the process.
Platform: | Size: 593920 | Author: hezhiqiang | Hits:

[Data structsdata-structures-of-C-

Description: 常用的数据结构 数组 表 队列 图 树等相关数据结构的C语言实-C language implementation of a common data structure array table queue graph tree data structures
Platform: | Size: 2695168 | Author: 杨兴文 | Hits:

[Internet-NetworkloopQueen.c

Description: 一个简单队列的实现,循环队列,包括进队列,出队列,队列初始化等功能-A simple implementation of a queue, circular queue, including into the queue, the queue, the queue initialization function
Platform: | Size: 1024 | Author: 肖波 | Hits:
« 12 3 4 5 6 »

CodeBus www.codebus.net