vfp表单，锁住和解锁数据表。（压缩文件）

一个非常灵活的Access数据库记录编辑器

门到门蔬菜服务程序的人可以订购从他们的家的蔬菜和蔬菜将 蔬菜店到他们的家。这个项目是蔬菜销售者可以管理他们的 库存

一套采用php+mysql数据库方式运行的多用户网上商城系统，具有安全、负载量高，访问迅捷的特点，能与论坛、博客、CMS等系统整合并支持一站登陆。系统内置贝宝、支付宝、快钱等在线支付网关以及QQ、旺旺、雅虎通即时网络通讯工具.-Adopted a set of php+ Mysql database running multi-user online mall system with safe, high-load, quick visit to the features with forums, blog, CMS, such as systems integration and support the one-stop landing. PayPal embedded system, AliPay, quick money, such as online payment gateways, as well as QQ, Wangwang, Instant Messenger network communication tools.

数据结构的课程设计，编程实现一个简单的分配问题！-Curriculum design, data structures, programming a simple allocation problem!

一个程序而已，不过看看也有好处-a procedure adopted, but it is also good to see

书中共介绍了四类排序函数：插入排序、起泡排序、选择排序、快速排序。我们需要建立一个无序随机序列，分别用上述排序方法对建立的无序序列有序化，编写相应的程序计算每种算法的赋值次数、比较次数以及所用时间，以此为依据来判断各种算法的效率。-introduced a total of four ranking functions : insertion sort, bubble sort, select, in order of Quick Sort. We need to build a disorderly random sequence, the use of such methods of sequencing to establish an orderly sequence of the disorder, and the preparation of the corresponding procedures of each algorithm for the calculation of frequency assignment, as well as comparison with the number of time, using this as the basis to judge the efficiency of algorithms.

用ODBC对数据库实现连接 显示数据 修改数据-Using ODBC to connect to the database display data modification of data

功能实现：1).输入，显示各个学生信息 2)．根据学号，姓名查找某个学生的成绩 3)．修改学生信息 4).删除学生信息 5） 清空数据库6）选择范围的输出学生成绩排名。-Function achieve: 1). Input, display individual student information 2). According to Student ID, name to find a student" s achievement 3). Modified Student Information 4). Remove Student Information 5) Clear the database 6) Select the output range of student achievement rankings.

This program can do Parking management

1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!)