登录
首页 » 操作系统 » 33个经典的例子程序,通过调试和学习UCOSII的弱点…

33个经典的例子程序,通过调试和学习UCOSII的弱点…

于 2022-12-07 发布 文件大小:627.28 kB
0 93
下载积分: 2 下载次数: 1

代码说明:

ucosII的33个经典例题,均调试通过的,学习ucosII的捷径,强烈推荐!因文件太多,分成了5个上载,请大家谅解!-ucosII of 33 classic examples, both through debugging and learning ucosII shortcut, strongly recommended! Because too many documents, divided into five available, please understanding!

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

发表评论

0 个回复

  • Operating systems courseware, there are many examples, detailed description of t...
    操作系统课件,里面有很多的例子,详细的说明,生产者消费者问题的颠覆。-Operating systems courseware, there are many examples, detailed description of the problem of subversion producers and consumers.
    2022-02-15 20:23:07下载
    积分:1
  • 1) 设计下沙校园平面图,在校园景点选10个左右景点。以图中顶点表示校园内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等有关信息。 2
    1) 设计下沙校园平面图,在校园景点选10个左右景点。以图中顶点表示校园内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等有关信息。 2) 为来访客人提供图中任意景点相关信息的查询。 3) 为来访客人提供任意景点的问路查询,即查询任意两个景点之间的一条最短路径。 -1) Design Xiasha campus plan, in campus election spots around 10 spots. Vertex in order to express in various spots on campus, storage spots name, code, briefings and other information to express the path edge, storage path length and other relevant information. 2) for the visitors to provide map information on any attractions inquiries. 3) To provide visitors attractions arbitrary query to ask the way, that is, queries between any two spots of a shortest path.
    2022-02-05 23:47:23下载
    积分:1
  • Circular queue, after the test is passed, good use can be increased, can be redu...
    环形队列,经过测试通过,很好用,可以增加,可以减少,FIFO-Circular queue, after the test is passed, good use can be increased, can be reduced, FIFO
    2023-08-12 14:10:03下载
    积分:1
  • ucosii的GUI
    ucos GUI源代码,大家参考参考。不知道为什么字符还不够啊。-ucosii GUI
    2022-06-13 01:19:08下载
    积分:1
  • 页面置换算法 先进先出、最近最久未使用、最佳页面置换算法...
    页面置换算法 先进先出、最近最久未使用、最佳页面置换算法-FIFO page replacement algorithms, the recent use of the most long-lost, the best page replacement algorithm for
    2023-06-21 10:20:03下载
    积分:1
  • 进程通信
    要求:创建进程,实现消息通信和共享内存通信。 示例程序:ProcessA.exe ProcessB.exe 简要说明:本例用三种方法实现进程通信,仅用于示例目的,没有进行功能优化。 1、            在进程A中输入一些字符,点“利用SendMessage发送消息”按钮可将消息发到进程B。 2、            在进程A中输入一些字符,点“写数据到内存映像文件”按钮,然后在进程B中点“从内存映像文件读数据” 按钮可收到消息。 3、           
    2022-11-30 21:20:04下载
    积分:1
  • 小程序
    操作系统小程序--银行家算法.该代码主要是针对计算机系高校学生在操作系统中有编程困难的同学而设计的,针对性教强.模拟实现银行家算法。通过编写和调试一个系统动态分配资源的简单模拟程序,观察死锁产生的条件,并采用银行家算法,有效的避免死锁.-Operating System applet- Banker" s algorithm. The code is mainly for the Department of Computer Science College Students in the operating system are designed for students with programming problems, and targeted to teach strong. Simulation and Realization of banker" s algorithm. By writing and debugging a simple system dynamic simulation program to allocate resources to observe the resulting deadlock conditions, and use of banker" s algorithm, effective to avoid deadlock.
    2022-09-21 02:35:03下载
    积分:1
  • linux011源码注释 非常不错
    linux011源码注释 非常不错-linux011 very good source Notes
    2023-07-10 07:00:04下载
    积分:1
  • 兔子吃草
    #include "stdafx.h" #include #include #include /*信号量的定义,它是负责协调各个线程, 以保证它们能够正确、合理的使用公共资源。 用于控制进程间的同步与互斥*/  typedef HANDLE Semaphore;  Semaphore g_semBuffer,g_semGlass, g_mutex; //mutex 为互斥锁  // 利用 Windows 下的 API 函数(视窗操作系统应用程序接口)来定义 P、V 操作  #define P(S) WaitForSingleObject(S,INFINITE) #define V(S) ReleaseSemaphore(S,1,NULL) #define rate 1000  #define CONSUMER_NUM 4 // 消费者个数 #define PRODUCER_NUM 4 // 生产者个数 #define BUFFER_NUM 4 // 缓冲区个数  char *thing[4]={"glass1","glass2","glass3","glass4"}; //公共的队列缓冲区  struct Buffer {  int product[BUFFER_NUM];  int front,rear;  }g_buf; //兔子线程 DWORD WINAPI Rabbit(LPVOID para)  {  int i =*(int*)para; //第 i 只小白兔&
    2022-05-23 06:18:02下载
    积分:1
  • achieve operating system threads
    操作系统中实现线程-achieve operating system threads
    2022-10-26 04:55:03下载
    积分:1
  • 696516资源总数
  • 106658会员总数
  • 16今日下载