boost, buck

ESP8266WiFi杀手固件 包括烧录软件(ESP8266 WiFi Killer Firmware in Chinese incloud IDE)

说明：  操作系统课件 习题 ppt 和很好的课后习题答案(Operating system software ppt and good after-school exercises exercises answers)

扫雷 用VS写的，C++程序 MFC程序。学习C++的好源码(Mine clearance to use VS to write the program C++ MFC program. Learning of a good source of C++)

基于VC的windows程序设计的贪吃蛇游戏编程(Based the VC windows program design Snake Game Programming)

STM32的时钟显示模块，注意没有自动生成hex文件(clock module in STM32)

遍历堆，可以对一个堆编立，复制，采用函数的递归调用来实现的(Traverse the heap, the recursive call to compile a heap legislation, copy, use the function)

onida dvd mt 1389,de, 54pin ram onida dvd

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)

Circuit elm 329 end source programmes.

简单的贪吃蛇游戏，可以选择速度，可以简单的实现贪吃蛇的基本功能,有背景音乐可以播放(a greedy snake that eats candy,the speed of the lake can be set,there is also the background music playing)