C 语言实现分页式存储系统位示图管理，精准处理进程内存申请与分配

```c #include <stdio.h> #include <stdbool.h> #define BLOCKS 64 // 初始化位示图，已知的占用块号 bool bitmap[BLOCKS] = { [1] = true, [3] = true, [5] = true, [7] = true, [9] = true, [11] = true, [13] = true, [15] = true, [17] = true, [19] = true }; int main() { int process_requests[4]; // 存储四个进程请求的内存块数 int process_blocks[4] = {0}; // 存储每个进程已分配的内存块数 int process_start_block[4] = {-1, -1, -1, -1}; // 存储每个进程开始的块号 // 读取四个进程请求的内存块数 for (int i = 0; i < 4; i++) { scanf("%d", &process_requests[i]); } // 分配内存块 int current_block = 0; for (int i = 0; i < 4; i++) { int blocks_needed = process_requests[i]; int blocks_allocated = 0; while (blocks_allocated < blocks_needed && current_block < BLOCKS) { if (!bitmap[current_block]) { bitmap[current_block] = true; blocks_allocated++; if (process_start_block[i] == -1) { process_start_block[i] = current_block; } } current_block++; } process_blocks[i] = blocks_allocated; } // 读取进程编号和页号 int process_id, page_number; scanf("%d %d", &process_id, &page_number); process_id--; // 调整为0索引 // 检查进程是否已经分配足够的内存块 if (process_blocks[process_id] < process_requests[process_id]) { printf("wait\n"); } else if (page_number >= 0 && page_number < process_requests[process_id]) { int block_number = process_start_block[process_id] + page_number; printf("%d\n", block_number); } else { printf("error\n"); } return 0; } ``` ### 需要注意的逻辑点： 1. **位示图初始化**：确保已知的占用块号在位示图中正确标记为已占用。 2. **内存分配顺序**：按照从上到下、从左到右的顺序扫描位示图，选择空块进行分配。 3. **边界条件检查**：确保进程编号和页号在合理范围内，避免数组越界错误。 ######[AI写代码神器 | 601点数解答 | 2024-11-22 11:16:36]