-
编译成功，odbc型数据库编程
编译成功，odbc型数据库编程-build successful, odbc Database Programming
- 2022-03-29 22:11:00下载
- 积分：1
-
三层数据库考试系统，很不错的，大家可以看看。
三层数据库考试系统，很不错的，大家可以看看。-Three-tier examination system database, it is good, we will look at.
- 2023-03-25 20:40:03下载
- 积分：1
-
（１） 用一个４＊２０的二维数组Ｍ，第１行存放按从小到大排序的20个所给出的ai和bi，第２行存放相应的作业序号，第３行存放１或２(１代表是来自ai，２代表是来...
（１） 用一个４＊２０的二维数组Ｍ，第１行存放按从小到大排序的20个所给出的ai和bi，第２行存放相应的作业序号，第３行存放１或２(１代表是来自ai，２代表是来自bi), 第4行存放0或１（０代表作业序号未进入最优调度方案；１代表作业序号已进入最优调度方案）
（２） 排序完后，按课本所述方法求一种最优调度方案，存放在S中。
-(1) with a 4* 20 two-dimensional array M, the first a line to deposit a small to large order of 20 given by ai and bi, line 2 store operation corresponding serial number, the first three lines deposited one or 2 (a representative from the ai, 2 representatives from the bi), the first four rows stored 0 or 1 (0 for job number to gain access to optimal scheduling programs a job number has been entered on behalf of the optimal scheduling scheme) ( 2) Sort exhausted, according to the methods described in textbooks, seeking the optimal scheduling of a program stored in the S in.
- 2022-05-07 13:53:40下载
- 积分：1
-
数据库课程设计要求
数据库课程设计要求-database design courses
- 2023-05-13 16:30:03下载
- 积分：1
-
数据结构的C++PDF文档
数据结构的C++PDF文档-data structures of C PDF files
- 2022-07-10 23:31:55下载
- 积分：1
-
这是计算机专业硕士生课程《算法设计与实现》中讲到的模式匹配算法的实现，并且将该算法与KMP算法进行了比较。...
这是计算机专业硕士生课程《算法设计与实现》中讲到的模式匹配算法的实现，并且将该算法与KMP算法进行了比较。-It was the professional degree programs, "Algorithm Design and Implementation" referred to the pattern matching algorithm implementation, and algorithm and KMP algorithm are compared.
- 2022-03-14 01:25:09下载
- 积分：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
-
2005软件工程师考试下午编程题源代码
2005软件工程师考试下午编程题源代码-2,005 software engineers at the examination program that the source code!
- 2022-03-16 09:32:48下载
- 积分：1
-
快速数据库的编程实现
快速数据库的编程实现-Rapid Database Programming
- 2022-03-01 03:15:30下载
- 积分：1
-
Java连接MySQL
应用背景在Java数据库连接使用 ； MySQL；NetBeans，注：这里的学生已经创造了在MySQL数据库MySQL root用户名关键技术MySQL connector.jar文件可从网站：wvw.mysql.comNetBeans IDE ； ；7.5MySQL 5.51
- 2022-08-15 09:25:59下载
- 积分：1
