J2EE的JSP、Serverlet一些实际的例子

JSP From shallow go into deeply.chm 由浅入深学习jsp-JSP From shallow go into deeply.chm easy-to-digest learning jsp

一个简单的测试系统，有三种试题可以选择：选择题，判断题，简答题-a simple test system, a choice of three questions : multiple choice questions, the judge stated Jane Examination

聊天代码 简单的收发消息 用java做的-chat program server client java tcp/ip

递归算法求一个有向图的强连通分量，输入格式如压缩包中data4.txt，第一行为顶点个数。输出到result.txt中。-recursive algorithm for a directed graph strongly connected component, the input format such as compression package data4.txt. the first acts of the number of vertices. Result.txt exported to China.

Java源代码4-Java source code 4

课程管理系统，适合初学者的很好的一个练习-coursemanagement

这是Java开发指南，包括Servlets和JSP，是PDG格式的书籍-This is a guide to Java development, including Servlets and JSP, is the PDG format books

当本java文件运行时即备份本文件为一个副本。-when the java runtime documents that the backup copy of a document.

同网页内两个Applet之间通信-website with communications between two Applet

实现求解平面最近点对的复杂度为nlgn的算法。程序要求能够自动生成至少100万个点，并利用该算法求解。此外，要求支持图形界面的算法输入与输出。在此基础上，添加n^2级算法的实现，并比较相同规模下，两种算法的时间消耗。-Solving the nearest point on the plane to achieve the complexity of the algorithm for nlgn. Program requires the ability to automatically generate at least 1 million points, and the use of the algorithm. In addition, the algorithms required to support graphical user interface input and output. On this basis, add the n ^ 2 Ji Implementation of the algorithm and compare the same scale, the two kinds of algorithm" s time consuming.