07611407

Fir filter的设计,FIR滤波器系数-Fir filter design, FIR filter coefficients

定义并实现带头结点的循环双向链表类，除构造和析构函数外，成员函数还有取数据元素个数、插入、删除、取数据元素-definition and take the lead in achieving the cycle node type two-way linked list, in addition to the structural and destructor function, members also function from the number of data elements, insert, delete, extract the data elements

数据结构中所有算法的实现，清华大学小严辞C语言版本-data structure of the algorithm to achieve all Qinghua small C-language version of the biblical

数据结构中二叉树用c实现的算法-binary tree data structure used to achieve the algorithm c

数据结构课程设计－－实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)

C++中，对链表的增删改查的基本使用，值得学习(C++, on the list of CRUD basic use, it is worth learning)

这也是个数据库的编程，是演示如何连接远程的数据库的。-This is a database programming, shows how to connect to the remote database.

考研计算机用得到。 数据结构笔记参考资料来源：严蔚敏数据结构教材及题集全真题解数据结构分册 北邮数据结构考研指导算法设计与分析（研究生教材）算法与数据结构（研究生教材） 众网友来信及讨论从其它途径收集的历年真题以严的教材及题集为主，其它参考资料为辅！数据结构笔记主要内容： 基础知识：基本问题问答（概念） 算法分析：教材典型例题算法思路简述 算法设计：严题集一题多解，典型题详细分析 重点题分析：严每章题集已经考题，相似题数据结构笔记特点： 实用，详细，易于理解（用通俗语言描述复杂问题），针对性强，覆盖面广，定期公布，题目累加！ (Kaoyan computer with. Data structure notes refer to data sources: Yan Wei Min data structure textbooks and problem sets full Zhenti solution data structure volumes BUPT data structures Kaoyan guidance algorithm design analysis (Graduate textbook) algorithm and data structure (Graduate textbook) all the users a letter and to discuss other ways of collection of the years Zhenti strict lecture notes and problem set-based, supplemented by other references! Data structure notes: the basics: basic questions Q & A (conceptual) algorithm: a typical textbook example algorithm ideas outlined algorithm design: Yan title set more than one title solution, the typical question a detailed analysis of the focus question: Yan Each chapter problem sets have been exam, similar to the title data structure notes features: practical, detailed and easy to understand (in simple language to describe complex issues), targeted coverage of a wide range of regularly published entitled accumulate!)

vfp数据库应用编程-Probe Database Application Programming

货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem description : A salesman to a number of cities to sell commodities, the known distance between cities (or travel). He selected a departure from the resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.