ACCESS数据库的压缩,备份,还原,下载,删除的实现

这是学生信息系统项目。你可以做以下事情1.添加记录2.清单上做好记录3.修改记录4.删除记录5.退出程序用来存储数据文件

1．定义数据结构。 2．编写函数，实现插入排序算法。 3．编写函数，实现希尔排序或快速排序等效率较高的算法。-1. Defined data structure. 2. Write a function to achieve insertion sort algorithm. 3. Write a function to achieve Hill sort or quick sort, etc. more efficient algorithms.

BFS、DFS、有向图、无向图中的各种算法的实现，可以自动生成图形。-BFS, DFS, to the map, no map to the realization of the algorithm can be automatically generated graphics.

冒泡排序算法，最基础的Bubble sort 算法，经典-bubble sort

质数环,运行程序自动生成一定范围内的质数环,即相邻俩数之和为质数-prime Central, a program to run automatically generated within a certain range of standard ring, the two neighboring few and as a prime number

1. 在IBConsole中添加两个用户LOGIN和MATER，密码均为PASSWORD。 2. 用MISDBA用户登录MISDB数据库。 3. 在ISQL中，输入第9章提供的SQL语句；或者根据表9-1至表9-8在SQL Explorer中自行创建数据表。数据库创建后需要分配LOGIN和MATER用户的访问权限。 4. 根据表9-9和表9-10设置初始数据，另外需要在PERSON数据表中设置一个用于登录系统的用户（ID=’MAT’，PASSWD=’PASSWORD’，AUTHORITY=’7’，STATE=’F’），同时在PART表中添加ID为’0000000000’的零件，名称为“。 5. 除了修改数据库连接的属性，还需要修改数据模块中LOGIN方法的相关用户密码。 -1. In addition two IBConsole users LOGIN and Mater. passwords are PASSWORD. 2. User login with MISDBA MISDB database. 3. In ISQL, the importation of Chapter 9 of SQL; Or, according to Table 9-1 to Table 9-8 in SQL Explorer to create data sheets. After creating the database needs and Mater distribution LOGIN user access permissions. 4. According to Table 9-9 and Table 9-10 initial data set, Another need PERSON data tables set up a registration system for users (ID = "MAT" PASSWD = "PASSWORD" AUTHORITY ="7 ", STATE = "F"), PART table at the same time adding ID to"0000000000 "parts, name. " 5. In add

算法设计与分析中的贪心法源程序，用VC编写，应用贪心设计策略来解决操作系统中单机、无资源约束且每个作业可在等量时间内完成的作业调度问题-algorithm design and analysis of the greedy algorithm source, VC preparation, application greedy design strategies to solve the stand-alone operating system, without resource constraints which each job can be in the same amount of time to complete the job-scheduling problem

C语言精典编程100例，适合初学者下载学习打基础。-C language 100 cases of classical programming, suitable for beginners to download learning foundation.

求和最大的子序列，采用动态规划算法，经典算法-sequences using dynamic programming algorithm, the algorithm classic

支持并发访问的B+树-support concurrent visit the B-tree