Search - address memory

Search - address memory - List

[Data structs] Cyuyanjiaocheng DL : 0: Ｃ语言是一种结构化语言。它层次清晰，便于按模块化方式组织程序，易于调试和维护。Ｃ语言的表现能力和处理能力极强。它不仅具有丰富的运算符和数据类型，便于实现各类复杂的数据结构。它还可以直接访问内存的物理地址，进行位(bit)一级的操作。由于Ｃ语言实现了对硬件的编程操作，因此Ｃ语言集高级语言和低级语言的功能于一体。既可用于系统软件的开发，也适合于应用软件的开发。-C language is a structured language. It is level, clear and easy modular approach according to organizational procedures, easy to debug and maintain. C language, strong performance capabilities and processing power. It not only has a rich operators and data types, is easy to realize all kinds of complex data structures. It can also directly access the physical address of the memory to carry out bit (bit) an operation. As the C language to implement the hardware programming operation, so C-set high-level language and low-level language functions in one. Can be used for system software development, is also suitable for application software development.
Date : 2026-01-11 Size : 194kb User : linhaicong168
[Data structs] 4 DL : 0: 无向图功能实现，用邻接多重表存储该无向图，并使用动态存储结构。用一个单链表把所有顶点存储起来，在存储边的节点中给出该边的两个顶点的各自的下一条边的节点地址。-Undirected graph implementation of function, with the adjacent multi-table to store the graph, and using dynamic storage structures. With a single list of all vertices stored in the memory of the node is given two vertices of the respective side edge of the next node address.
Date : 2026-01-11 Size : 1kb User : stanley
[Data structs] LRUsuanfamoni DL : 0: 1．通过本实验的模拟算法理解和加深页式存储管理的地址变换过程。 2．通过模拟LRU算法加强理解和掌握OS中实现虚拟存储器的关键技术。 -1. Through this experiment, the simulation algorithm and deepen understanding of storage management page address translation process. 2. LRU algorithm through simulation to enhance understanding and grasp of OS, the key technology of virtual memory.
Date : 2026-01-11 Size : 8kb User : LIULIU
[Data structs] cPP DL : 0: Fibonacci数列为数组分配一动态内存并将首地址赋给指针变量p //求整数，长整数，双精度数的二次方根 //百钱问题-Fibonacci numbers as an array of dynamic memory allocation of a pointer variable and assign the address of the first p// find integer, long integer, double the number of secondary root// percentage of money problems
Date : 2026-01-11 Size : 1kb User : 华
[Data structs] page-management DL : 0: 模拟分页式虚拟存储管理中硬件的地址转换和缺页中断，以及选择页面调度算法处理缺页中断-Analog paging virtual memory management hardware address translation and page fault, and choose a paging algorithm processing a page fault.
Date : 2026-01-11 Size : 2kb User : duane
[Data structs] Staff-management-system DL : 0: 职工管理系统数据结构课程设计 1.1问题描述　　对单位的职工进行管理，包括插入、删除、查找、排序等功能。 1.2要求　　职工对象包括工号、姓名、性别、出生年月、工作年月、学历、职务、住址、电话等信息。（1）新增一名职工：将新增职工对象按姓名以字典方式存入职工管理文件中。（2）删除一名职工：从职工管理文件中删除一名职工对象。（3）查询：从职工管理文件中查询符合某些条件的职工。（4）修改：检索某个职工对象，对其某些属性进行修改。（5）排序：按某种需要对职工对象文件进行排序。 1.3实现提示　　职工对象数不必很多，便于一次读入内存，所有操作不经过内外存交换。（1）由键盘输入职工对象，以文件方式保存。程序执行时先将文件读入内存。（2）对职工对象中的"姓名"按字典顺序进行排序。（3）对排序后的职工对象进行增加、删除、查询、修改、排序等操作。-Staff management system Data Structure Course Design 1.1 Description of the problem Management of unit staff, including insert, delete, search, sort and other functions. 1.2 requirements Workers, including job number object, name, sex, date of birth, years of work, education, job, address, telephone and other information. (1) Add a workers: workers will be added to the dictionary object by name way into staff management file. (2) Delete a staff: staff management of files deleted from a worker object. (3) query: query from the staff manage files of employees subject to certain conditions. (4) Review: a worker objects to retrieve, modify some of its properties. (5) Ordering: some kind of object file workers need to be sorted. 1.3 to achieve prompt Number of objects do not have a lot of employees, to facilitate a read into memory, all operations inside and outside the deposit without the exchange. (1) from the keyboard input of workers object to save the papers.
Date : 2026-01-11 Size : 157kb User : lynne
[Data structs] 4zhongyemiandiaodusuanfa DL : 0: 基于一个虚拟存储区和内存工作区，设计下述算法并计算访问命中率。 1、最佳淘汰算法（OPT） 2、先进先出的算法（FIFO） 3、最近最久未使用算法（LRU） 4、简单时钟(钟表)算法（CLOCK）命中率＝１－页面失效次数／页地址流(序列)长度 -Based on a virtual memory storage area and work area, the following algorithm design and calculate the hit rate. 1, the best replacement algorithm (OPT) 2, FIFO method (FIFO) 3, the most recent time the use of the algorithm (LRU) 4, simple clock (clock) algorithm (CLOCK) hit rate = 1- the number of page faults/page address stream (sequence) length
Date : 2026-01-11 Size : 3kb User : 颜灏澜
[Data structs] algorithm DL : 0: 一个以hash表形式存储的数据结构体，通过hash算法能够快速的找到内存存储地址。-A data structure stored in hash format, through the hash algorithm can quickly find the memory address.
Date : 2026-01-11 Size : 13kb User : HUQ