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

Masala-8. Istagan butun sonni 17 ga qoldiqsiz bo’linishi yoki bo’linmasligini aniqlovchi dastur tuzing.
Program M_7;
Var N:Integer;
Begin
Write(‘N=’);Readln(N);
If N/17=Int(N/17) then Write(‘Bu son 17 ga qoldiqsiz bo’linadi’)
Else Write(‘Bu son 17 ga qoldiqsiz bo’linmaydi’);
End.
Masala-9. ax+b=0 chiziqli tenglamani yechish dasturini tuzing.( x=-b/a)
Program M_8;
Label N1;
Var a,b,x;Real;
Begin
Write(‘a=’);Readln(a);
Write(‘b=’);Readln(b);
If a<>0 then Goto N1 else Write(‘tenglama yechimga ega emas’);
N1: x:=-b/a;
End.
Masala-10. Kvadrat tenglama yechish dasturini tuzing.
Program M_9;
Var a,b,c,D,x,x1,x2:Real;
Begin
Write(‘a=’);Readln(a);
Write(‘b=’);Readln(b);
Write(‘c=’);Readln(c);
D: = sqr(b)-4*a*c;
If D>0 then begin
x1:=(-b+sqrt(D))/(2*a);
x2:= (-b+sqrt(D))/(2*a); Writeln (‘x2=’,x2:4:2);
end;
else if D=0 then
begin
Writeln(‘Yechim bitta:’); x:= -b/(2*a);
Writeln (‘x=’,x:4:2);
End;
Else Write (‘Haqiqiy ildizlar yo’q);
Readln;
End.
Masala-11. Fibonachchi sonlari F₀=F₁=1 va F_n=F_n-1+F_n-2formula bilan topiladi.
1000 dan katta bo’lgan birinchi fibonachchi sonini toping.
Programm fibonachchi;
Var F0,F1,F2: Integer;
begin
F0:=1; F1:=1;
Repeat
F2:= F1 + F0; F0:=F1; F1:= 2;
until F2 > 1000;
Writeln (‘izlangan son =’; F2);
end.
Sinf:5
Fan:Informatika
Mavzu:Paint uskunalar paneli va undan foydalanish
Darsning texnologik xaritasi

№