-
宠物店对各个宠物信息录入的数据库,可以方便的查找宠物的信息。...
宠物店对各个宠物信息录入的数据库,可以方便的查找宠物的信息。-Pets pet store the information for each database entry, you can easily find pet information.
- 2022-02-11 11:43:40下载
- 积分:1
-
项目的排序表
在 m 表示的资源数 sj ; t代表机 Mj 的速度在时间间隔 [t; t + 1)。我们可以万无一失地想当然不失一般性,处理器速度的变化不在规格内 ed 间隔
- 2023-03-04 23:10:04下载
- 积分:1
-
large data structure of the non
数据结构大作业的非界面版-large data structure of the non-operational interface version
- 2023-03-24 07:25:04下载
- 积分:1
-
jobforyou.com
工作
- 2022-09-26 11:15:03下载
- 积分:1
-
图书管理系统源码及报表分析,库管理..
图书管理系统源代码及报告分析,图书管理系统源代码及报告分析-Library management system source code and reports analysis, library management system source code and reports analysis of
- 2023-01-03 02:35:07下载
- 积分:1
-
一 开发环境
OS: Windows 2000 Server + SP2
IDE: Visual Studio 6.0 + SP5
DataBase...
一 开发环境
OS: Windows 2000 Server + SP2
IDE: Visual Studio 6.0 + SP5
DataBase: SQL 2000 Server + SP2
二 运行
1:创建数据库
将TRADE.sql中的SQL语句考入SQL Server的查询分析器中,全部运行;
2:建立ODBC数据源
数据原名称为Trade_MIS-A development environment OS: Windows 2000 Server+ SP2 IDE: Visual Studio 6.0+ SP5 DataBase: SQL 2000 Server+ SP2 Second run 1: create a database of SQL statements TRADE.sql admitted to the SQL Server" s Query Analyzer, all running 2: Create ODBC data source data formerly known as Trade_MIS
- 2023-02-23 05:45:05下载
- 积分:1
-
vb6 database programing sample code
vb6 database programing sample code
- 2022-04-20 00:49:06下载
- 积分:1
-
关于算法优化的例子,简单的例子:灰度变换,嵌入式处理用得到,一种优化思想,方法...
关于算法优化的例子,简单的例子:灰度变换,嵌入式处理用得到,一种优化思想,方法-Algorithm optimization on the example of a simple example: gray-scale transformation, embedded processing used to be, an optimization ideas, methods,
- 2022-01-31 00:47:55下载
- 积分:1
-
minimum spanning tree data structure for the law
数据结构最小生成树的求法――算法 数据结构可后实习题目-minimum spanning tree data structure for the law-- algorithm data structure can be subject after practice
- 2022-07-13 04:01:02下载
- 积分:1
-
红黑树:输入:在同一目录下的redblacktree.txt文件中输入十个大于0的数值,每个数值中间用空格格开 数目可以大于十个,但是要求在源程序中改变#def...
红黑树:输入:在同一目录下的redblacktree.txt文件中输入十个大于0的数值,每个数值中间用空格格开 数目可以大于十个,但是要求在源程序中改变#define NUM 10 ,改成相应关键值各个数输出:按照先序输出红黑树,格式为:根节点。颜色(左子树。颜色,右子树。颜色),并输出此 树的黑高度,然后输入要删除的关键值,按回车后输出删除后的结果,并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.
- 2022-06-11 22:41:49下载
- 积分:1