资源列表
十进制四则运算器
- 题目内容：在以二叉树表示算术表达式的基础上，设计一个十进制的四则运算的计算器。主要功能：实现整数浮点数的四则运算。-topic : expressed in a binary tree arithmetic expressions on the basis of the design of a four decimal computing calculator. The main functions : to achieve integral float the four operations.
Java事件处理
- 这里有几个事件处理的例子,主要是为了能够使初学者掌握基本事件处理一般方法，找出事件源、事件、监听器 利用监听器接口中的方法处理事件 利用内部适配器类和匿名内部适配器类类处理事件的方法.这里几个例子是很经典的Java事件处理的例子,很适合初学者使用.-here a few examples of the incident, is to enable learners to grasp the basic incident general method to identify the source
XML_Wrapper
- 由于刚开始接触XML时要么遇到编译错误,要么API太复杂，因此封装一个MS XML的类，接口见XMLMake.h和XMLParse.h文件，内附说明和Demo代码-Since the beginning of contact when either XML encountered compile errors or API too complicated and therefore a package of MS XML category, interface and see XMLMake.h
ElGamal公钥密码
- Eigamal加密程序，可实现简单的加密-Eigamal encryption procedures, simple encryption
分项案例
- 找到邮件列表文件中前十个最长的邮件地址，并排序输出到文件result.txt中-mailing list to find documents before the 10 longest-mail addresses and sort the output to a file which result.txt
bianyic++
- 录入合法的LL(1)文法，将输出LL(1)预测分析表，并可以对输入的句子进行语法分析输出相应语法树。-Input legitimate LL (1) grammar, will output LL (1) Table Forecast and Analysis, and can import sentence for syntax analysis syntax tree corresponding output.
模拟两种进程调度方式
- 进程调度:模拟最高优先级优先调度方式和FIFO调度方式.显示每个时间片各进程的PCB.即优先级,状态,访问CPU次数.剩于数-process scheduling : Analog highest priority priority scheduling ways and means FIFO scheduling. Each time film shows the process of the PCB. That is, priority, status, visit the CPU freq
读吧.net书网整站程序 v2.8.1
- 给大家看看 这是个我用的不错的一个原代码,-us look at it is I use a good one source,
LinuxBasic(Farsight)
- 关于LinuxBasic(Farsight)的好东东，不下走宝拉-on LinuxBasic (Farsight) Wanton good, as many pull-away!
ying（linux中能执行）
- 该程序是处理嚣的调度的源代码，通过进程调度，实验各进程的功能，进程序数的多少，决定进程执行的速度。-the procedure is to deal with the clamor of the source code scheduling, process scheduling, the experimental process functions into The number of procedures, the decision to speed the process of imple
MKing
- 猴子选大王，程序采用了循环链表实现。含有注释，具体操作依据可执行文件。-monkey king elections, the procedures used to achieve Chain cycle. Notes contain the specific basis for executable files.
各种二叉树的数据结构
- 按先序扩展序列建立二叉树，先序、中序、后序遍历的递归算法，二叉树遍历的非递归算法，层次的非递归算法，求二叉树的深度。-sequence extended by the first sequence established binary tree, first sequence, sequence, after the preorder the recursive algorithm, the binary tree traversal non - recursive algorithm, the