NexusDB manual (chm format)

大学的每个专业都要编制教学计划。假设任何专业都有固定的学习年限，每学年含两学期，每学期的时间长度和学分上限都相等。每个专业开设的课程都是确定的，而且课程的开设时间的安排必须满足先修关系。每个课程的先修关系都是确定的，可以有任意多门，也可以没有。每一门课程恰好一个学期。试在这样的情况下设置一个教学计划编制程序。三、基本要求：（1）：输入参数：学期总数，一学期的学分上限，每门课的课程号，学分，直接先修关系的课程号。（2）：课程号尽可能的集中在前几个学期中。（3）：若无解，则报告错误信息；否则见教学计划输入到指定的文件中。计划的表格格式自行设计-University of each professional should prepare teaching plans. The assumption that any professional have fixed the length of each school year with two semesters each semester and the length of time equal to the credit limit are. Every professional courses are opened to determine, and the creation of curriculum time arrangements must meet pre relations. Each course is the pre-established relationship, can have any more doors, there will be no. Each course just one semester. Tests in the circumstances set up a teaching program procedures. Three basic requirements : (1) : input parameters : total semester, a semester"s credit ceiling for each class courses, credits, direct relationship prevocational courses,. (2) : N

pb 源码 拷贝文件-pb code copy file

迭代计算一个四阶黎卡提方程-iterative calculation of a four bands Riccati equation

马踏棋盘问题，数据结构中的知识点,欢迎大家下载-this is about the datastructure,you can see it

一个 福彩3d 彩票程序, 随便下，权当研究彩票。-a FC3D tickets program, every can download it for research use.

是一小型门诊挂号软件，可帮助研究开发这方面软件者有参考价值。-is a small clinic registered software can help research and development in this regard are software reference value.

本程序是计算三角网闭合差的程序,包括建表,数据库数据输入等完整过程-This procedure is the calculation of triangulation poor closure procedures, including built form, the database integrity of the process of data entry, etc.

/**************************************************************************************  * Dragonfly - RTMP Server by ActionScript  *   * Author: SnowMan  * Author QQ: 228529978  * BLOG: http://rtmp.net or http://rtmp.us.to  * Copyright(c) AS-RTMP-Server(Dragonfly) 2012  * SourceCode URL: http://code.google.com/p/as-rtmp-server  *  *  * Licence Agreement  *

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of

最简单和最酷的方式来创建类似程序，可以做与 ListView 保存、 加载和修改多个条目与文本的文件的数据库。必须下载此，请参阅如何最简单的这种方法是