登录
首页 » 数据结构 » VB的图书馆系统,数据库使用ACCE

VB的图书馆系统,数据库使用ACCE

于 2022-12-03 发布 文件大小:965.04 kB
0 225
下载积分: 2 下载次数: 1

代码说明:

VB的图书馆系统,数据库使用ACCE-VB of the library system, the use of ACCESS database

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • List控件的使用,具有可编辑功能,方便的界面配置方法
    List控件的使用,具有可编辑功能,方便的界面配置方法-List controls the use of editing features with a convenient way to interface configuration
    2023-04-14 14:10:02下载
    积分:1
  • 库连接
    包裹ca.pfv.spmf公司.关联规则.TopKRules;
    2022-07-13 13:33:39下载
    积分:1
  • This is a large volume of data retrieval procedures, and I hope to have a friend...
    这是一个可以检索大量数据的程序,希望对需要的朋友有所帮助 -This is a large volume of data retrieval procedures, and I hope to have a friend in need of help
    2022-02-04 02:56:47下载
    积分:1
  • 非常完整的电梯模拟系统 欢迎大家提出宝贵建议
    非常完整的电梯模拟系统 欢迎大家提出宝贵建议-this a complete system of simulating the elevetor,welcome to your advice,thank you
    2022-05-17 00:49:31下载
    积分:1
  • 该程序是分布计排序,它是我所见过的各种排序方法中最快的,它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限,并且如果上限与下限的差值比较大的话,...
    该程序是分布计数排序,它是我所见过的各种排序方法中最快的,它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限,并且如果上限与下限的差值比较大的话,空间消耗也比较大.-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it"s time complexity of O (n), but this sort known to be applicable to sort out the range, and if the upper and lower limits of the relatively large margin, space consumption is relatively large.
    2022-06-14 17:10:55下载
    积分:1
  • 按克鲁斯卡尔(Kruskal)算法思想,编制一个寻找最小生成树的完整的程序。...
    按克鲁斯卡尔(Kruskal)算法思想,编制一个寻找最小生成树的完整的程序。
    2022-04-06 10:08:38下载
    积分:1
  • 清华大学类实现的乙
    清华大学数据结构课上实现的B+树,设计一个4阶B+树,包括: (1) 叶子的每个记录应该包括4字节(long)关键码值和60字节的数据字段(存储文件名等,可以自定),设每个叶子可以存储5条记录,而内部节点应该是关键码值/指针对。此外,每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等; (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索; (3) 显示(打印)此4阶B+树的生长(含删除节点)过程实例;-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;
    2022-01-21 19:44:41下载
    积分:1
  • ASP developed a very simple online application system. This code has become very...
    ASP开发的非常简洁的在线报名系统。这个代码在网上很流行,不过本人没有测试过,可能存在一些小问题,行家应该一看就明白。-ASP developed a very simple online application system. This code has become very popular online, but I have not tested, there may be some small problem, one expert should be able to understand the look.
    2023-05-29 15:45:03下载
    积分:1
  • sequence data structure search examples
    数据结构中顺序查找的例子-sequence data structure search examples
    2022-02-03 17:10:19下载
    积分:1
  • 计算机科班学生的课写的查找算法。
    计算机科班学生的数据结构课写的查找算法。-computer classes to the students to write data structure classes of search algorithms.
    2022-03-17 00:06:02下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载