登录
首页 » Visual C++ » a

a

于 2013-07-04 发布 文件大小:7067KB
0 242
下载积分: 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 个回复

  • linked
    关于二叉树的一些相关代码,运用链表的形式,求二叉树的高度,结点个数以及叶节点个数(Some of the relevant code on the binary tree, using a linked list, find the height of a binary tree, the number of nodes, and the number of leaf nodes)
    2013-02-03 11:10:07下载
    积分:1
  • migong
    迷宫算法,1代表可以通过,0代表墙壁,自动找寻路线(Maze algorithm, 1 can pass 0 for the walls, automatically find routes)
    2011-06-11 17:13:39下载
    积分:1
  • PolynomialCoeff
    NTL应用——大数系数多项式乘法的计算。从文件读如参数,计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )
    2021-04-11 09:58:58下载
    积分:1
  • hanoi
    实现汉诺塔的操作步骤输出,可以设置1,2,3三个塔柱,输出结果为用1,2,3表示的操作(Tower of Hanoi the steps to achieve the output, you can set 1,2,3 3 Pylon, the output result of the operation that used 1,2,3)
    2009-12-05 22:11:52下载
    积分:1
  • HuffanCoding
    读取数据,统计所得到的文件中每个字母的权值,创建哈夫曼树,哈夫曼编码。哈夫曼解码,解码后内容写入到指定的文件。 读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组,最终可以得到一个存放目标文件内容的数组。 将得到的数组进行字母权值的统计,统计每个字母出现的次数,次数即为每个字母的权值。 将得到的字符数组与权值数组作为创建哈夫曼树的依据,哈夫曼树根据每个字母权值的大小来创建,每个节点,包括权值、父节点、左子、右子和字母本身。 根据哈夫曼树进行编码。形成目标文件的哈夫曼编码,将此编码返回。 根据哈夫曼树得到的数组即为解码数组,解码数组作为解码的结果返回。 写入输出文件,将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入,将数组写入到相应的文件中。 (Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file. Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array. The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter. The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself. According to Huffman coding. The formation of the target file Huffman coding, this code returns. According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)
    2020-07-02 15:40:01下载
    积分:1
  • BSM
    一个很经典的问题_八数码! 算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)
    2008-05-04 13:42:30下载
    积分:1
  • DataStructAndAlgorithm
    数据结构与算法综合资料库,是一本很好的学习计算机的基础教程(Data Structures and Algorithms General database, are a very good tutorial to learn basic computer)
    2009-03-14 17:56:03下载
    积分:1
  • tree
    使用非递归的方法遍历二叉树,可以直接运行。( Non-recursive binary tree traversal.)
    2013-12-04 16:08:43下载
    积分:1
  • bstree_frame
    利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)
    2013-08-10 16:43:50下载
    积分:1
  • 1
    可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)
    2013-11-13 21:16:53下载
    积分:1
  • 696516资源总数
  • 106446会员总数
  • 9今日下载