资源列表
sect_4
- 德州仪器公司的6000系列的程序示例,可以看看实现什么功能,如果需要可以继续上传,配套有电子版说明-Texas Instruments series of the 6000 procedures example, we can achieve anything, If needed, you can continue to upload and supporting electronic version of a note
avifil32DLL
- IF YOUR DESIGN A VIDEO SYSTEM YOU NEEDED IT （INCLUDE A AVIFIL32.DLL) It Fit VFW-IF YOUR VIDEO SYSTEM DESIGN A YOU NEEDED IT ( INCLUDE A AVIFIL32.DLL) It Kazaam VFW.
Bookshow
- 利用Dreamweaver、Flash、Photoshop等软件编辑，程序用ASP开发而成-use Dreamweaver, Flash, Photoshop editing software, The program was developed with ASP
DictCtrl
- A CLASSIC COM PROGRAM DEMO EVM:Visual c-COM EVM DEMO PROGRAM : Visual c
FFTConversion
- fft快速算法，用于fft变换，基于VC＋＋开发，还望各位指正。-fft Fast Algorithm for fft transform, based on VC + + development, but also hope to correct.
jbpmdemo-0.1-src
- jbpm的demo,带有流程设计，欢迎大家下载-iBpm the demo, with the design process, we are happy to download
shudebianli
- 数据结构做的一个小程序 对二叉进行的遍历-data structure to do a small procedure on the two forks of the ergodic
shujujiegoudanlianbiao
- 输入一系列递减顺序的整数（100,50,40,30……），以0标志结束，将这些数作为data域逆序建立一个单链表；从键盘输入一个整数X，将X插入到此单链表中并保持单链表data域的值递增关系，输出此时单链表各结点data域的值；从键盘输入一个整数Y，若Y值在单链表中存在，则删除data域的值为Y的结点（注单链表中没有data域值相同的结点），并输出此时单链表各结点data域的值。-importation of a series of descending order of the integer
shujujiegoushunxuzhandeyingyong
- 初始化一个顺序栈，编制实现入栈一个元素和出栈一个元素的程序。-an initialization sequence stack, drawing up a stack elements and elements of a stack up procedures.
shunxubiaodeyiyong
- 4. 建立一个有序的顺序表（10，30，35，50，56，100，120），用折半查找方法在此表中查找任一整数，若找到则输出此整数在表中的位置序号，否则输出Not found.-4. Establish an orderly sequence (10,30,35,50,56,100,120) using binary search method in this table as a whole you, if the output is found in this round table pos
E_3
- 进程调度,时间片轮转调度.解压密码:4-process scheduling, time slice Web scheduling. Decompression Password : 4
cyuyanshuzu
- 编程求出二维数组中的最大和最小元素的值及其位置。设二维数组如下： A={ { 3,13,7,9},{11,8,23,5},{6,34,16,4}}。 -programming calculated two-dimensional array of elements in the largest and smallest values and its location. Two-dimensional arrays located as follows : A = () (3,13,7,9