登录
首页 » 数据结构 » 实例有关说明: 数据源:本实例使用的数据源在本章实例MyOdbcSmpl目录中,数据源为ACCESS数据源,数 据文件为Mydb.mdb。请根据本章2.4.1...

实例有关说明: 数据源:本实例使用的数据源在本章实例MyOdbcSmpl目录中,数据源为ACCESS数据源,数 据文件为Mydb.mdb。请根据本章2.4.1...

于 2022-11-01 发布 文件大小:566.28 kB
0 79
下载积分: 2 下载次数: 1

代码说明:

实例有关说明: 数据源:本实例使用的数据源在本章实例MyOdbcSmpl目录中,数据源为ACCESS数据源,数 据文件为Mydb.mdb。请根据本章2.4.1创建ODBC数据源中所指示的ODBC数据源管 理器(ODBC32.exe)来创建和配置数据源MyDB(也可以命名为其他名称)。 执行结果:本章实例的执行结果MyOdbcSmpl目录中的可执行文件MyOdbcSmpl.exe。在数据 源中选择刚配置的MyDB,在数据表或视图中选择要查询的表或视图,选择查询的 列,如果有查询条件,请在查询条件中输入,最后确定是否输出显示查询结果, 缺省为显示,单击“执行”按钮,执行查询并显示查询结果,在SQL语句框中显 示执行的查询。-Note : Data Source : The data used by the examples in this chapter source directory MyOdbcSmpl example, ACCESS data source for data sources, data files for Mydb.mdb. Requests under this chapter 2.4.1 create ODBC data source as directed by the ODBC Data Source Manager (ODBC32.exe) to create and configure data sources MyDB (also named other names). Outcome : examples of this chapter MyOdbcSmpl results of the implementation of the directory MyOdbcSmpl.exe executable files. The data sources to choose just the MyDB configuration, the data in Table View or choose to check the table or view, the choice for the series, if there are inquiries conditions, the conditions for the imp

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 回溯法 解决男女匹配问题 八男八女匹配
    回溯法 解决男女匹配问题 八男八女匹配-Backtracking address gender matching eight men and eight women match
    2023-02-19 02:00:03下载
    积分:1
  • basic data structure class definition and realization : MyStack, MyPoint, MyArc,...
    基本数据结构类的定义和实现: MyStack ,MyPoint,MyArc,Graph,MyQueuesMyStack为构造的一个通用的C++模版堆栈类 MyPoint为一个坐标结构MyArc为带权的边类Graph为临街矩阵表示的图MyQueues为按权值顺序存储的边的队列-basic data structure class definition and realization : MyStack, MyPoint, MyArc, Graph, MyQueuesMyStack for a generic structure of the C category MyPoint stack template for a structure MyArc to coordinate with the right side of the street like Graph Matrix plans MyQueues value of the order by the right side of the storage Queue
    2023-08-10 15:55:02下载
    积分:1
  • 教务辅助管理系统利用VB开发的库管理系统,里面分学生,教师,教务等等各方面的需求满足学校的教务管理的简单需求!...
    教务辅助管理系统利用VB开发的数据库管理系统,里面分学生,教师,教务等等各方面的需求满足学校的教务管理的简单需求!-Senate Assistant Management System Using VB development of the database management system, which, students, teachers, Senate, the areas of the school to meet the needs of the academic management of the simple demand!
    2022-03-11 21:21:00下载
    积分:1
  • 医疗仓库管理信息系统
    这是一个简单而医疗的存储管理系统,开发了使用 Visual Basic.NET (兼容性-Visual Studio 2010 和 Visual Studio 2012)。主要特点是:1.股票购买2.股票收益率3.计费4.供应商配置文件5.客户医学6.记录搜索7.报告登录信息:用户名-管理员密-码-12345
    2022-04-25 11:01:28下载
    积分:1
  • 3X3填质问题,在一个3×3的矩阵中填写1-10的字,保证上下左右相加都是质...
    3X3填质数问题,在一个3×3的矩阵中填写1-10的数字,保证上下左右相加都是质数-3X3 fill several quality problems in a 3 3 matrix to fill in the figures 1-10, ensuring that all about is the sum of the number of quality
    2023-07-03 08:00:04下载
    积分:1
  • 免费的Delphi控件,可以替代BDE,直接访问.dbf
    免费的Delphi控件,可以替代BDE,直接访问.dbf数据库-Free Delphi ActiveX component,replace BDE and direct access .dbf database
    2022-02-28 19:39:01下载
    积分:1
  • 简单的迷宫程序,是基本的入门程序,适合初学者学习...
    简单的迷宫程序,是基本的数据结构入门程序,适合初学者学习-A simple maze procedure, is the basic data structure entry procedures
    2023-01-06 22:25:04下载
    积分:1
  • 链表、栈、多项式乘法实现
    代码提供顺序链表、链式链表和栈C语言实现版本,其中包括链表的初始化、插入元素、删除元素、获取元素、输出元素等操作。同时提供多项式乘法的实现代码。
    2022-08-24 02:56:22下载
    积分:1
  • studied VB Database Programming a small program
    自己学VB时数据库编程的一个小程序-studied VB Database Programming a small program
    2022-04-30 06:02:11下载
    积分:1
  • /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...
    迷宫算法(maze) /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.
    2022-08-08 06:28:42下载
    积分:1
  • 696518资源总数
  • 104353会员总数
  • 66今日下载