Realizes the compartment dispatch with the stack form,The train entrance compart...

数据结构JAVA版本的电子教案，共有10章。内容全面包括数据结构的基本内容。-Data Structure JAVA version of the electronic lesson plans, a total of 10 chapters. Comprehensive and include the basic content of the data structure.

操作系统编程实验报告，呵呵，从老师的电脑里偷来的。-OS programming experiment, huh, from the teacher"s computer stolen.

《数据结构与程序设计》书本所有源代码-" Data Structure and Program Design" books of all the source code

本文是介绍数据结构中的二分查找，比较数等思想及算法的-this paper is to introduce the data structure to search two hours, a few more ideas and algorithms

这是一个PB小程序　是实现模糊查询的.这是一个PB的小程序，实现模糊查询的 这是一个PB的小程序，实现模糊查询的-PB This a small program is vague inquiries. This a small program PB, Fuzzy inquiry, which is a PB of small programs to achieve fu zzy inquiry, which is a PB of small programs to achieve fuzzy inquiry, which is the one PB small program for the realization of fuzzy

Visual+C+++6.0数据库开发技术与工程实践（下），共7个实例，有源代码，使用前看光盘使用说明-Visual+ C+++6.0 database development Technology and Engineering Practice (below), a total of seven instances, active code, CD-ROM read instructions before use

相对于实验一，新增了2个类。 Class Listing vector. Class Group vector. 使用到了向量。增强了大家对STL向量容器，以及实现所给的声明函数。 压缩包里面有代码，指导书，以及Apache服务器。-Prerequisites: Students should have mastered the following prerequisite skills. C++ Class Specification- Produce C++ class implementations Standard Template Library- Knowledge of the STL, particularly sequential containers and iterators Goals: This assignment is designed to reinforce your understanding and use of the STL vector container and the Standard Template Library. Outcomes: Students successfully completing this assignment would master the following outcomes. Produce C++ class implementations given class declarations

天长地久一般现有21场比赛，两人轮换，每人可从1场拿下4场，不可多拿。我们也不能得到，谁拿了最后的红火谁输了比赛。请编写一个人机游戏的程序，先向电脑索取并取得“一台电脑要‘长生不老将军’”*分析和设计算法后在电脑上取情况，才能使电脑成为‘长生不老将军’必须从中找出关键。按照这个题目的要求来总结自己的想法，以后取一个为数的孩子与对方只需一步和数额相等，最后我们就可以保证给孩子留下一个长子这是个人的。相应的分析算法

问题描述： 给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。 编程任务 对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.

基于SQL Server数据库和JAVA语言的学生信息管理系统；完整源代码，JAVA语言实现，NetBeans开发环境，可以导入Eclipse