基于c8051平台，at25f512flash芯片测试程序

VC++写的关于键盘的程序-keyboard

该程序实现的是种子生命的模拟，生存：有两个或三个邻居的种子将存活到下一代，即仍然占据该格子； 死亡：如果有四个或更多的邻居，种子将因为过度拥挤而死亡；如果种子只有一个或零个邻居，将因为孤独而死亡； 繁殖：如果一个空格子有三个邻居，那么将会长出一粒新种子。一种模式在经过若干代之后有以下四种可能的结局之一： 消亡； 不变――静态； 振荡――在一组模式间循环多次后在相同的位置出现相同的模式； 滑动――在一组模式间循环多次后在不同的位置出现相同的模式。该程序允许用户指定初始的模式或计算机自动创建初始的模式； 显示进化的过程，即历代模式； 当模式消亡就停止进化，或者提示用户是否继续显示下一代，或开始新的案例，抑或退出。 -The program implementation is the seed of life simulation, survival: There are two or three neighbors of the seed will survive to the next generation, that is still occupying the lattice Death: If there are four or more neighbors, the seeds will die because of overcrowding if seed is only one or zero neighbors, will die because of loneliness Breeding: If a sub-space has three neighbors, then it will grow a new seed. After a pattern after several generations have the following one of four possible outcomes: Die Constant- static Oscillation- a group of modes in the loop on many occasions in the same location after the same pattern emerged Sli

一：问题描述 针对某个集体（比如你所在的班级）中的“人名”设计一个哈希表，使得平均查找长度不超过R，完成相对的建表和查表程序。 二：基本要求 假设人名为中国人姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。哈希函数用除留余数法构造，用伪随机探测再散列法处理冲突。 三：实现提示 如果随机函数自行构造，则应首先调整好随机函数，使其分布均匀。人名的长度均不超过19个字符（最长的人名如：庄双双（ZHAGN SHUANG SHUANG）。字符的取码方法可直接利用C语言中的tosacii函数，并可对过长的人名先作折叠处理。 四：需求分析 本演示程序是对哈希表的建立和查找进行演示，主要数据来自自己编写的人名“A~~Z”等字母组成，拼音由开头的字母组成的词组，查找时用伪随机探测再散列法处理冲突。随机产生人名的位置。具体的程序内容在源程序里面有比较详细的解析。程序的运行在下列有详细的介绍。 -one : Problem description against any collective (such as your own classes) of "names" design a hash table. you make the average length of not more than R, completes the construction and Lookup Table procedures. Two : the assumption that the basic requirements were known as the Chinese name of Chinese pinyin form. Hash Table question Enter the names of a total of 30, you take the average length of a maximum of two. Hash functions with a few exception I stay constructed using pseudo-random re-hash detection method to resolve disputes. 3 : Achieving suggested ra

本文件为PPT文件格式，详细演示集成电路基本器件的工艺流程。-this document for PPT file format, detailed demonstration of the basic integrated circuit device process.

一个电子表啊，是vc＋＋能运行的，运行过程中可以按任意键退出！-An electronic form ah, yes vc to run, run the process can exit by pressing any key!

最佳适应算法是动态内存分区分配算法的一种。所谓“最佳”是指每次为作业分配内存时，总是把能满足要求、又是最小的空闲分区分配给作业，避免“大材小用”。为了加速寻找，该算法要求将所有的空闲分区按其内容以从小到大的顺序形成一空闲分区链。这样，第一次找到的能满足要求的空闲区，必然是最佳的。-best adaptation algorithm is a dynamic memory allocation through an algorithm. The so-called "best" means the operation of each memory allocation, always meet requirements, and also the smallest area allocated to idle operations, to avoid "a waste of talent." To speed up the search, the algorithm requires that all leisure district according to content from small to large order of the formation of a regional chain idle. So, the first found to meet the requirements of the free zone will be the best.

PCL的一个原代码,工业控制和数据处理,自控方面的一个小东东.-PCL one of the original code, industrial control and data processing, control of a small Eastern.

读了重构之后的读书笔记。有兴趣的同学仅供参考。-Reconstruction after reading Reading Notes. Students are interested in is for reference only.

数字信号处理课程的有关实验，分为两部分，这是第一部分-Digital signal processing courses offered by the experiments, divided into two parts, this is the first part of

一个打昆虫的小游戏，恒好的，大家试一试吧-playing a game of small insects, constant good, we wanted to try it