-
数据库租赁 DVD
这是我的功课，与我的朋友。此示例数据库从 dvd 出租店。有 6 个实体，有一个关系 N N，N-1，执行查询，子查询，函数、 包，过程中，光标和触发器。
- 2023-07-12 15:30:09下载
- 积分：1
-
教学管理系统
教学管理系统
简单实用的校园学生档案管理系统-Teaching Management System
Campus students simple file management system
- 2022-03-06 12:07:14下载
- 积分：1
-
图书馆管理系统，数据库相关
图书馆管理系统，数据库相关-library management systems, databases related
- 2023-05-11 14:40:04下载
- 积分：1
-
traverse the depth map, using binary tree realize that the importation of binary...
图的深度遍历，用二叉树实现，输入时要遵循二叉树的顶点和边数的对应关系-traverse the depth map, using binary tree realize that the importation of binary tree to be followed when the number of vertices and edges of the relationship
- 2022-04-25 12:17:04下载
- 积分：1
-
serversock
/**************************************************************************************
* Dragonfly - RTMP Server by ActionScript
*
* Author: SnowMan
* Author QQ: 228529978
* BLOG: http://rtmp.net or http://rtmp.us.to
* Copyright(c) AS-RTMP-Server(Dragonfly) 2012
* SourceCode URL: http://code.google.com/p/as-rtmp-server
*
*
* Licence Agreement
*
- 2022-03-24 18:29:14下载
- 积分：1
-
数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果...
数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of
- 2022-04-09 01:41:30下载
- 积分：1
-
这个例子主要是为了解决表示标签面板+到+组合框，动态生成…
本示例主要解决GridPanel+TabPanel+ComboBox，动态生成数据，无须任何配置，并且大部分代码的实现都可通用,并且大量减免了在Html页面里静态配置数据列所带来的麻烦，这是很有用的技巧.为了大家更好的更方便的使用本示例,就附加了一个功能:只要添加本地的数据库连接,选择数据库里面的表,就可以对代码进行方便的测试. 更多可以查看包里的项目说明，并附有图片展示。
项目结构上使用三层，为了增加代码的清晰和阅读性，无用的代码都已经清理干净，因为是动态获取并显示任意数据库的任意数据表，所以在这里也不用实现相关实体. -This example is mainly to solve GridPanel+ TabPanel+ ComboBox, dynamically generated data, without any configuration, and most of the implementation of the code can be generic, and a large number of relief in a Html page inside a static configuration data out of the trouble, which is very useful skills. In order to better and more convenient for everyone to use this example, we added a feature: as long as add a local database connection and select a table inside the database, you can easily test the code. More to see the bag, project description, along with pictures showing.
Using the three-tier project structure, in order to increase code clarity and readability, useless code have been cleaned up because it is the
- 2022-08-07 15:46:00下载
- 积分：1
-
本设计完成了要求的所有功能，.能存储足够大的大整数并进行相应的加减法运算。用户界面友好，有用户使用说明,每一步操作都有说明与提示。程序运行通过，有详细的解释说明...
本设计完成了要求的所有功能，.能存储足够大的大整数并进行相应的加减法运算。用户界面友好，有用户使用说明,每一步操作都有说明与提示。程序运行通过，有详细的解释说明。-the design completed all the required functions. Can store large enough large integer and the corresponding addition and subtraction operations. User friendly interface, users note, every step of the operation have notes and hints. Running through a detailed explanation.
- 2022-04-21 03:39:00下载
- 积分：1
-
完成界面功能，与数据库连接，完成查询 插入 删除 登陆等功能...
完成界面功能，与数据库连接，完成查询 插入 删除 登陆等功能-Completion of the interface functions, and database connection, complete the inquiry landing insert delete function
- 2022-01-21 05:03:26下载
- 积分：1
-
Order to map any of the distance between two nodes, (2) with two
求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵
(3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。
(4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同
(5) 显示结果要清晰易懂
(6) 本题运行结果
-Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q
- 2022-04-20 12:55:19下载
- 积分：1
