模拟排队机

NUnit是在.NET進行TDD的利器,是一個單元測試框架. NUnit最初是由James W. Newkirk, Alexei A. Vorontsov 和Philip A. Craig, 後來開發團隊逐漸龐大起來.在開發過程中, Kent Beck 和Erich Gamma2位牛人也提供了許多幫助.(NUnit NET TDD weapon is a unit testing framework NUnit originally by James W. Newkirk, Alexei A. Vorontsov and Philip A. Craig, later development team gradually huge in the development process, Kent Beck and the Erich Gamma2 cattle also provides a lot of help.)

动态心电曲线图功能展示，可暂停 双缓存机制(Function display of dynamic ECG chart, trends; general trend of affairs; dynamic state; dynamic condition; dynamic)

用于监控PLC，针对的是modbus协议(monitoring PLC with modbus protocol)

测量平差，对于测绘专业数据处理很有用，特别是c语言的薄弱的同学也有很好的帮助。(Surveying adjustment, for surveying and mapping professional data processing is very useful, especially the weak C language students also have a very good help.)

JAVA教程普通案例。交流学习专用。谢谢大家(。)

说明：  ads256驱动，实现ad采样及转换功能(Ads256 driver, realize AD sampling and conversion function)

vc6.0 使用NTGraph控件 读取串口数据后画出波形图(vc6.0 use NTGraph read serial data control to draw waveforms)

C#源码,随书源码,递归算法,排列组合 　　C#递归算法：0~N位数的排列组合，组合的数字在0~5之间，输入需要组合的位数，点击“计算”按钮，程序会列出所有符合条件的数列组合。一个学习C#递归算法的好范例。(C# source code, source code with the book, recursive algorithms, permutations and combinations C# recursive algorithm: 0 ~~ N digit permutation and combination, the combination of numbers 0 to 5, enter the number of bits need to combine, click on " Calculate" button, the program will List all eligible series combination. A good example of a recursive algorithm to learn C#.)

该系统为通讯录系统，实现了通讯录的管理功能，增删改通讯功能。通讯录查询工作是一个很复杂的问题，在实际的工作领域中，时常会遇到要修改通讯录的问题，例如修改、删除、添加、查找等都是应用过程中十分频繁的操作，如果有一个应用软件可以使这个操作简单而富有人性化，我们就可以通过界面上的提示语言来轻松准确地完成以上操作了。 本通讯录主要涉及函数的调用、指针、哈希表等主要技术。其中，函数的调用和哈希表是技术的重点。 (The system address book system, and the address book management features, additions and deletions to communication. Directory inquiries is a very complex issue, in the actual work areas, often face the problem to modify the address book, such as modify, delete, add, find the application process are all very frequent operation, if an application can make this simple and full of humane, we are prompted by the interface language to easily and accurately complete the above operation. The book mainly related function call, pointer, hash table and other major technologies. Among them, the function call and a hash table is the focus of technology.)

人机对弈，互取火柴。取最后一根者输。每次至少取一根，最多取4跟。如果人先取则人必输。如果机先取，则机器等待人出错。否则人胜。(Human-computer game, and take matches. The last one loses. Check at least one of each, with up to 4 check. If the person is who will get lost. If the machine to check, then wait for others to machine error. Otherwise, people win.)