登录
首页 » Visual C++ » a

a

于 2013-07-04 发布 文件大小:7067KB
0 256
下载积分: 1 下载次数: 1

代码说明:

说明:  进程死锁.资源分配图的绘制 建立所需数据结构;  使用题目21存成的资源分配图的文件作为输入;  编写资源分配图化简算法;  每化简一步,在屏幕上显示化简的当前结果;  最后给出结论,是否死锁,如思索给出死锁的进程及资源; (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )

文件列表:

进程死锁.资源分配图的绘制
.........................\12345.txt,73,2012-06-24
.........................\Debug
.........................\.....\.txt,74,2012-06-19
.........................\.....\LaodDlg.obj,13540,2011-06-17
.........................\.....\LaodDlg.sbr,0,2011-06-17
.........................\.....\MainFrm.obj,20486,2012-06-20
.........................\.....\MainFrm.pdb,25600,2012-06-19
.........................\.....\MainFrm.sbr,0,2012-06-20
.........................\.....\OsTest2.bsc,6218752,2012-06-24
.........................\.....\OsTest2.exe,168018,2012-06-24
.........................\.....\OsTest2.ilk,774368,2012-06-24
.........................\.....\OsTest2.obj,26760,2011-06-19
.........................\.....\OsTest2.pch,7131572,2011-06-07
.........................\.....\OsTest2.pdb,754688,2012-06-24
.........................\.....\OsTest2.res,7344,2012-06-20
.........................\.....\OsTest2.sbr,0,2011-06-19
.........................\.....\OsTest2.suo,3072,2011-06-04
.........................\.....\OsTest2Doc.obj,14696,2011-06-07
.........................\.....\OsTest2Doc.sbr,0,2011-06-07
.........................\.....\OsTest2View.obj,187953,2012-06-24
.........................\.....\OsTest2View.sbr,0,2012-06-24
.........................\.....\ResourceDlg.obj,11695,2012-06-20
.........................\.....\ResourceDlg.sbr,0,2012-06-20
.........................\.....\SaveDlg.obj,13980,2011-06-17
.........................\.....\SaveDlg.sbr,0,2011-06-17
.........................\.....\SelectDlg.obj,20346,2012-06-20
.........................\.....\SelectDlg.sbr,0,2012-06-20
.........................\.....\StdAfx.obj,105568,2011-06-07
.........................\.....\StdAfx.sbr,1374950,2011-06-07
.........................\.....\Test1.exe,553019,2011-06-05
.........................\.....\Test1.ilk,799160,2011-06-05
.........................\.....\Test1.pch,2247428,2012-06-19
.........................\.....\Test1.pdb,1131520,2011-06-05
.........................\.....\vc60.idb,361472,2012-06-25
.........................\.....\vc60.pdb,561152,2012-06-24
.........................\LaodDlg.cpp,1031,2011-06-17
.........................\LaodDlg.h,1177,2011-06-17
.........................\MainFrm.cpp,2926,2012-06-20
.........................\MainFrm.dsp,3413,2012-06-19
.........................\MainFrm.dsw,522,2012-06-19
.........................\MainFrm.h,1543,2011-06-14
.........................\MainFrm.ncb,33792,2012-06-19
.........................\MainFrm.opt,48640,2012-06-19
.........................\MainFrm.plg,920,2012-06-19
.........................\OsTest2.aps,29804,2012-06-24
.........................\OsTest2.clw,3982,2012-06-25
.........................\OsTest2.cpp,4423,2011-06-16
.........................\OsTest2.dsp,5025,2011-06-15
.........................\OsTest2.dsw,522,2011-06-03
.........................\OsTest2.h,1371,2011-06-05
.........................\OsTest2.ncb,140288,2012-06-25
.........................\OsTest2.opt,53760,2012-06-25
.........................\OsTest2.plg,248,2012-06-25
.........................\OsTest2.rc,13495,2012-06-20
.........................\OsTest2Doc.cpp,1762,2011-06-03
.........................\OsTest2Doc.h,1486,2011-06-03
.........................\OsTest2View.cpp,21161,2012-06-24
.........................\OsTest2View.h,2656,2011-06-19
.........................\ReadMe.txt,4019,2011-06-03
.........................\res

.........................\...\OsTest2.rc2,399,2011-06-03

.........................\resource.h,1328,2011-06-15
.........................\ResourceDlg.cpp,1745,2012-06-20
.........................\ResourceDlg.h,1254,2012-06-20
.........................\SaveDlg.cpp,1060,2011-06-17
.........................\SaveDlg.h,1198,2011-06-17
.........................\SelectDlg.cpp,2745,2012-06-20
.........................\SelectDlg.h,1491,2011-06-16
.........................\StdAfx.cpp,209,2011-06-03
.........................\StdAfx.h,1054,2011-06-03

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

发表评论

0 个回复

  • tree
    C语言树的简单实现,介绍了树你前序遍历,树插入与删除节点的实现(C-tree is simple to achieve, before you introduced the tree traversal, tree insert and delete nodes to achieve)
    2011-01-11 22:19:07下载
    积分:1
  • Campus-navigation-problem
    校园导航问题,设计你的学校的平面图,至少包括10个以上的景点(场所),每两个景点间可以有不同的路,且路长也可能不同,找出从任意景点到达另一景点的最佳路径(最短路径)。 要求: (1)以图中顶点表示校园内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等有关信息。 (2)为来访客人提供图中任意景点相关信息的查询。 (3)为来访客人提供任意景点的问路查询,即查询任意两个景点之间的一条最短路径。 (4)修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)
    2011-08-12 10:34:14下载
    积分:1
  • ecs
    说明:  二叉树的演示程序。实现了二叉树和哈弗曼树(Binary tree demo program. Implements a binary tree and the tree Hafu Man)
    2011-03-26 11:59:58下载
    积分:1
  • huffman_tree_code
    Huffman编码与译码,实现数据结构树的功能。(Huffman coding and decoding, data structure tree functions.)
    2007-04-17 19:22:39下载
    积分:1
  • 5100309373_2_9
    数据结构习题答案,线性链表的实现与适用,数据结构:思想与实现2-9(Data structure exercises answer, linear linked list implementations with applicable data structure: Ideas and Implementation 2-9)
    2012-11-23 11:12:48下载
    积分:1
  • Bigint
    利用双向链表实现对两大整数的相加运算。 可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
    2007-10-18 21:34:06下载
    积分:1
  • BiTree
    本算法用于实现二叉树的查找和输出,使用了数据结构中的二叉树结构,精髓在于使用了函数指针。( This algorithm is used to find and implement binary output, use the data structure of the binary tree structure, the essence is the use of function pointers.)
    2016-04-05 17:09:03下载
    积分:1
  • hash
    使用全排列实现hash,看看吧相信对大家会有些帮助的(Full array hash)
    2011-08-19 21:25:34下载
    积分:1
  • DataStructAndAlgorithm
    数据结构与算法综合资料库,是一本很好的学习计算机的基础教程(Data Structures and Algorithms General database, are a very good tutorial to learn basic computer)
    2009-03-14 17:56:03下载
    积分:1
  • Simulation-of-dendritic-growth
    模拟枝晶生长,在统计学常用的一种算法,对随机理论有帮助。(Simulation of dendritic growth, the statistics used an algorithm, the stochastic theory.)
    2012-04-06 19:12:14下载
    积分:1
  • 696516资源总数
  • 106637会员总数
  • 8今日下载