-
图表gvhvhvh
描述(英文):(提示:至少100个字符。请尽你所能详细描述你的项目。更好的内容将为您赢得更多的分数)
- 2022-08-18 13:07:42下载
- 积分:1
-
The software for small student information management system that provides the s...
本软件为小型学生信息管理系统,可提供系统管理员的添加、删除、修改,学生信息添加、删除、修改,学生成绩添加、删除、修改功能,还提供简单的查询功能,包括按学生信息的学号、姓名、学院、专业等条件查询,按学生课程的编号、名称、成绩查询学生成绩信息。-The software for small student information management system that provides the system administrator to add, delete, modify, student information to add, delete, modify, student achievement to add, delete, modify features, it also provides simple query capabilities, including by students of information Student ID, name, college, professional conditions, such as query, according to student course number, name, information on student achievement results queries.
- 2022-03-14 13:18:57下载
- 积分:1
-
SQLite中如何用API操作BLOB类型的字段
SQLite中如何用API操作BLOB类型的字段-how to use SQLite API type BLOB fields
- 2022-03-15 12:02:43下载
- 积分:1
-
data algorithm, Xiao Ming books
数据算法,小明买书-data algorithm, Xiao Ming books
- 2022-08-22 00:28:09下载
- 积分:1
-
Pure C language to write a small general
纯C语言写的小型通用数据库,一个C数据结构组科技小组的作品,附有开发思路PPT,这可是一个宝贵的资源哦,更底层的东西,运行于DOS提示符,可以新建数据库等操作。C的编程高手们值得参考一下。-Pure C language to write a small general-purpose database, a data structure C Group Technology Group works to develop ideas with PPT, this is a valuable resource Oh, and the bottom of things, running on the DOS prompt, you can operate a new database. C programming masters worthy of reference.
- 2023-01-16 16:55:04下载
- 积分:1
-
希尔排序(缩小增量法)
排序过程:先取一个正整数d1<n,把所有相隔d1的记录放一组,组内进行直接插入排序;然后取d2<d1,重复上述分组和排序...
希尔排序(缩小增量法)
排序过程:先取一个正整数d1
- 2023-08-27 08:35:04下载
- 积分:1
-
VB6 and ActiveX
- 2022-01-28 03:37:05下载
- 积分:1
-
use TreeCtr controls access to the database
利用TreeCtr控件访问数据库-use TreeCtr controls access to the database
- 2022-04-12 12:12:12下载
- 积分:1
-
Establishment and tree traversal can be achieved: (1) tree created using the fir...
二叉树的建立与遍历
可实现:
(1)树的创建采用先序方式,用特殊符号0表示左、右子树为空
(2)每次输入一个节点的值,可以根据自己的需要设计不同的节点结构
(3)节点的值为非零数
(4)可以()形式输出创建的树
(5)用先序后序和中序遍历树
(6)销毁树
-Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees
- 2022-05-14 12:51:14下载
- 积分:1
-
数据结构 习题
数据结构 习题-data structure Exercises
- 2022-03-24 18:19:13下载
- 积分:1