Informatika fanini o’qitishda noan’anaviy usullar va sinfdan tashqari ishlarning ahamiyati

Masala-1. Agar

+ AA

BB

SBS

bo‘lsa, u holda A, B, S raqamlarni topish dasturi tuzilsin.
Yechish:
Bu masalani yechish uchun o‘nlik sanoq sistemasidagi sonlarni standart ko‘rinishini esga olish kifoya, ya’ni:
AA + BB = A*10 + A + B*10 + B = (A+B)*10 + (A+B) = (A+B)*11
SBS = S*100 + B*10 + S = S*101 + B*10.
Shartga ko‘ra A, B, S lar raqam. Shuning uchun ularning qiymati 1 dan 9 gacha bo‘lishi mumkin (nima uchun 0 bo‘lishi mumkin emasligini o‘zingiz o‘ylab ko‘ring).
Program Yigindi;
Uses Crt;
Var a,b,s:Integer;
Begin
TextColor(Yellow); TextBackGround(Blue);
ClrScr;
For a:=1 To 9 Do
Begin
For b:=1 To 9 Do
Begin
For s:=1 To 9 Do
Begin
If (11*(a+b))=(101*s+10*b) Then WriteLn(‘A=’,a,’ B=’,b,’ S=’,s);
end;
end;
end;
ReadLn;
end.
Masala-2. A(n) butun qiymatli massiv elementlari ichida eng ko‘p takrorlanganini toping. Bunday elementlar ko‘p bo‘lsa, bittasini chop eting.
Yechish:
Eng ko‘p takrorlangan element qiymatini MAX bilan, tartib raqamini esa MAXN bilan belgilaymiz. Dasturi quyidagicha:
Program Eng_kop_takror;
Uses Crt;
Const n1=100;
Var a:Array[1..n1] of Integer;
max,maxn,sum:Integer;
i,j,n:Integer;
Begin
TextColor(Yellow); TextBackground(Blue); ClrScr;
WriteLn(‘ Massiv o`lchamini kiriting:’);
Write(‘ N = ‘);ReadLn(n);
WriteLn(‘ Massiv elementlarini kiriting:’);
For i:=1 To n Do
Begin
Write(‘A(‘,i,’) = ‘);ReadLn(a[i]);
end;
max:=1; maxn:=1;
For i:=1 To n-1 Do
Begin
sum:=0;
For j:=i+1 To n Do
Begin
If a[i]=a[j] Then Inc(sum);
end;
If sum>max Then Begin max:=sum; maxn:=i; end;
end;
WriteLn; WriteLn(‘A(‘,Maxn,’) = ‘,a[maxn],’ element eng ko`p takrorlanadi’);
ReadLn;
End.