adapt the DP to solve the common longest strings(two and one dimension array)

一个sqlserver数据库日志清除工具，没有源代码，平时由于数据库运行会产生大量的日志，甚至有时会把硬盘占满，有几次我遇到数据库日志居然达到200G以上，造成客户端无法正确执行请求，此小工具可快速清除日志占用的控件，希望能够给需要的兄弟们带来方便。

数据结构：有关树所有操作- Construction of data: The related tree all operates

题目：设有一航班售票系统，要求完成以下功能： 1）假设该民航有若干航班，要求实现增加航班和取消某个航班的功能。 2）查询：根据用户提出的终到站查询航班号、售票情况等航班信息；也可根据航班号，列出该航班已订票的乘客名单。 3）订票：根据航班号为客户订票，如该航班有余票，则为客户订票；如该航班已满员，则显示相应信息。 4）退票：按乘客要求退出已预定的机票。 -Topic: First flight with the ticketing system, required to complete the following functions: 1) It is assumed that the Civil Aviation have a number of flights, calls for increased flights and cancellation of a flight functions. 2) query: Based on user queries raised by the end of the arrival flight number, booking flight information, etc. also available under the flight number, listed in the flight

数据结构。曲线拟合算法。通过曲线拟合法求曲线近似方程-Data structure. Curve fitting algorithm. Demand curve by curve fitting approximation equation

在自己的程序中完成SQK2K中的数据库的备份和恢复。虽然调用外部程序来完成，但是在自己的MEMO窗口中显示外部程序的字符界面输出。-in their procedures completed SQK2K the database backup and recovery. Although the call external procedures to be completed, but in their own MEMO window shows the characters external program interface output.

包括字符串反转， 链表反转， 判断两个数组中是否存在相同的数字， 判断链表是否存在环， 找出单向链表的中间结点， 如何判断一棵二叉树是否是平衡二叉树， strstr()的简单实现，-Including the string reversal, list reversal, to determine the existence of two different array of figures to determine the existence of ring list, find the middle of a one-way linked list nodes, how to determine whether it is a balanced binary tree Binary Tree, strstr () to achieve a simple,

clustering data at matlab

,"智能大厦自动报警系统",是从赛奎春所主编的"C++信息系统开发实例精选"CD中拷贝出来的,对mscomm 控件进制转换串口通信等内容进行了详细介绍。

双向循环链表节点：数据域+指针域指针域：一个指针指向前一个同类型节点，另一个指针指向后一个同类型节点（1）设计节点struct db_node{int data;struct db_node * prev;struct db_node * next;};（2）创建空链表//创建了一个只有头节点的双向循环链表，返回头节点的地址struct db_node * create_db_list(void){struct db_node * phead = (struct db_node *)malloc(sizeof(struct db_node));if(phead == NULL)exit(-1);else{phead->next = phead;phead->prev = phead;}return phead;}（3）制造新节点//制造新节点，返回新节点的地址struct db_node * make_db_node(int value){struct db_node * pnew = (struct db_node *)malloc(sizeof(struct db_node));if(pnew == NULL)printf("malloc failed! ");else{pnew->data = value;pnew->next = NULL;pnew->prev = NULL;}return pnew;}（4）插入节点//把pnew指向的节点插入到头节点的前面，也就是整个链表的末尾bo

基于决策树和贝叶斯的预测分析器，可以对数据库中的数据集通过训练学习后根据训练结果进行信息预测。-Based on Decision Tree and Bayesian prediction of the analyzer can be in the database data sets through training to learn the results after the training information in accordance with prediction.