-
LFS(linux from scratch)的文档，包括lfs
LFS(linux from scratch)的文档，包括lfs-6.2,blfs-6.1,lfs-2006-8-3和lfs-book-svn-2006-7-31-LFS (linux from scratch) of documents, including LFS-6.2, blfs- 6.1, LFS-2006-8-3 and the LFS-book-svn-2006-7-31
- 2022-01-25 19:47:02下载
- 积分：1
-
SD卡手册中文翻译第3章，相信会给大家有些帮助
SD卡手册中文翻译第3章，相信会给大家有些帮助-SD card manual Chinese translation of Chapter 3, I believe that everyone will give some help
- 2022-04-15 19:55:43下载
- 积分：1
-
伺服控制
伺服控制伺服控制 de posicion stm8105c6，使用两个 gpio 并用定时器 1 次惊险 pwm 信号，
- 2022-10-28 06:00:04下载
- 积分：1
-
operating system with the further understanding of algorithms, and to further un...
操作系统用的进一步理解各种算法的性能，并且进一步理解各种页面替换算法的优缺点。 -operating system with the further understanding of algorithms, and to further understanding of pages replacement algorithm are discussed.
- 2022-01-25 20:40:52下载
- 积分：1
-
随即点名 随即点名 随即点名
随即点名 随即点名 随即点名-Was named immediately after the division was named the division
- 2022-02-05 09:01:24下载
- 积分：1
-
关于滤波器的一些源程序，里面有详细的说明
关于滤波器的一些源程序，里面有详细的说明-On a number of source filters, which is described in detail
- 2022-01-26 02:10:46下载
- 积分：1
-
单片机DAC0832方波锯齿波自己做的验证过
单片机DAC0832方波锯齿波自己做的验证过-DAC0832 Singlechip sawtooth square had its own authentication
- 2023-06-20 22:45:02下载
- 积分：1
-
大部份单片机中，没有USB 主机，要读写U盘，不妨用SL811，扩展，代码OK
大部份单片机中，没有USB 主机，要读写U盘，不妨用SL811，扩展，代码OK-Most single-chip, there is no USB host, it is necessary to read and write U disk, may wish to use SL811, expansion, code OK
- 2022-07-15 19:43:02下载
- 积分：1
-
很好的一个留言本，虽然不是我原创，可是我觉得对大家很有用处，也很值得学习！...
很好的一个留言本，虽然不是我原创，可是我觉得对大家很有用处，也很值得学习！-good a voice Though this is not my original, but I think we had some very useful and very worthwhile learning!
- 2023-09-03 13:15:04下载
- 积分：1
-
通用二叉搜索树，包含的算法有：输出广度优先遍历、前序、中序、后序遍历结果，按树的形状打印树，统计总节点数，统计叶子节点数，统计右节点数，计算树的高度，删除所有叶...
通用二叉搜索树，包含的算法有：输出广度优先遍历、前序、中序、后序遍历结果，按树的形状打印树，统计总节点数，统计叶子节点数，统计右节点数，计算树的高度，删除所有叶子节点，插入节点，查找节点，删除节点，由前序遍历结果和中序遍历结果生成树，由后序遍历结果和中序遍历结果生成树，检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth- first traversal, the former sequence, sequence, after the preorder, the shape of the tree by tree print, the total number of nodes statistics, statistics leaf nodes, the nodes to the right statistics to calculate tree height, remove all leaf nodes, insert nodes, the nodes you delete nodes from the former preorder results and the results of Spanning Tree preorder, After the preorder from the results and the results preorder spanning tree, check whether the tree balanced and complete balance.
- 2022-06-28 10:58:58下载
- 积分：1
