MS ACCESS 数据库文件的压缩 Delphi 实现

实现了链表的逆置，很好用，随便试，你可以改变链表的类型，实现各种链表的逆置，当然也可以设成模板-Realize the inverse of the list home, very good, and not try, you can change the list type, list the various realize the inverse home, of course, can also be set as a template

本系统是一简单的物资管理系统，能够实现物资的基本信息，入库信息，出库信息，借用情况的管理等功能，适合初学者下载-The system is a simple material management system, able to realize the basic material of information, storage information, a database of information, loan management and other functions, suitable for beginners to download

数据结构哈夫曼实习报告-data structure Huffman internship report

双向循环链表节点：数据域+指针域指针域：一个指针指向前一个同类型节点，另一个指针指向后一个同类型节点（1）设计节点struct db_node{int data;struct db_node * prev;struct db_node * next;};（2）创建空链表//创建了一个只有头节点的双向循环链表，返回头节点的地址struct db_node * create_db_list(void){struct db_node * phead = (struct db_node *)malloc(sizeof(struct db_node));if(phead == NULL)exit(-1);else{phead->next = phead;phead->prev = phead;}return phead;}（3）制造新节点//制造新节点，返回新节点的地址struct db_node * make_db_node(int value){struct db_node * pnew = (struct db_node *)malloc(sizeof(struct db_node));if(pnew == NULL)printf("malloc failed! ");else{pnew->data = value;pnew->next = NULL;pnew->prev = NULL;}return pnew;}（4）插入节点//把pnew指向的节点插入到头节点的前面，也就是整个链表的末尾bo

寻呼台用户管理系统(vb6.0编写)-paging subscriber management system (vb6.0 preparation)

这是本人前不久为公司做的一个财产登记软件,实现中用到的是ADO Access数据库.登陆的初始密码为:111111,当然你可以进行更改.-recently for the company to do a property registration software, which is used ADO Access database. Landing the initial password : 111111, of course, you can change it.

一 开发环境 OS: Windows 2000 Server + SP2 IDE: Visual Studio 6.0 + SP5 DataBase: SQL 2000 Server + SP2 二 运行 1：创建数据库 将Hotel.sql中的SQL语句考入SQL Server的查询分析器中，全部运行； 2：建立ODBC数据源 数据原名称为Hotel_MIS-a development environment OS : Windows 2000 Server SP2 IDE : Visual Studio 6.0 SP5 DataBase : SQL Server 2000 running a two SP2 : Hotel.sql database will be created in the SQL Server SQL admitted to the inquiry Analyzer All operations; 2 : build ODBC data source data formerly known as Hotel_MIS

算法设计与分析实验报告，内容很全面的，呵呵。-algorithm design and analysis of experiments report, very comprehensive, huh.

适合用来做K_Means 和K_NN的数据，一共150组，分成3个簇。-K_Means and make suitable for K_NN data, a total of 150 groups, divided into three clusters.

单比特树查找算法，是用于路由查找的，内含有路由查找相关资料-Monobit tree-search algorithm is used to identify the routing, which contain routing information Search