课程设计，SQL写的一些说明，大家看看有需要没有。

sdram的内存初始化源代码，有要的赶快下-SDRAM memory initialization source code, there should be as soon as possible under the

这是新颖实用电子设计与制作，有关电子设计的一些电路，总共有125种，例如：家庭卡拉OK灯光控制电路，神奇旋转彩灯电路，多变流水灯控制电路等等一些使用电路-This is a novel and practical electronic design and production, the electronic design some circuit, a total of 125 kinds, such as: family karaoke OK lighting control circuit, the magic lantern rotating circuit, variable flow control circuit and so a number of lights to use circuit

自己用C编写的小游戏，DOS界面哦，可以运行。 浮点数基本运算 浮点数的基本运算主要有四则运算、符号处理、大小比较，以及浮点数分柝等。 包含头文件 "fn.hpp" #include "fn.hpp" 浮点数基本运算 浮点数的基本运算中有加、减、乘、除、取负、绝对值、相等比较等。 加减乘除 加、减、乘、除四个运算极为相似，都是需要两个参数，结果当然也是浮点数了。 例子： // 加 减 乘 除 btil::fn::plus::value // f1+f2 的结果 btil::fn::minus::value // f1-f2 的结果 btil::fn::multiplies::value // f1*f2 的结果 btil::fn::divides::value // f1/f2 的结果 plus::value::f_val // f1+f2 的结果的值 struct one { static const double f_val = 1.0 } // 两个浮点数 struct two { static const double f_val = 2.0 } minus::value::f_val == 0.5 取负 取负运算就是取一个浮点数的负数。-prepare themselves with a small C games, DOS interface, oh run. Float Float basic operations of the basic operations are four major operations, symbols, sizes, and float-watchman"s rattle so. The first document contains "fn.hpp"# include "fn.hpp" float float basic operations of the basic operations are, p

本源程序是模拟飞船着陆的游戏，有一定的趣味行~！-the source of the spacecraft landing simulation of the game, have a fun trip ~!

用VC++程序实现有限差分波动方程不加边界条件二阶变速剖面。-With VC++ Procedures to achieve finite-difference wave equation without boundary conditions of second-order variable-speed profile.

图像配准的文献，包括遗传算法，互信息法，免疫算法，中英文经典文献-Image Registration of the literature, including genetic algorithm, mutual information method, the immune algorithm, in both English and Chinese classical literature

汉字的处理的C 程序-characters of C Program

编写筛选查找素数函数： void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数， 所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。 然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime[i]所对应的i就是素数，它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.

接金子的小程序，只是玩玩而已，新手而已，自己编的，以后会努力-received small gold procedures, but to play it, and newcomers only their part in the future will strive

yyy wap版的论坛，让您在手机上也会拥有自己的论坛-yyy yyy wap edition of the Forum, on the phone you will have their own forum