access2002数据库管理实务 超星格式图书

ORACLE最大的逻辑组成部分。ORACLE数据库由一个或多个表空间组成，一个表空间由一个或多个数据文件组成，但一个数据文件只能属于一个表空间。数据库表等对象是存放在表空间中的。-ORACLE The largest component of the logic. ORACLE database by one or more table space for components, a table space by one or more data files, a data file can only belong to a table space. Database tables and other objects are stored in the table space.

完全内核，界面的改变，增加学生统计、 院系、班级等管理功能 　　1.添加单个成绩 　　2.批量添加成绩 　　3.通过搜索并修改与删除 　　4.直接修改 　　5.可以批量删除 　　6.可以直接GO到达你想到达的页 　　7.分页显示 　　8.代码精简 　　9.整合部分重复代码 　　v2.82 build1114版 　　1、增加了Excel名单文件上传、导入功能 　　2、为了正确指定文件上传目录，各文件夹名中不许有字符“.”，故将原命名方式“School V2.82 Build1114”改为“School V282 Build1114”。 -completely kernel, interface changes, the increase in student enrollment statistics, faculty, classes such as a management function. Add two individual achievements. Batch added three results. Search through deletion and modification In addition to four. directly alter five. Batch 6 can be deleted. GO can reach you directly to the arrival of page 7 . Pagination 8. 9 streamlined code. Integration of duplicate code v2.82 build111 4 version of an increased list of Excel file uploads into two functions. , Therefore, the original name means "School V2.82 Build1114" to "School V2 82 Build1114. "

数据结构中线性表的合并链式实现，VC++实现的。-Data structure in linear chain realize the merger table, VC++ Achievable.

集装箱的装箱问题 给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得集装箱的空间利用率最高？-problem given a container, its length L, width W and H for high, existing batch of cylindrical wood and each timber are long L, but different radius, based i-radius of the wood-ri. Asked how crates, containers make maximum utilization of space?

同一个数据库开发的系统，里面有源代码和发布版本-with a database development systems, which Active code and releases

this cscan algo in c-this is cscan algo in c++

（1）满足均匀分布的[M,N]区间随机数，其中M,N是正整数。 (2) 满足指数分布的[M,N]区间随机数，其中M,N是正整数。 -(1) satisfy the uniform distribution of [M, N] interval of random numbers, in which M, N be a positive integer. (2) to meet the exponential distribution of [M, N] interval of random numbers, in which M, N be a positive integer.

二叉树遍历 包括先序遍历 中序遍历 后序遍历 求结点个数 求树的深度-Including the first order binary tree traversal traversal sequence in order to postorder traversal node number and ask for the depth of

trigger示范程序-trigger example program

数据结构-遍历实验-data structure-traverse experiment