C 语言实现：分页式存储系统位示图管理与进程内存分配模拟

```c #include <stdio.h> #include <string.h> #define SIZE 8 #define TOTAL_BLOCKS (SIZE * SIZE) int bitmap[TOTAL_BLOCKS]; int process_requests[4][54]; // 每个进程最多申请54个页面 void initialize_bitmap() { memset(bitmap, 0, sizeof(bitmap)); for (int i = 1; i <= 19; i += 2) { bitmap[i] = 1; // 初始化占用的块 } } int find_free_block() { for (int i = 0; i < TOTAL_BLOCKS; i++) { if (bitmap[i] == 0) { return i; } } return -1; // 没有找到空闲块 } void assign_memory(int process_id, int num_pages) { int assigned_blocks = 0; for (int i = 0; i < TOTAL_BLOCKS && assigned_blocks < num_pages; i++) { if (bitmap[i] == 0) { bitmap[i] = 1; process_requests[process_id - 1][assigned_blocks] = i; assigned_blocks++; } } } int main() { int requests[4], n, m; initialize_bitmap(); // 读取四个进程的内存请求 for (int i = 0; i < 4; i++) { scanf("%d", &requests[i]); } // 分配内存给每个进程 for (int i = 0; i < 4; i++) { if (find_free_block() != -1) { assign_memory(i + 1, requests[i]); } else { printf("wait\n"); return 0; } } // 读取进程编号和页号 scanf("%d %d", &n, &m); if (m >= 0 && m < requests[n - 1]) { printf("%d\n", process_requests[n - 1][m]); } else { printf("error\n"); } return 0; } ``` ######[AI写代码神器 | 591点数解答 | 2024-11-22 10:19:15]