计算机操作系统作业 银行家算法 解决死锁问题 第一次上载

完全由C语言实现的图的相关操作，就是清华大学 数据结构书里的图的所有算法的实现-Solely by the C language implementation of related plans to operate, that is, Tsinghua University, the data structure of the book" s map of the implementation of all algorithms

分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.

数据结构实验程序 线性表 栈和队列 二叉树 图 查找 内部排序-Experimental procedures for linear data structures stack and queue table tree diagram to find the internal order

数据结构的java实现-Data Structure written in Java for Huffman Coding Algorithm.

数据结构常用算法：图的最小生成树 经典算法：图的最小生成树-algorithm commonly used data structures : Figure the minimum spanning tree algorithm classic : Figure the minimum spanning tree

是基于C#语言的一个学生管理系统数据库系统开发案例.很实用-Is based on the C# Language a student management system database system development case. Very practical

一些数据库的实例。共12章。如第八章： 第8章数据库环境的建立 1. 用MISDBA用户登录MISDB数据库。 2. 在ISQL中，输入第8章提供的SQL语句；或者根据表8-1至表8-4在SQL Explorer中自行创建数据表。 3. 根据表8-5至表8-7设置初始数据，另外需要在PERSON数据表中设置一个具有培训管理系统管理权限的用户（ID=’PXC’，PASSWD=’PASSWORD’，AUTHORITY=’6’，STATE=’F’）和用于外派培训的用户（ID=’PXCOUT’，NAME=’外派培训’）。 4. 修改Admin源程序中的数据库连接属性，并且重新编译training.exe。 5. 修改Client源程序中数据库连接属性，并且重新生成html文件和cab文件，然后将这两个文件拷贝到web服务器指定目录中。-some examples of the database. A total of 12 chapters. If the eighth chapter : Chapter 8 database to establish an environment. User login with MISDBA MISDB database. 2. In ISQL, the importation of Chapter 8 of SQL; Or, according to Table to Table 8-1 8-4 in SQL Explorer to create data sheets. 3. According to Table 8-5 8-7 to set up tables initial data, Another need PERSON data tables set up with a training management system for the management competence of the users (ID = "P XC ", PASSWD =" PASSWORD "AUTHORITY ="6", STATE = "F") for assignment and training of users (ID = "PXCO

描述 问题描述： 给定一个只包含数字[0..9]的字符串，求使用字符串中的某些字符，构建一个能够整除15的最大的整数。 注意，字符串中的每个字符只能使用一次。 编程任务： 求由给定字符串构建的能够整除15的最大整数。-Description of the problem description: Given a contain only numbers [0 .. 9] of the string, seeking to use some of the characters in the string, one can build the largest integer divisible by 15. Note that the string for each character can only be used once. Programming task: seeking from the given string that can build the largest integer divisible by 15.

多线程进行二分排序法，递归产生新线程，每一个父线程产生两个子线程，接着父线程对两个子数组进行合并-Multi-thread two hours sorting method, recursive generate a new thread, each thread is a parent produces two sub-threads, then the parent thread to merge the two sub-arrays

经过改进的C语言位操作功能-improved C-language feature