Easy

一个经典的代码统计工具，可以帮助你清晰的查找出您的代码行数、注释行数、空格行数，希望能有所帮助！-code of a classical statistical tools that can help you clear out your search for the source line number, a few notes. a few spaces, hopes to have help!

可以将任意文件转化为bat的东西，详细内容参见源码-Arbitrary files can be converted into bat things, the details see the source code

一个简单的猜数字游戏的编程,编译已经完全通过,绝无问题-猜数字a simple game programming, the compiler has completely passed, no problem

Bootloader for Atmel Atmega microcontroller. It act as a STK500 board and can be used from within avrstudio.

3D迷宫游戏的源程序。vb写的，很好的学习素材-3D maze game of the source. Vb writing, good learning materials

视频卡的测试程序-video card testing procedures

关于BIOS使用的经典C代码-BIOS used on the classic C code

利用KF方法的卫星姿态确定仿真程序，simulink编写。-Satellite attitude estimation using KF filter/ simulink.

操作系统课程设计 题目和目的: 通过模拟文件系统的实现，深入理解操作系统中文件系统的理论知识。(完整报告,包括源码、流程、分析、心得和可执行程序。心血啊！) - The operating system curriculum designs the topic and the goal: Through the simulation filing system realization, thoroughly understands in the operating system the filing system theory knowledge. (The integrity reported, including the source code, the flow, the analysis, the attainment and may the executive routine. Painstaking care! )

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins