C语言实现：分页式存储系统 8*8 块存储器位示图管理及进程内存分配查询

```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)); } void mark_occupied(int block_number) { if (block_number >= 0 && block_number < TOTAL_BLOCKS) { bitmap[block_number] = 1; } } int find_free_block() { for (int i = 0; i < TOTAL_BLOCKS; i++) { if (bitmap[i] == 0) { return i; } } return -1; } void load_process(int process_id, int num_pages) { int loaded_pages = 0; for (int i = 0; i < num_pages; i++) { int free_block = find_free_block(); if (free_block != -1) { process_requests[process_id - 1][i] = free_block; mark_occupied(free_block); loaded_pages++; } else { break; } } if (loaded_pages < num_pages) { printf("wait\n"); } } int main() { int requests[4], n, m; initialize_bitmap(); // 标记已占用的块 int occupied_blocks[] = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19}; for (int i = 0; i < sizeof(occupied_blocks) / sizeof(occupied_blocks[0]); i++) { mark_occupied(occupied_blocks[i]); } // 读取进程请求 scanf("%d %d %d %d", &requests[0], &requests[1], &requests[2], &requests[3]); // 加载进程到内存中 for (int i = 0; i < 4; i++) { load_process(i + 1, requests[i]); } // 处理查询请求 scanf("%d %d", &n, &m); if (m < 0 || m >= 54 || n < 1 || n > 4) { printf("error\n"); } else { int block_number = process_requests[n - 1][m]; if (block_number == 0 && m != 0) { // 如果该页未被分配，则输出error printf("error\n"); } else { printf("%d\n", block_number); } } return 0; } ``` ######[AI写代码神器 | 752点数解答 | 2024-12-02 10:39:21]