Search - status

Search - status - List

[Data structs] 描述进程状态迁移过程 DL : 0: 进程状态迁移.写一个程序描述进程状态迁移过程，理解进程概念、状态转换及其控制-Process state transition. The process of writing a program that describes the status of the migration process, the process of understanding the concept of state transition and its control
Date : 2012-03-29 Size : 1.05kb User : testsb
[Data structs] c DL : 0: #include<malloc.h> #include<limits.h> #include<stdio.h> #include<graphics.h> #include<io.h> #include<math.h> #include<process.h> #include<conio.h> #define m 100 #define OK 1 typedef int Status typedef char TElemType /*树元素的类型*/ int t=35 int n=20 int h=14 int u=2 int leaf=0,non_l_leaf=0,non_r_leaf=0,root=0 /*各种结点数*/ char le[m],l[m],r[m],ro[m] /*用与存放各种结点*/ typedef struct BiTNode/*定义二叉树*/-# Include
Date : 2025-12-24 Size : 2kb User : 全文
[Data structs] ordering5 DL : 0: 基数排序：思想:先从数据的低位开始,进行分配,分成10个空间,分别存储位为,0,1,2,3...9 重复的对次地位操作,知道预定的高位,排序完成-Radix Sort: thinking: from data low starting distribution, divided into 10 space, storage spaces, respectively, for 0,1,2,3 ... repeated 9 times the status of the operation, to know the scheduled high ranking completed
Date : 2025-12-24 Size : 1kb User : 朱洁
[Data structs] 001 DL : 0: 在避免死锁的方法中，所施加的限制条件较弱，有可能获得令人满意的系统性能。在该方法中把系统的状态分为安全状态和不安全状态，只要能使系统始终都处于安全状态，便可以避免发生死锁。银行家算法的基本思想是分配资源之前,判断系统是否是安全的若是,才分配。它是最具有代表性的避免死锁的算法。 -Avoid deadlock in the method, the restrictions imposed by the weaker conditions, it is possible to obtain satisfactory system performance. In this method the state of the system is divided into security status and insecurity, as long as the system can always in a safe state, have been avoided deadlock. Banker
Date : 2025-12-24 Size : 62kb User : 陈伟
[Data structs] shujujiegou DL : 0: 数据结构实验如下： Status Fibonacci(int k, int m, int &f) /* 求k阶斐波那契序列的第m项的值f */-Experimental data structure is as follows: Status Fibonacci (int k, int m, int
Date : 2025-12-24 Size : 27kb User : caicai
[Data structs] newparksystem DL : 0: 用户登陆系统存入车辆（存入时间，停车位置，车主姓名，车牌号码）车辆离开（离开时间，停车费用）搜索车辆（存放编号（日期+时间+车牌号），车牌号码，停车位置，车主姓名，存入时刻，离开时刻，存放时间，目前状态（停车场存放或已离开））查看停车场状态（停车数量，空闲位置，今日收入，所有停放的车辆）高级管理（修改密码，设置每小时价格，备份/恢复数据文件，查看用户登录日志）退出系统 -User login system into vehicles (deposited in time, parking location, the name of the owner, the vehicle registration number) of vehicles to leave (departure time, parking costs) search vehicles (storage number (date+ time+ license plate number), plate number, parking location , the name of the owner, into the moment, leave time, storage time, the current state (or have left the store parking lot)) to view the car park status (quantity of parking, free position, today the income, all parked vehicles) Advanced Management (Change Password, Price per hour settings, backup/restore data files, view the user log in log) exit system
Date : 2025-12-24 Size : 451kb User : 张帅
[Data structs] LCSp2264 DL : 0: 动态规划的代码~LCS存路径DP：）状态压缩-Dynamic programming code path ~ LCS deposit DP:) compression status. .
Date : 2025-12-24 Size : 1kb User : 诗苇
[Data structs] src DL : 0: 分布式系统停车场问题：某停车场共有TOTAL-NUM个车位, ENTRY-NUM个入口, EXIT-NUM个出口. 现需要一个用于停车场控制汽车进出的分布式系统, 在该系统中没有集中的管理者(central server), 每个进(出)口通过通信平等协商保存当前车库的状态信息(如空闲车位数UNOCCUPIED-NUM等), 并据此决定是否允许车辆进入, 为简便计, 假定通信是可靠的.-Parking issues distributed systems: A total of TOTAL-NUM parking spaces, ENTRY-NUM entrance, EXIT-NUM export. Is the need for a used car out of the car park of the distributed control system, the system does not focus on manager (central server), for each import (export) through consultations on an equal footing Communication garage to preserve the current status information (such as the number of free parking spaces UNOCCUPIED-NUM, etc.), and, accordingly, whether or not to allow vehicles to enter, for the simple, the assumed that the communication is reliable.
Date : 2025-12-24 Size : 8kb User : 汪若疯
[Data structs] Manual DL : 0: 本课件是一个动态演示数据结构算法执行过程的辅助教学软件, 它可适应读者对算法的输入数据和过程执行的控制方式的不同需求, 在计算机的屏幕上显示算法执行过程中数据的逻辑结构或存储结构的变化状况或递归算法执行过程中栈的变化状况。整个系统使用菜单驱动方式, 每个菜单包括若干菜单项。每个菜单项对应一个动作或一个子菜单。系统一直处于选择菜单项或执行动作状态, 直到选择了退出动作为止。-This courseware is a dynamic data structure algorithms demonstrate the implementation process aided teaching software, which can be adapted to the reader to the algorithm input data and process control method performed the different needs of the computer screen during the execution algorithm is the logical structure of data changes in the structure or storage condition or recursive algorithm changes in the course of implementation status of the stack. The entire system uses menu-driven approach, each menu, including a number of menu items. Each menu item corresponds to an action or a sub-menu. System has been in a select menu items or perform actions state out of action until you have selected so far.
Date : 2025-12-24 Size : 1.12mb User : lll
[Data structs] states_compression DL : 0: 介绍状态压缩理论，使用熟练地位操作降低需要的存储空间，以使动态规划算法可行-Describes the state compression theory, the status of the use of skilled operators to reduce the storage space needed to enable the dynamic programming algorithm is feasible
Date : 2025-12-24 Size : 372kb User : dyj
[Data structs] Tree DL : 0: 1.16② 试写一算法，如果三个整数X，Y和Z 的值不是依次非递增的，则通过交换，令其为非递增。 -Status Dencendant(Array1D L,Array1D R,int n,int u,int v) /* If node u is the dencendant of node v ,*/ /* then return TRUE else return FALSE . */ /* L[i] is the left child of the i_th node, */ /* R[i] is the right child of the i_th node */ /* in the Binary Tree which has n nodes. */
Date : 2025-12-24 Size : 1kb User : garming
[Data structs] data_struct3 DL : 0: 数据结构课后设计题第三章 ◆3.17③ 试写一个算法，识别依次读入的一个以@ 为结束符的字符序列是否为形如序列1&序列2 模式的字符序列。其中序列1和序列2中都不含字符 & ，且序列2是序列1的逆序列。例如， a+b&b+a 是属该模式的字符序列，而 1+3&3-1 则不是。实现下列函数: Status match(char *str) -Data structure design question after class Chapter ◆ 3.17 ③ try to write an algorithm to identify sequence read of a character @ as the terminator sequence is the form such as ' sequence 1 & Series 2' mode of character sequence. In which the sequence 1 and sequence 2 are without character ' & ' , and the sequence is the sequence 1, 2, reverse sequence. For example, ' a+ b & b+ a' is the character sequence is the model, while the ' 1+ 3 & 3-1 ' is not. To achieve the following functions: Status match (char* str)
Date : 2025-12-24 Size : 3kb User : W.Y.T.S
[Data structs] data_struct7 DL : 0: 数据结构课后设计题第七章 7.22③ 试基于图的深度优先搜索策略写一算法，判别以邻接表方式存储的有向图中是否存在由顶点vi到顶点vj的路径(i≠j)。注意：算法中涉及的图的基本操作必须在此存储结构上实现。实现下列函数： Status DfsReachable(ALGraph g, int i, int j) -Data structure design question after class Chapter 7.22 ③ test graph-based depth-first search strategy to write an algorithm to judge by adjacency list stored in a directed graph for the presence of from vertex vi to vertex vj of the path (i ≠ j). Note: The algorithm that the basic operations involved in the storage structure must be realized. To achieve the following functions: Status DfsReachable (ALGraph g, int i, int j)
Date : 2025-12-24 Size : 3kb User : W.Y.T.S
[Data structs] RailwaySchd DL : 0: 车厢调度：输入需要调度的车厢数。输出所有的调度方案并给出所有的椎栈操作与状态变化，最后给出调度方案总数。 -Train dispatching: Enter the number of compartments needed scheduling. Output all the scheduling program and give all the vertebral stack operation and status changes, given the total number of scheduling options.
Date : 2025-12-24 Size : 14kb User : kevin Ning
[Data structs] queue DL : 0: (一)题目: 假设以带头结点的循环链表表示队列，并且只设一个指针指向队尾元素结点而不设头指针，试编写相应的队列初始化、入队列、出队列和判断队列状态的算法。　利用上述算法完成下面的各操作，并在每一操作后输出队列状态。　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)
Date : 2025-12-24 Size : 1kb User : zhongkeli
[Data structs] expressionEvaluation DL : 0: 1)从键盘输入任意一个语法正确的（中缀）表达式，显示并保存该表达式。 (2)利用栈结构，把上述（中缀）表达式转换成后缀表达式，并显示栈的状态变化过程和所得到的后缀表达式。 (3)利用栈结构，对上述后缀表达式进行求值，并显示栈的状态变化过程和最终结果。-1) input from the keyboard correct any syntax (infix) expressions, display and save the expression. (2) the use of the stack structure, to the (infix) expressions into postfix expression, and displays the status of the stack change process and the resulting postfix expression. (3) the use of stack structure, the value of the postfix expression is evaluated, and shows the status of the stack change process and the final result.
Date : 2025-12-24 Size : 9kb User : 林小悠
[Data structs] 01 DL : 0: c++利用回溯法来实现01背包问题　阶段是：在前N件物品中，选取若干件物品放入背包中；　　状态是：在前N件物品中，选取若干件物品放入所剩空间为W的背包中的所能获得的最大价值；　　决策是：第N件物品放或者不放； -c++ using backtracking to achieve the 01 knapsack problem Stage: the first N items, select the number of items into the backpack status is: the first N items, select the number of items into the remaining space in the backpack for the W available to the greatest value Decision-making is: The first N items put or hold
Date : 2025-12-24 Size : 864kb User : 林挺
[Data structs] doc DL : 0: ⑴ 自定义磁盘文件管理的数据结构； ⑵ 能够自由创建、修改、删除文件； ⑶ 文件具有一定自定义的属性； ⑷ 能够显示当前系统文件的状态。-⑴ Custom disk file management data structure ⑵ the freedom to create, modify and delete files ⑶ file has a custom property ⑷ can display the status of the current system files.
Date : 2025-12-24 Size : 147kb User : 王立壮
[Data structs] 2-SAT DL : 0: 本文详细介绍了2-STAR算法，此算法在图论里面具有较高的地位，本文详细推到了染色算法的时间复杂度O(e).具有较高的学术价值。-This paper describes a 2-STAR algorithm, the algorithm in graph theory, which has a higher status, the paper pushed to the coloring algorithm of time complexity O (e). Has high academic value.
Date : 2025-12-24 Size : 159kb User : liuhuiyi
[Data structs] elevator DL : 0: 核心部分为电梯调度控制台。控制台拥有电梯状态及电梯工作任务队列同时负责电梯任务的分配。任务分为二种，外部按钮任务和内部按钮任务。外部按钮任务需要先寻找最佳来执行这项任务的电梯，根据任务和电梯当前的运行状态来判断，又有以下四类：1、电梯同向可以执行；2、电梯空闲；3、电梯逆向；4、电梯同向不可执行。判断顺序即为1、2、3、4。判断任务属于哪一种类型，按照该类型特点插入任务队列。内部按钮已经制定执行电梯，因此需判断执行方向后插入队列即可。当警报按钮按下时候，清空所有队列任务，等待救援…… 共有5个线程函数负责从任务队列中接收任务并且执行，主线程负责窗口消息的处理。 -Dispatch console for the elevator core. Console has a lift queue status and tasks of the elevator lift is also responsible for the allocation of tasks. Task is divided into two kinds, external and internal button mission button task. Tasks need external button to perform this task to find the best elevator, the elevator according to the task and to determine the current operating state, have the following four categories: 1, the elevator can perform the same direction 2, the elevator is idle 3, lift reverse 4, the elevator in the same direction can not be executed. Shall determine the order of 1,2,3,4. Task is to determine what type, according to the types of features into the task queue. Implementation has been developed within the elevator button, so to be inserted into the queue to determine the direction to the Executive. When the alarm button is pressed when the queue is empty of all tasks, waiting for rescue ... ... Function is responsible for a total of five threads
Date : 2025-12-24 Size : 632kb User : 郭皓

« 12 »