网络技术你也许用得到他是非常有用,你快下再吧

This data set contains WWW-pages collected from computer science departments of various universities in January 1997 by the World Wide Knowledge Base (Web->Kb) project of the CMU text learning group. The 8,282 pages were manually classified into the following categories: student (1641) faculty (1124) staff (137) department (182) course (930) project (504) other (3764) -This data set contains WWW-page collecte d from computer science departments of various universities in January 1997 by the World Wide K nowledge Base (Web-

最新的网络版（2007年8月）的ns2英文手册做成的pdf版，对于深入学习ns2的内部机制很有用处。-The latest online edition (August 2007) is made of ns2 manual pdf English version, for the ns2-depth study of the internal mechanism is very useful.

VC++.NET 时尚游戏开发编程40例，各种智力游戏

两个关于Struts的实例，一个是手动编写的Struts实例，一个是用Struts插件编写的实例-Two on the Struts examples, one is prepared manually Struts examples, one is prepared to use Struts plug-ins example

日立SH-2 CPU核的VERLOG源码，可在ISE6上综合，有说明文档-Hitachi SH-2 CPU core VERLOG source can be integrated in ISE6, documentation,

THE PRINT FORM EDITOR VC CODE

JSP建站必须文件commons-codec-1.3.zip-JSP documents must Station at commons-codec- 1.3.zip

BFSK.在MALAb环境下编的。短小精干，很适合在程序中作为一个fuction来用。-BFSK. MALAb environment in the series. Short crack, and is very suitable for the process as a fuction use.

c++小游戏.中文名程序不大可作为初学者的编程实例,增进对c++这门编程语言的了解-c small game. Chinese name

通用二叉搜索树，包含的算法有：输出广度优先遍历、前序、中序、后序遍历结果，按树的形状打印树，统计总节点数，统计叶子节点数，统计右节点数，计算树的高度，删除所有叶子节点，插入节点，查找节点，删除节点，由前序遍历结果和中序遍历结果生成树，由后序遍历结果和中序遍历结果生成树，检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth- first traversal, the former sequence, sequence, after the preorder, the shape of the tree by tree print, the total number of nodes statistics, statistics leaf nodes, the nodes to the right statistics to calculate tree height, remove all leaf nodes, insert nodes, the nodes you delete nodes from the former preorder results and the results of Spanning Tree preorder, After the preorder from the results and the results preorder spanning tree, check whether the tree balanced and complete balance.