数据结构 Balance

大学的每个专业都要编制教学计划。假设任何专业都有固定的学习年限，每学年含两学期，每学期的时间长度和学分上限都相等。每个专业开设的课程都是确定的，而且课程的开设时间的安排必须满足先修关系。每个课程的先修关系都是确定的，可以有任意多门，也可以没有。每一门课程恰好一个学期。试在这样的情况下设置一个教学计划编制程序。三、基本要求：（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

实现文本格式文件中的括号匹配. 匹配算法采用堆栈来实现. 文件读取异常还需完善的人性化一些-Text format documents matching brackets. Matching algorithm uses the stack to achieve. Paper anomaly needs to be well-read human nature of some `` ``

用c语言编写的学生成绩管理程序。有不完美之处。-Using c language student performance management process. Have imperfections.

vb处理excel的一个源码程序，值得大家参考学习-vb a source excel treatment program, it is worth U.S. reference learning

应用背景粗糙集应用R工作室编码。 ；粗糙集不可分辨，利用程序计算阳性面积等。关键技术本工作室是一个软件，在网络上是免费提供的。源代码可以在Studio容易实现

学生成绩管理系统可以输出学生姓名，学好，语文，数学，英语，还要用链表把成绩从高到低输出-Student management system

创建联机调查，并且在真正的时间得到结果。所有结果的计算，而计算到百分比格式。这个项目用于一个组织内，可以从数据库编辑问题。

Data Structures and Algorithms with Object-Oriented Design Patterns in C# 这本书的范例代码dll自己反编译的source code http://www.brpreiss.com/books/opus6/-Data Structures and Algorithms with Objec t-Oriented Design Patterns in C# this book since dll code examples his opposition to the compiler source code http :// www.brpreiss.com/books/opus6/

一个封装好的产生随机数的类,十分好用,是学数据结构是写的,希望对大学有用-Generate a good random number package class, very easy to use is data structure is written in the hope of the University of useful

实现m阶B_树 （2）将线性表中的键值插入到B_树中（即建立索引）； （3）当删除和插入数据到线性表时，同时维护其索引B_树。 （4）可根据所给键值范围，输出该范围的所有键值-achieve m bands Containing tree (2) linear scale for the keys inserted into Containing tree (index); (3) When the deletion and insertion of data to the linear scale, while preserving its index Containing tree. (4) According to the pair, the scope of the output of all keys