Example09_Synchronized_Ticket

Represents an evaluation of the goodness of a result.

说明：  创建一个类，提供与java .lang.Math同名的所有方法，但每个方法均按度数而非弧度进行运算。具体要求是:在自己编写的类中，对Math类中的每一个方法加一层包装。(Create a class that provides all methods with the same name as java. lang. Math, but each method operates in degrees rather than radians. Specific requirements are: in their own class, each method in the Math class with a layer of packaging.)

Java source code for Address Resolution Protocol and Reverse Address Resolution Protocol Implementation

基本算法： 采用博弈比较常用的策略。 计算机下子前，分别对玩家和电脑棋型进行评估，然后根据棋型对每一位置打分（玩家和电脑在同一点的分数不同），比如活三100分，冲四1000分等，然后根据每个落子点分数进行选择。采用极大极小值策略，进行多步计算。(Basic algorithm: The game strategy is commonly used. Before computer playing, players and computer chess models are evaluated separately, and then each position is scored according to the chess pattern (players and computers have different scores at the same point), such as live three hundred points, go four thousand points, and then choose according to the score of each falling point. Multi-step calculation is carried out by using the minimax strategy.)

This member is continually incremented when new prefixes need to be generated Source Code for Andriod.

说明：  大数据大屏展示的DEMO,供参考界面设计及实现。(big data demp, great show!)

Java development related books <java case development collection>

教室管理系统，实现教室的查询，修改，添加，删除等基本操作(Achieve a variety of basic operations)

说明：  LL(1)文法和预测分析方法 1.文法使用产生式来定义； 2.分别求出文法中每一个非终结符的FIRST集、FOLLOW集和SELECT集； 3.画出预测分析表； 4.判定给定的文法是否是LL(1)文法； 5.给定符号串判定是否是文法中的句子，分析过程用分析表格的方式打印出来。(LL(1) Grammar and Predictive Analysis 1. Grammar is defined by production. 2. Find out the FIRST set, FOLLOW set and SELECT set of each non-terminator in grammar. 3. Draw a forecast analysis table. 4. Determine whether a given grammar is LL(1) grammar; 5. Given a string of symbols to determine whether it is a sentence in grammar, the analysis process is printed out in the form of an analysis table.)

ssmjar包 整合ssm框架的所有用到的jar包(ssm jar pakage is very duo)