参照栈类模板的例子编写一个队列类模板class <T> Queue，私有成员包括：队首指针Front，队尾指针Tail，队列容积max。实现：构造函数Queue，析构函数，入队函数In，出队函数Out（每次出队，后面的元素自动前移一位），判队列空函数Empty。并分别用队列类模板定义int和float对象，调用各个成员函数
上传时间： 2013-12-03
上传用户：BIBI
computes the eigenvalues of a symmetric tridiagonal * matrix T. The user may ask for all eigenvalues, all eigenvalues in the half-open interval (VL, VU], or the IL-th through IU-th eigenvalues.
标签： T. eigenvalues tridiagonal eigenvalue
上传时间： 2014-01-21
上传用户：CSUSheep
encode.v The encoder syndrome.v Syndrome generator in decoder berlekamp.v Berlekamp algorithm in decoder chien-search.v Chien search and Forney algorithm in decoder decode.v The top module of the decoder inverse.v Computes multiplication inverse of an Galois field element test-bench.v The test fixture, and some brief notes on using the modules. data-rom.v A simple data source for testing run For those intelligence-challenged who can t run verilog LGPL The license
标签： Berlekamp berlekamp algorithm generator
上传时间： 2014-02-16
上传用户：fxf126@126.com
his project was built and tested with WinAVR-20060125. Make sure the MCU target define in the Makefiles corresponds to the AVR you are using!! To build the code, just install WinAVR and run "make" from the console in echomaster and echoslave subdirs. "make program" will program the device if you have a AVRISP attached. Remember to set the AVR device to at least 8MHz. The AVR may use the programmable clock from MC1319x, just remember to check if the MC1319x and SPI communication is working FIRST! Otherwise you wont get any clock signal to the AVR and then you can t program it or reset the fuses! The MC1319x has default clock output of 32kHz so you will have to set your programmer to a very low frequency (<=32kHz/4) to be able to program it while it is running on that!
标签： the 20060125 project WinAVR
上传时间： 2014-10-10
上传用户：yan2267246
THIS is really two books in one: a tutorial and a reference manual for JDBC, the application programming interface that makes it possible for programmers to access databases from Java. The goal is to be useful to a wide range of readers, from database novices to database experts. Therefore, we have arranged the book so that information needed only by experts is separated out from the basic material. We hope that driver developers as well as application programmers and MIS administrators will find what they need. Because different sections are aimed at different audiences, we expect that few people will read every page. We have sometimes duplicated explanations in an effort to make reading easier for those who do not read all sections. This book will be most helpful to those who have some knowledge of the Java programming language and SQL (Structured Query Language), but one doesn t need to be an expert in either to understand the basic concepts presented here.
标签： application reference tutorial program
上传时间： 2015-08-04
上传用户：zhengzg
crc任意位生成多项式 任意位运算 自适应算法 循环冗余校验码(CRC，Cyclic Redundancy Code)是采用多项式的 编码方式，这种方法把要发送的数据看成是一个多项式的系数 ，数据为bn-1bn-2…b1b0 (其中为0或1)，则其对应的多项式为： bn-1Xn-1+bn-2Xn-2+…+b１X+b０ 例如：数据“10010101”可以写为多项式 X７+X４+X２+1。 循环冗余校验CRC 循环冗余校验方法的原理如下： (1) 设要发送的数据对应的多项式为P(x)。 (2) 发送方和接收方约定一个生成多项式G(x)，设该生成多项式 的最高次幂为r。 (3) 在数据块的末尾添加r个0，则其相对应的多项式为M(x)=XrP(x) 。(左移r位) (4) 用M(x)除以G(x)，获得商Q(x)和余式R(x)，则 M(x)=Q(x) ×G(x)+R(x)。 (5) 令T(x)=M(x)+R(x)，采用模2运算，T(x)所对应的数据是在原数 据块的末尾加上余式所对应的数据得到的。 (6) 发送T(x)所对应的数据。 (7) 设接收端接收到的数据对应的多项式为T’(x)，将T’(x)除以G(x) ，若余式为0，则认为没有错误，否则认为有错。
上传时间： 2014-11-28
上传用户：宋桃子
The book "The Finite Difference Time Domain for Electromagnetics" by Karl Kunz and Raymond Luebbers, CRC Press, 1993, contains an FDTD code and output files in Appendix B. The same code and output files are contained in this directory.
标签： Electromagnetics Difference The Luebbers
上传时间： 2013-12-29
上传用户：chongcongying
ACM试题Problem K:Ones Description Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1 s. How many digits are in the smallest such a multiple of n?
标签： Description divisible Problem integer
上传时间： 2015-08-23
上传用户：zhenyushaw
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
标签： introduction the contains intended
上传时间： 2013-12-23
上传用户：liansi
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签： Implemented following compile command
上传时间： 2014-01-01
上传用户：lhc9102
