在TC534

仓库库存管理系统-warehouse inventory management system

一个用C语言编写的清除CMOS密码的小程序-a C language prepared by the removal of a small password CMOS process

《连连看》游戏，使用Access做开发平台，对使用VBA处理图像及其他数据有一定帮助。另外，对连连看游戏及规则的算法实现，充分利用了AccessVBA中的内置对象,减少了编程的难度。-" Lianliankan" game development platform to use Access to do, on the use of VBA to deal with images and other data have some help. In addition, the rules of games and Lianliankan algorithm makes full use of the built-in object AccessVBA a decrease of programming more difficult.

一个自己关于图像分析的作业题 该程序已经调试完毕 图像结果清晰明了-An image analysis on the operation of their own title, the program has finished debugging the results of the clarity of the image

清华大学 2009版 信息论与编码 教学课件（ppt格式），包括各章习题解答，复习，和教学日历（ppt格式）。学校内部使用的-Tsinghua University, 2009 edition of Information Theory and Coding Courseware (ppt format), including the chapters Exercise answers, review, and teaching calendar (ppt format). Schools internal use ~ ~

? 图片算不 # 图片算不 ! 图片算不 @ 图片算不 -Photo Photo# does not count does not count! Photo does not count does not count @ Photo

关于SQL开发的细化，处理开发内部处理系统过程中的BUG。-Refinement on SQL development, deal with the development of the internal processing system in the process of BUG.

在文件的前端和后端添加说明的程序-program in which the explainations have been added at the begin and the end of a file

这程序是利用状态机来控制交通灯verilog码-This procedure is the use of state machine to control the traffic lights verilog code

平衡二叉树操作的演示 一、 需求分析 （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