Location:
Search - output queue
Search list
Description: 输入字符串并按队列和链表输出再排序的小程序-Enter the string in accordance with the output queue and re-sorted list of small programs
Platform: |
Size: 2048 |
Author: wangweipeng |
Hits:
Description:
编写一个程序实现顺序队列的各种基本运算,并在此基础上设计一个主程序完成如下功能：
1． 初始化队列q。
2． 判断队列q是否为空。
3． 依次进队元素a,b,c。
4． 出队一个元素，输出该元素。
5． 输出队列q的元素个数。
6． 依次进队列元素d,e,f。
7． 输出队列q的元素个数。
8． 输出出队序列。
9． 释放队列。-The preparation of a program to achieve the order of the queue of basic computing, and on this basis the design of a main program to complete the following functions: 1. Initialize the queue q. 2. To determine whether the queue q is empty. 3. Elements into the team followed by a, b, c. 4. An element of force, the output of the element. 5. Output queue of q number of elements. 6. Elements into the queue followed by d, e, f. 7. Output queue of q number of elements. 8. Output sequence of a team. 9. The release queue.
Platform: |
Size: 3072 |
Author: jiangyumin |
Hits:
Description: 以栈摸拟停车场，以队列摸拟场外的车道，按照从终端读入的输入数据序列进行摸拟管理。每一组输入数据包括三个数据项：汽车到达或离去的信息、汽车牌照号码以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若车辆到达，则输出汽车在停车场的内或便道上的位置，若车辆离去，则输出汽车在停车场内停留的时间和应交纳的引用。-Simulation in order to stack the car park to queue simulation outside lane, in accordance with the read from the terminal input data sequence management simulation. Each group of input data consists of three data items: the vehicles arrive at or leave the information, vehicle license number and arrival or departure time. For each group of input data to operate the output after the message is: if the arrival of the vehicles, then the output of motor vehicles in the parking lot or sidewalk on the location, if the vehicle left, the output of motor vehicles in the parking lot to stay within time and should be paid references.
Platform: |
Size: 3072 |
Author: chuyu1987 |
Hits:
Description: 双向链表的初始化 建立 输入输出 以及倒叙 删除 增加-Two-way linked list of initialization to establish the input and output, as well as delete flashback to increase
Platform: |
Size: 1024 |
Author: 小兰 |
Hits:
Description: 题目：设计一个题目，演示用算符优先法对算术表达式求值的过程。
概要设计
1、顺序扫描中缀算术表达式，当读到数字时直接将其送至输出队列中；
2、当读到运算符时，将栈中所有优先级高于或等于该运算符弹出，送至输出队列中，再将当前运算符入栈；
3、当读入左括号时，即入栈；
4、当读到右括号时，将靠近栈顶的第一个左括号上面的运算符全部一次弹出，送至输出队列中，再删除栈中的左括号。
5、使用VS栈来存储读入的操作和运算结果，然后进行数字字符到数值的转换。
-Title: Design of a topic, presentation operator priority method with arithmetic expression evaluation process. Summary of design 1, the order of scanning arithmetic infix expressions, when they read numbers directly to the output queue 2, when they read operator, it will stack all priority higher than or equal to the operator pop-up , sent to the output queue, and then the current operator入栈 3, when read left brackets, that is, when入栈 4, when they read the right brackets, it will be near the Top-left of the first operator in brackets above All a pop-up, sent to the output queue, and then delete stacks of left brackets. 5, the use of VS stack to store read operation and computing the results of numeric characters and then proceed to the numerical conversion.
Platform: |
Size: 6144 |
Author: 布瓜 |
Hits:
Description: 用树的应用模拟铁路查询功能。掌握图的邻接表的定义及应用,能够熟练使用邻接表。加强对map容器的理解，能够熟练使用map容器，复习集合和字典的相关知识。理解最短路径问题，并使用Dijkstra算法解决最短路径问题。掌握线形表的使用，并理解优先队列解决问题的过程。利用栈解决需要逆向输出的问题。
-Application of simulation using the tree railway inquiry function. Master graph adjacency list of definitions and applications, able to skillfully use the adjacency list. Enhance the understanding of map containers, able to skillfully use the map container, collection and review of the relevant knowledge dictionary. Understanding of the shortest path problem, and use the Dijkstra shortest path algorithm to solve the problem. To master the use of linear form, and understand the priority queue problem-solving process. Use the stack to resolve the issue of the need to reverse the output.
Platform: |
Size: 2048 |
Author: sunfuquan |
Hits:
Description: 要求程序输出每辆车到达后的停车位置（停车场或便道），以及某辆车离开停车场时应该交纳的费用和它在停车场内停留的时间。
汽车的模拟输入信息格式可以为：（到达/离开，汽车牌照号码，到达/离开的时间）。用栈和队列来模拟停车场和便道
-Request procedures after the arrival of output per vehicle parking spaces (parking lot or sidewalk), as well as a vehicle to leave the car park should pay the costs and it stays in the parking lot of time. Car format analog input information for: (Arrival/Departure, automobile license plate number, arrival/departure time). Using stack and queue to simulate the parking lot and sidewalk
Platform: |
Size: 2048 |
Author: 吕璐 |
Hits:
Description: 串口通讯里,对接收到的字符进行缓冲处理,并以队列形式输出至外面-Serial communication, the docking buffer characters received treatment, and the output queue to form outside
Platform: |
Size: 2048 |
Author: wyj |
Hits:
Description: 可实现银行排队论mmm，输出随机数matlab实现计算机模拟排队论-Bank of queuing theory can be realized mmm, the output random number matlab computer simulation of queuing theory to achieve
Platform: |
Size: 1024 |
Author: jacky |
Hits:
Description: This a Switch simulation...
with 4 types of switches...
and also we have average simulation time over these 4 switches
1. No Queue
2. Input Queue
3. Input Queue with iterative
4. Output QUeue-This is a Switch simulation...
with 4 types of switches...
and also we have average simulation time over these 4 switches
1. No Queue
2. Input Queue
3. Input Queue with iterative
4. Output QUeue
Platform: |
Size: 24576 |
Author: Sarang |
Hits:
Description: 以栈模拟停车场，以队列模拟车场外的便道。每一组输入数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若是车辆到达，则输出汽车在停车场内或便道上的停车位置；若是车辆离去，则输出汽车在停车场内停留的时间和应交纳的费用（在便道上停车不收费）。栈以顺序存储结构实现，队列以链表结构实现。-Simulation of the car park to the stack to queue outside the road vehicle simulation. Input data for each group of three data items: auto " to" or " leave" information, vehicle license number and time of arrival or departure. Input data for each group to operate the output after the message is: If the arrival of the vehicles, while exports of motor vehicles in the parking lot or parking spaces on the sidewalk if the vehicle left, the output of motor vehicles in the parking lot to stay within time and should be paid The cost (in the pavement on the parking, no charge). Stack storage structure in order to achieve, a linked list queue structure.
Platform: |
Size: 1024 |
Author: XH |
Hits:
Description: 高性能交换机的基于虚拟输出队列的iLISP算法的实现，支持三种流量模型。-High-performance switch-based virtual output queue algorithm iLISP in support of the three flow model.
Platform: |
Size: 1333248 |
Author: 成炼 |
Hits:
Description: 高性能交换机的基于虚拟输出队列的PIM交换算法，类似于cross-bar的算法，其中包含了流量模型。-High-performance switches virtual output queue based on the exchange of the PIM algorithm, similar to cross-bar of the algorithm, which includes a flow model.
Platform: |
Size: 1337344 |
Author: 成炼 |
Hits:
Description: 排队论 M/M/K 模拟。 VC6.0 环境下调试通过。 运行时输入到达率， 离开率和服务器个数， 输出为平均队伍长度。-Queuing theory M/M/K analog. VC6.0 environment to debug through. Run-time input arrival rate, departure rate and the number of servers, the output length of average ranks.
Platform: |
Size: 1024 |
Author: Li Ya |
Hits:
Description: 队列，用顺序或链式结构实现一个队列，采用二叉链表存储结构，用递归方式建立二叉树对
应的二叉链表，并建立队列实现该二叉树的层次遍历序列的输出。
-Queue, with the sequence or chain structure to achieve a queue, using the binary storage structure list, using a recursive approach to building a binary tree corresponding to the binary list, and the establishment of the queue to achieve the level of binary tree traversal sequence output.
Platform: |
Size: 1024 |
Author: 古哩峰 |
Hits:
Description: 1. 创建多 Task，为每个Task 创建私有的Message Queue，每个Task 只通过自己的私有
Message Queue 接收消息；Task 间消息通信通过向对方私有Message Queue 发送消息完
成。
2. Task1：管理Task。负责系统启动时同步系统中其他Task 的启动同步，利用信号量的
semFlush()完成。同时接收各Task 的告警信息，并负责系统结束时的Task 删除处理。
3. Task2：激励Task。利用taskDelay()完成周期地向Task3、Task4 发送激励消息。
4. Task3：Sender Task。接收Task2 的激励消息，并向Task4 发送消息。
5. Task4：Receiver Task。接收Task2、Task3 的消息，在接收到Task3 消息后，向Task3 回
复消息。
6. 以上 Task 的调试信息及工作状态信息通过logmsg 输出。
-1.Create several tasks and Create private Message Queue for each task.
2.Task1:Manage other tasks.Syncronize other tasks and use semFlush() to complish it.Then receive warning message from other tasks and delete them when the system is runing over.
3.Task2:Driver task.Use taskDelay() to send driving message to Task3 and Task4 periodicly.
4.Task3:Sender Task.Receive driving message from Task2 and send message to Task4.
5.Task4:Receiver Task.Receive message from Task2 and Task3,then send ACK message to Task3 when it have received the message form Task3.
6. Use logMsg() to output the debug message and working status message.
Platform: |
Size: 1300480 |
Author: 李晓平 |
Hits:
Description: 1. 创建多 Task，为每个Task 创建私有的Message Queue，每个Task 只通过自己的私有Message Queue 接收消息；Task 间消息通信通过向对方私有Message Queue 发送消息完
成。
2. Task1：管理Task。负责系统启动时同步系统中其他Task 的启动同步，利用信号量的semFlush()完成。同时接收各Task 的告警信息，并负责系统结束时的Task 删除处理。
3. Task2：激励Task。利用taskDelay()完成周期地向Task3、Task4 发送激励消息。
4. Task3：Sender Task。接收Task2 的激励消息，并向Task4 发送消息。
5. Task4：Receiver Task。接收Task2、Task3 的消息，在接收到Task3 消息后，向Task3 回复消息。
6. 以上 Task 的调试信息及工作状态信息通过logmsg 输出。
-1. Create Multi-Task, for each Task to create private Message Queue, for each Task is only through their own private Message Queue to receive messages Task inter-messaging each other through private Message Queue to send the message End
Cheng.
2. Task1: Management Task. Synchronous system is responsible for system startup, the startup of other Task synchronization using semaphores of semFlush () to complete. At the same time to receive and Task of the warning information, and is responsible for the system at the end of Task delete processing.
3. Task2: Incentive Task. The use of taskDelay () complete cycle to Task3, Task4 incentive to send the message.
4. Task3: Sender Task. Task2 incentive to receive messages, send messages to the Task4.
5. Task4: Receiver Task. Receive Task2, Task3 news, in the received message Task3 to Task3 reply message.
6. The above Task debugging information and working status information through the logmsg output.
Platform: |
Size: 1024 |
Author: 玛萨其 |
Hits:
Description: 队列的一些简单基本操作，包括删除，输出等-Queue of some simple basic operations, including delete, output, etc.
Platform: |
Size: 1024 |
Author: peter |
Hits:
Description: 数据结构中之差法。然后队列出来，然后在通过顺序队列输出来-Difference method data structure. Then queue up, then the output queue by the order
Platform: |
Size: 155648 |
Author: 赵刚 |
Hits:
Description: (一)题目: 假设以带头结点的循环链表表示队列，并且只设一个指针指向队尾元素结点而不设头指针，试编写相应的队列初始化、入队列、出队列和判断队列状态的算法。
利用上述算法完成下面的各操作，并在每一操作后输出队列状态。
1)下列元素逐一入队：5,7,3,8,55 状态：5个元素
2) 3个元素出队 状态：２个元素
3)再２个元素出队 状态：队空
4)再１个元素出队 状态：队空（指示下溢）
-(A) Title: Suppose to take the lead in the cycle of nodes that the queue list, and only set a pointer to the tail element node instead of being the head pointer and try to prepare the corresponding queue is initialized into the queue, the queue and determine the queue state algorithm. Complete the following using the above method of the operation and after operation in each output queue status. 1) The following elements one by one into the team: 5,7,3,8,55 Status: 5 elements 2) three elements of the Team Status: 2 element 3) and then two elements of the Team Status: Team Air 4) and then 1 elements out of Team Status: Team space (under the direction of overflow)
Platform: |
Size: 1024 |
Author: zhongkeli |
Hits: