登录
首页 » 电子书 » 各种4000系列芯片的数据手册,希望能给广大软硬件工程师提供方便...

各种4000系列芯片的数据手册,希望能给广大软硬件工程师提供方便...

于 2022-04-18 发布 文件大小:3.09 MB
0 66
下载积分: 2 下载次数: 1

代码说明:

各种4000系列芯片的数据手册,希望能给广大软硬件工程师提供方便-A variety of 4000 Series chip data sheet, hoping to give the vast numbers of hardware and software engineers to facilitate the

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

发表评论

0 个回复

  • 这个很重要 可以好好帮助 不信你可以下来看看 真的很好 看看哦...
    这个书很重要 可以好好帮助 不信你可以下来看看 真的很好 看看哦-this very important book which can help not believe you can look down to see really good oh
    2022-09-01 14:35:03下载
    积分:1
  • c language commonly used algorithm, very useful.
    c语言常用算法,非常有用。-c language commonly used algorithm, very useful.
    2023-08-11 06:00:04下载
    积分:1
  • vc串口通信代码,比较经典的一个代码,很不错,值得学习哦。...
    vc串口通信代码,比较经典的一个代码,很不错,值得学习哦。-vc serial communication code, a code comparison classic, very good, it is worth learning Oh.
    2022-03-22 02:42:32下载
    积分:1
  • VC based programming guides, welcome to download for use. Strongly recommended
    VC 基础编程教程,欢迎下载使用。强烈推荐-VC based programming guides, welcome to download for use. Strongly recommended
    2023-05-22 13:15:03下载
    积分:1
  • Windows程序设计(版)
    Windows程序设计(电子版)-Windows programming (electronic version)
    2022-08-24 19:07:47下载
    积分:1
  • 这种有条理的文字渴望提出各种相关的操作信息…
    This methodical text aspires to present various information relevant to operating systems, computer architecture, compilers, principles of programming languages, and C and C++ programming, specifically.
    2023-05-14 07:05:04下载
    积分:1
  • WINDOWS VISTA BUSINESS DESKTOP STUDENT GUIDE
    WINDOWS VISTA BUSINESS DESKTOP STUDENT GUIDE
    2023-08-01 17:00:03下载
    积分:1
  • 图论中最小生成树Kruskal算法 及画图程序 M
    图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W):n为图顶点数,W为图的带权邻接矩阵,不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w) -Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]
    2022-01-30 21:32:39下载
    积分:1
  • The code for the JN5121 chip company Jennic battery voltage measurement test pro...
    本代码为Jennic公司芯片JN5121 电池电压测量测试程序-The code for the JN5121 chip company Jennic battery voltage measurement test procedure
    2022-02-19 22:45:17下载
    积分:1
  • LPC3250的U
    LPC3250 u-boot和linux内核的移植。-LPC3250 u-boot and linux kernel transplant.
    2023-01-10 17:10:03下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载