使用Linux環(huán)境下C語言編程，實現(xiàn)隨機數(shù)的產(chǎn)生和數(shù)組的初始化。具體的實例如下。位示圖方法模擬磁盤塊的分配與回收。題目的描述：1. 要求在LINUX環(huán)境用C語言編程2. 假設有一個500行500列的矩陣來表示磁盤塊，狀態(tài)位是1表示已經(jīng)分配出去，狀態(tài)位是0表示空閑塊3. 給這個矩陣用隨機函數(shù)初始化，讓其布滿0和14. 寫程序統(tǒng)計有多少個空閑塊？5. 有一個程序文件要申請20個磁盤塊，能否分配？如果可以分配，給出分配塊的塊號地址，塊號=字號500+位號，并修改位示圖，塊號從0開始編址。6. 要回收第300塊和第580塊，如何實現(xiàn)？給出位示圖修改的程序#include #include #include #define row 500#define col 500unsigned int new_rand () int fd; unsigned int n = 0; fd = open (/dev/urandom, O_RDONLY); if (fd 0) read (fd, &n, sizeof (n); close (fd); return n; int statistics_free(unsigned int wst)int sum_free=0;/記錄空閑塊個數(shù)，并初始化int i_row=0;int i_col=0;for(;i_rowrow;i_row+)for(i_col=0;i_col 0) unsigned int r; int i; for (i = 0; i 512; i+) read (fd, &r, sizeof (r); ticks += r; close (fd); srand (ticks); unsigned int wstrowcol; /初始化數(shù)組為0,1 for(;i_rowrow;i_row+) for(i_col=0;i_colstatistics_free(wst)printf(The space dont enough);return;printf(The space address like this:n);for(;i_rowrow;i_row+)for(i_col=0;i_col0&wsti_rowi_col=0)wsti_rowi_col=1;ask-;/計算當前的分配塊號的地址address=i_row*row+i_col;printf(%d ,address);else if(ask=0)printf(nThe ask had request,the array is changed:n);for(t_row=0;t_rowrow;t_row+)for(t_col=0;t_colrow-1)printf(Your ask to free space dont find.);return;wstt_rowt_col=0;printf(nThe ask had request,the array is changed:n);for(r_row=0;r_rowrow;r_row+)for(r_col=0;r_colcol;r_col+)printf(%d ,wstr_rowr_col);printf(n);printf