自考工学类操作系统原理复习资料文档格式.docx
《自考工学类操作系统原理复习资料文档格式.docx》由会员分享,可在线阅读,更多相关《自考工学类操作系统原理复习资料文档格式.docx(156页珍藏版)》请在冰点文库上搜索。
![自考工学类操作系统原理复习资料文档格式.docx](https://file1.bingdoc.com/fileroot1/2023-4/30/0db129eb-2428-4995-bbde-473562937e5b/0db129eb-2428-4995-bbde-473562937e5b1.gif)
*/
FILE*rf,*wf;
inti,a,b;
longc;
rf=fopen("
C:
\\WEXAM\\24990001\\in.dat"
"
r"
);
wf=fopen("
\\WEXAM\\24990001\\out.dat"
"
w"
for(i=0;
i<
10;
i++){
fscanf(rf,"
b);
c);
fprintf(wf,"
a=%d,b=%d,c=%ld\n"
a,b,c);
}
fclose(rf);
fclose(wf);
2、
*c=(b/10)*1000+(a%10)*100+(b%10)*10+(a/10);
%ld\n"
3、
*c=(b%10)*1000+(a%10)*100+(b/10)*10+(a/10);
4、
*c=(a%10)*1000+(b/10)*100+(a/10)*10+(b%10);
5、
floatfun(float*a,intn)
inti;
floatave=0.0;
for(i=0;
i<
n;
i++)ave=ave+a[i];
ave=ave/n;
returnave;
{floatscore[30]={90.5,72,80,61.5,55},aver;
aver=fun(score,5);
printf("
\nAveragescoreis:
%5.2f\n"
aver);
NONO();
FILE*fp,*wf;
inti,j;
floataver,score[5];
fp=fopen("
for(j=0;
j<
5;
j++)fscanf(fp,"
%f,"
&
score[j]);
aver=fun(score,5);
%5.2f\n"
aver);
fclose(fp);
6、
char*fun(char*s,char*t)
inti;
char*p=s,*q=t;
*p&
&
*q;
p++;
q++;
if(*p==0&
*q==0)returns;
if(*p)returns;
elsereturnt;
main()
{chara[20],b[20];
Input1thstring:
gets(a);
Input2thstring:
gets(b);
%s\n"
fun(a,b));
NONO();
inti;
chara[20],b[20];
fscanf(fp,"
%s%s"
a,b);
fun(a,b));
7、
#defineM100
voidfun(intm,int*a,int*n)
inti;
*n=0;
for(i=7;
=m;
i++)
if((i%7==0)||(i%11==0))a[(*n)++]=i;
{intaa[M],n,k;
fun(50,aa,&
n);
for(k=0;
k<
n;
k++)
if((k+1)%20==0)printf("
\n"
elseprintf("
%4d"
aa[k]);
NONO();
inti,n,j,k,aa[M],sum;
%d,"
j);
fun(j,aa,&
n);
sum=0;
for(k=0;
n;
k++)sum+=aa[k];
%d\n"
sum);
8、
string.h>
voidfun(char*ss)
for(i=1;
strlen(*ss);
i+=2){
if(ss[i]>
='
a'
&
ss[i]<
z'
)ss[i]-=32;
{chartt[81];
\nPleaseenteranstringwithin80characters:
);
gets(tt);
\n\nAfterchanging,thestring\n\"
%s\"
tt);
fun(tt);
\nbecomes\n\"
chartt[81];
%s"
tt);
fun(tt);
9、
voidfun(char*s,chart[])
inti,j=0;
strlen(s);
i+=2)
if(s[i]%2==0)t[j++]=s[i];
t[j]=0;
chars[100],t[100];
\nPleaseenterstringS:
s);
fun(s,t);
\nTheresultis:
%s\n"
t);
chars[100],t[100];
s);
fun(s,t);
t);
10、
inti,j=0;
strlen(s);
i+=2)t[j++]=s[i];
11、
i++)if(s[i]%2)t[j++]=s[i];
NONO()
12、
#defineN10
typedefstructss
{charnum[10];
ints;
}STU;
fun(STUa[],STU*s)
inti,max=a[0].s,j=0;
N;
if(max<
a[i].s){
j=i;
max=a[i].s;
*s=a[j];
main()
{STUa[N]={{"
A01"
81},{"
A02"
89},{"
A03"
66},{"
A04"
87},{"
A05"
77},
{"
A06"
90},{"
A07"
79},{"
A08"
61},{"
A09"
80},{"
A10"
71}},m;
*****Theoriginaldata*****\n"
for(i=0;
N;
i++)printf("
No=%sMark=%d\n"
a[i].num,a[i].s);
fun(a,&
m);
printf("
*****THERESULT*****\n"
Thetop:
%s,%d\n"
m.num,m.s);
NONO()
STUa[N],m;
10;
i++)fscanf(rf,"
%s%d"
a[i].num,&
a[i].s);
fun(a,&
m);
fprintf(wf,"
%s,%d\n"
m.num,m.s);
13、
stdlib.h>
#defineN5
intfun(inta[][N],intn)
inti,j;
=i;
j++)
a[i][j]*=n;
{inta[N][N],n,i,j;
*****Thearray*****\n"
for(i=0;
N;
i++)
{for(j=0;
j<
j++)
{a[i][j]=rand()%10;
a[i][j]);
don=rand()%10;
while(n>
=3);
n=%4d\n"
n);
fun(a,n);
j++)printf("
inti,j,n,a[5][5];
%d"
a[i][j]);
%d"
fun(a,n);
for(i=0;
5;
i++){
for(j=0;
j++)fprintf(wf,"
14、
intfun(inta[][N])
a[i][j]=0;
{inta[N][N],i,j;