| 硬盘分区数据文件的寻簇链计算 |
| |
| 引用本文： | 苏云成,宋如敏. 硬盘分区数据文件的寻簇链计算[J]. 数字社区&智能家居, 2009, 0(22) |
| |
| 作者姓名： | 苏云成 宋如敏 |
| |
| 作者单位： | 徐州师范大学计算机科学与技术学院;江苏联合职业技术学院徐州生物工程分院; |
| |
| 摘 要： | 该文介绍了硬盘分区的组织结构和数据结构,阐述了硬盘分区表的组织结构以及组成,并用实例说明FAT文件寻簇链的计算过程。
|
| 关 键 词： | FAT 数据结构 硬盘分区表 寻簇链 |
The Hard Disk District Data File Seeks the Bunch of Chain Computation |
| |
| SU Yun-cheng,SONG Ru-min. The Hard Disk District Data File Seeks the Bunch of Chain Computation[J]. Digital Community & Smart Home, 2009, 0(22) |
| |
| Authors: | SU Yun-cheng SONG Ru-min |
| |
| Affiliation: | 1.Xuzhou Normal University in School of Computer Science & Technology;Xuzhou 221000;China;2.Xuzhou Biological Engineering Department of Jiangsu United Vocational College;Xuzhou 221006;China |
| |
| Abstract: | This article introduced the hard disk district organizational structure and the construction of data,elaborated the hard disk district table organizational structure as well as the composition,and with the example showed the FAT document seeks a bunch of chain the computation process. |
| |
| Keywords: | FAT construction of data hard disk partition table find cluster chain |
| 本文献已被 CNKI 等数据库收录！ |
