56774584754

这是一个自己写的完整的ADO类 包含了两部分(This is a complete write their own ADO class contains two parts)

利用VC编写的井地地震层析成像的小程序,含正演与反演两个部分,并有插值成图的代码,希望对大家有所帮助(Borehole seismic tomography, a small program written with VC, with the forward and inverse two parts, and interpolation mapping code, we hope to help)

谭浩强C程序设计第四版第8章习题答案,自己做出来的( C Programming Fourth Edition Chapter 8 Exercise answers, do it yourself)

说明：  下面是一个结构体声明： struct box { char maker[40] float height float width float length float volume } a. 编写一个函数，按值传递box结构，并显示每个成员的值 b. 编写一个函数，传递box结构的地址，并将volume成员设置为其他三维长度的成绩。 c. 编写一个使用这两个函数的简单程序 (Here is a structure declaration: struct box {char maker [40] float height float width float length float volume } a. Write a function that is passed by value box structure, and shows the value of each member b . to write a function, passing the address box structure and volume settings for the other three members of the length of the results. c. use these functions to write a simple program)

说明：  vs2015编程，图书馆管理系统，界面登录，借书系统。连接了数据库（SQL SERVER2014)。还书系统，超期罚款等等(Vs2015 programming, library management system, interface login, library system. Connected to the (SQL SERVER2014). Book system, overdue fine and so on)

软件测试功能，使用uft进行的自动化测试功能(programing test,for auto programing test by UFT)

这是用VB写的数控G代码读取，编译，并显示。给做数控系统的朋友做参考。(It is written in VB CNC G-code read, compile, and displayed. CNC system to make a friend for reference.)

C++关于位运算的小程序，哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈(C++ bit computing on small programs, ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha)

VC调用java的简单例子。需要注意jvm.dll路径，路径不对就不能成功！(VC called a simple example. Attention jvm.dll path, the road would not be wrong!)

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)