虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

TIA-<b>ipr</b>-IS

  • 1、 了解系统调用fork()、execl()、exit()、getpid()和waitpid()的功能和实现过程 2、 编写一段程序实现以下功能: a) 使用系统调用fork()创建两个子进程

    1、 了解系统调用fork()、execl()、exit()、getpid()和waitpid()的功能和实现过程 2、 编写一段程序实现以下功能: a) 使用系统调用fork()创建两个子进程 b) 父进程重复显示字符串”parent:”,并使用函数getpid()显示自己的进程ID。 c) 两个子进程分别重复显示字符串”child:”,并使用函数getpid()显示自己的进程ID 3、 编写一段程序实现以下功能: a) 使用系统调用fork()创建一个子进程 b) 子进程显示自己的进程ID和字符串": The child is calling an exec.\n",然后通过execl()调用系统命令ps显示当前运行的进程情况,从而更换自己的执行代码,最后调用exit()结束。 c) 父进程显示自己的进程ID和字符串” ": The parent is waiting for child to exit.\n ",然后调用waitpid()等待子进程结束,并在子进程结束后显示”The parent exit.\n

    标签: fork waitpid getpid execl

    上传时间: 2013-12-18

    上传用户:叶山豪

  • Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search ma

    Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.

    标签: Implemented following compile command

    上传时间: 2014-01-01

    上传用户:lhc9102

  • BNB20 Finds the constrained minimum of a function of several possibly integer variables. % Usage: [

    BNB20 Finds the constrained minimum of a function of several possibly integer variables. % Usage: [errmsg,Z,X,t,c,fail] = % BNB20(fun,x0,xstatus,xlb,xub,A,B,Aeq,Beq,nonlcon,settings,options,P1,P2,...) % % BNB solves problems of the form: % Minimize F(x) subject to: xlb <= x0 <=xub % A*x <= B Aeq*x=Beq % C(x)<=0 Ceq(x)=0 % x(i) is continuous for xstatus(i)=0 % x(i) integer for xstatus(i)= 1 % x(i) fixed for xstatus(i)=2 %

    标签: constrained variables function possibly

    上传时间: 2014-01-13

    上传用户:youth25

  • The purpose of this application note is to describe the main elements of an RS-422 and RS-485 syste

    The purpose of this application note is to describe the main elements of an RS-422 and RS-485 system. This application note attempts to cover enough technical details so that the system designer will have considered all the important aspects in his data system design. Since both RS-422 and RS- 485 are data transmission systems that use balanced differential signals, it is appropriate to discuss both systems in the same application note. Throughout this application note the generic terms of RS-422 and RS-485 will be used to represent the EIA/TIA-422 and EIA/TIA-485 Standards.

    标签: application describe elements purpose

    上传时间: 2013-12-29

    上传用户:sxdtlqqjl

  • [输入] 图的顶点个数N

    [输入] 图的顶点个数N,图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径,则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法,从顶点A开始,依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B,则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M,再访问与VA2邻接顶点...,如此下去,直至找到B,最先到达B点的路径,一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点,然后将队头顶点从队列中删去。若队空,则说明到不存在通路。在访问顶点过程中,每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来,以便输出时回溯。 #include<stdio.h> int number //队列类型 typedef struct{ int q[20]

    标签: 输入

    上传时间: 2015-11-16

    上传用户:ma1301115706

  • the calculator s usage! after you have inputed 2 operators,choose + - * / function! But the only

    the calculator s usage! after you have inputed 2 operators,choose + - * / function! But the only situation I did t deal with is that when you choos + fuction ,and the operaters signs is like this -A+B,just turn it to B-A!

    标签: calculator the operators function

    上传时间: 2016-02-12

    上传用户:lili123

  • 1) Write a function reverse(A) which takes a matrix A of arbitrary dimensions as input and returns a

    1) Write a function reverse(A) which takes a matrix A of arbitrary dimensions as input and returns a matrix B consisting of the columns of A in reverse order. Thus for example, if A = 1 2 3 then B = 3 2 1 4 5 6 6 5 4 7 8 9 9 8 7 Write a main program to call reverse(A) for the matrix A = magic(5). Print to the screen both A and reverse(A). 2) Write a program which accepts an input k from the keyboard, and which prints out the smallest fibonacci number that is at least as large as k. The program should also print out its position in the fibonacci sequence. Here is a sample of input and output: Enter k>0: 100 144 is the smallest fibonacci number greater than or equal to 100. It is the 12th fibonacci number.

    标签: dimensions arbitrary function reverse

    上传时间: 2016-04-16

    上传用户:waitingfy

  • T-kernel 的extension源代码

    T-kernel 的extension源代码,是日本最著名的T-kernel所独有的,适合开发T-kernel的朋友们使用! TK/SE is the program that extends T-Kernel and provides the functions such as a file system and a process management. The TK/SE archive to be provided is comprised of the main portion and the 2 extended file system portions, and TK/SE object is built by adding these to T-Kernel source. a) tkernel_se_1.00.00.tar.gz Main source of T-Kernel/SE b) extfs_fatfs_1.00.00.tar.gz Difference source of T-Kernel/SE extended file system (FAT) c) extfs_cdrom_1.00.00.tar.gz Difference source of T-Kernel/SE extended file system (CD-ROM)

    标签: extension T-kernel 源代码

    上传时间: 2014-01-20

    上传用户:czl10052678

  • Thinking in Java, 3rd ed. Revision 4.0 Preface Introduction 1: Introduction to Objects 2

    Thinking in Java, 3rd ed. Revision 4.0 Preface Introduction 1: Introduction to Objects 2: Everything is an Object 3: Controlling Program Flow 4: Initialization & Cleanup 5: Hiding the Implementation 6: Reusing Classes 7: Polymorphism 8: Interfaces & Inner Classes 9: Error Handling with Exceptions 10: Detecting Types 11: Collections of Objects 12: The Java I/O System 13: Concurrency 14: Creating Windows & Applets 15: Discovering Problems 16: Analysis and Design A: Passing & Returning Objects B: Java Programming Guidelines C: Supplements D: Resources Index

    标签: Introduction Thinking Revision Preface

    上传时间: 2014-07-13

    上传用户:netwolf

  • This utility has two views: (a) one view that will show you the entire PnP enumeration tree of devic

    This utility has two views: (a) one view that will show you the entire PnP enumeration tree of device objects, including relationships among objects and all the device s reported PnP characteristics, and (b) a second view that shows you the device objects created, sorted by driver name. There is nothing like this utility available anywhere else.

    标签: enumeration utility entire devic

    上传时间: 2013-12-17

    上传用户:zjf3110