Tayanch so’zlar va iboralar

Modul, kompilyator, xotira xajmi, moslashtiruvchi, otladkachi, jadvallar, faoliyat sharti,optsiyalarni diskka yozish, optsiyalarni diskdan o`qish, protsеdura, dinamik, konstruktsiya, kompilyatsiya.

1. Turbo-Paskal muxitida saxifaning umumiy ko`rinishi.

2. Faylni katalogdan axtarish.

3. Mеnyu satrining aloxida vazifalari.

4. Dasturni kompilyatsiyalash deganda nimani tushunasiz.

5. Tizimni konfiguratsiyalash fayli.

6. Turbo-Paskalning qo`shimcha modullari.

7. Tasvir dasturlari ishlatilishi uchun zarur fayl.

8.Vidiеotizimlarni moslashtiruvchi drayvеrlar.

Mavzu bo`yicha namunaviy test savollari

1. Dasturning bajarilishi qaysi buyruq orqali amalga oshiriladi.

a) goto

b) run

d) file

a) turbo. tpl

b) turbo. tpu

c) turbo. exe

d) hammasi to`g`ri

3. Yangi dastur matnini kiritish qaysi buyruq orqali amalga oshiriladi

a) save

b) load

d) print

a) save

c) edit

5. Dastur matnini xotiradan o`qish uchun qaysi buyruq ishlatiladi

a) print

b) save

d) open

a) dasturlarni yozish

b) dasturlarni tahlil qilish

c) dasturlarni bajarish

d) dasturlarni o`qish

7. Dasturdan sistemaga chiqish uchun qaysi buyruq ishlatiladi

a) load

b) compile

d) hammasi to`g`ri

8. Dasturni chop etish uchun qanday buyruqdan foydalaniladi

a) write

c) run

9. Quyidagilardan qaysi fikr noto`g`ri

Edit bo`limida:

a) dastur chop ettiriladi

b) belgilangan bo`lakni olib tashlanadi

c) bo`lakni nusxasini hosil qilinadi

d) hammasi to`g`ri

10. Quyidagilardan qaysi biri to`g`ri yozilgan

a) turbo.tp – tizimni konfiguratsiya-lash fayli

b) turbo.tpl – qo`shimcha modullar

c) turbo.hlp – ma`lumotlar jamlanmasi

d) hammasi to`g`ri

1. 
   O`.T.Haitmatov va b.Informatika va axborot texnologiyalari. O’quv qo’llanma. T. TKTI. 2005 y.
   
2. 
   O`.T.Haitmatov va b. Informatika va axborot texnologiyalari fanidan laboratoriya ishlarini bajarish ushun uslubiy qo’llanma. T. TKTI. 2005 y.
   
3. 
   Holmatov T.X.,Toyloqov N.I. Amaliy matematika,dasturlash va kompyuterning dasturiy ta’minoti. T.Mexnat, 2000 .
   
4. 
   Kadirova N.R. Polatov A.M. Programmirovanie na yasike Paskal T.2004
   
5. 
   Aripov M., Xaydarov A. Informatika asoslari T. “O`qituvchi” 2002 .
   

1) program Brak;

const eps=0.5; var B: array[byte]of real; i, n , s : integer; a : real; p : boolean;

begin

readln(B[i]); if (b[i]<(a-eps)) or (b[i]>(a+eps)) then begin

p:=true; s:=s+1; end end; if p then writeln(s) else writeln(a)

end.

const N1=10;

type

Matrice = array[1..N1,1..N1] of real;

Function Det (A: Matrice; N: integer) : real;

var B: matrice; I: integer; T, Mn, S : real;

Function Minor (var C: matrice; A: Matrice; N, I, J : integer) : real;

var Im, Jm, Ia, Ja, Nm : integer; begin Nm :=N-1; Im :=1; Ia :=1;

while Im < = Nm do if Ia < >I then begin Jm : =1; Ja : =1;

while Jm<=Nm do if Ja < > J then begin C [Im, Jm] : = A [Ia, Ja];

Ja : =Ja+1; Jm : =Jm+1; end else Ja : =Ja+1; Ia : =Ia+1; Im : =Im+1;

end else Ia : =Ia+1; end; begin if N=1 then Det : =A[N,N];

if N=2 then Det : =A[1, 1]*A[2, 2]-A[2, 1]*A[1, 2]; if N>2 then

begin S : =0; for I : =1 to N do begin

Mn : =Minor(B, A, N, I, 1); if (I mod 2)=1 then begin T : = Det (B, N-1);

S : =S + T*A[ I, 1]; end else begin T : = Det (B, N-1); S : = S –T *A[I,1];

end; end; Det : = S; end; end; begin readln (N);

for I :=1 to N do begin for J :=1 to N do readln (A [I, J]); end; D : =Det (A, N);

Writeln ( D : 7 : 4); readln; end.

Const NMax = 100;

Type MasNat = Array [1 .. NMax] Of 1.. High (Integer);Var A : MasNat; I, J, N, M, K, Vsp : Integer; Log : Boolean; F : Text; Procedure WriteMassiv; Var I : Integer; Begin For I := 1 To N Do Write( A [I] : 5); WriteLn; End; Begin Assign(F, 'D : \ workdir \ shest \ ttt.txt' ); ReWrite(F); ReadLn(N); Randomize; For I := 1 To N Do A[I] := 1 + Random(1000); WriteMassiv; For I := 1 To N Do Write( F, A[I] : 5); WriteLn(F); ReadLn(K); M := 0; I := 1; While I <= N - 1 Do Begin Log := True; J := I; While (J <= N) And Log Do Begin Log : = A[J] Mod K < > M; J := J + 1; End; If Not Log Then Begin Vsp := A[J - 1]; A[ J - 1] := A[I]; A [ I ] := Vsp; I := I + 1; End Else M := M + 1; End; Write Massiv; For I := 1 To N Do Write( F, A[I] : 5); WriteLn (F); Flush (F); Close (F) End.

4) program pasc;

var a,d : real; i, k, n : integer; b : array [1..100] of real; begin readln (a);

readln (d); readln (n); for i:=1 to n do begin readln ( b [i] );

end; k : =0; for I : =1 to n do if ( b[i] > (a+d)) or (b[i]< (a-d)) then k:=k+1; if k : =0 then writeln(a) else writeln(k) end.

var a, b : array [1..100] of integer; n, i, j, k : integer;

begin readln (n);

for I :=1 to n do begin readln ( a [ I ] ); end; readln (k); j :=1; for I : =1 to n do if ( a[i] mod 10 = k) then begin b[j] : = a[i]; write ( b[j] );

j : =j+1; end; end.
6) program pasc;

var n, i, j : integer; a : array [1..100, 1..100] of integer;

begin readln (n);

for i:=1 to n do for j:=1 to n do begin a [i, j] : = j-i+1;

if a[i, j] <=0 then a [i, j]:=abs (a[ i, j]-2); end; for i:=1 to n do

begin for j:=1 to n do write (a [i, j]:3); writeln end end.

var n, i, j : integer; a: array [1..100, 1..100] of integer; begin readln(n);

for i:=1 to n do for j:=1 to n do begin write('a[',i,',',j,']=');

readln(a[i,j]); end; for i:=1 to n do for j:=1 to n do

begin if a[i,j]<=0 then a[i,j]:=0 else a[i,j]:=1 end;

for i:=1 to n do begin for j:=1 to n do write(a[i,j]:3); writeln end; writeln; writeln; for i:=1 to n do begin for j:=1 to i do write(a[i,j]:3);

writeln end end.

8) program pasc;

var a:array [1..200] of real; i,j,k,l,n,mi,mj,ni,nj: integer; min,max: real; p,q: boolean; function xt(i:integer):real; begin xt:=a[2*i-1] end; function yt(i:integer):real; begin yt:=a[2*i] end; function dl(i,j:integer): real; begin dl:=sqrt(sqr(xt(i)-xt(j))+sqr(yt(i)-yt(j))) end;begin readln(n); for i:=1 to n do begin write('x[',i,']='); readln(a[2*i-1]); write('y[',i,']='); readln(a[2*i]) end; q:=true; max:=dl(1,2); mi:=1; mj:=2; min:=dl(1,2); ni:=1; nj:=2; for i:=1 to n-1 do for j:=i+1 to n do begin if maxdl(i,j) then begin min:=dl(i,j); ni:=i; nj:=j; end end; writeln(mi,'-',mj); writeln( ni, '-', nj ) end.

var a:array[1..100] of integer;

i,n:integer; begin readln(n); for i:=1 to n do begin write('a[',i,']='); readln(a[i]) end; for i:=1 to n div 2 do writeln (a[i],' ', a[(n div 2)+i])end.
10) program pr;

var a:array [1..100,1..100] of integer;

i,j,n:integer; c: integer; begin readln(n); for i:=1 to n do for j:=1 to n do

begin readln(a[j,i]); end; for i:=1 to n do begin for j:=1 to n do write(a[i,j]:3); writeln; end; for i:=1 to n do for j:=1 to n do begin c:=a[i,j]; a[i,j]:=a[j,i]; a[i,j]:=c; end; for i:=1 to n do begin for j:=1 to n do

write(a[i,j]:3); writeln end; end.
11) program prog;

var a:array[1..30,1..30] of integer;

i,j,n:integer; begin readln(n); for i:=1 to n do for j:=1 to n do

if i=j then a[i,j]:=n-j+1 else a[i,j]:=0; for i:=1 to n do

begin for j:=1 to n do write(a[i,j]:3); writeln end end.
12) program pasc;

var a:array[1..30,1..30] of integer;

i,j,n,k,m,max,at:integer; begin readln(n); readln(m); for i:=1 to n do

for j:=1 to n do begin readln(a[i,j]) end;

for i:=1 to n do begin for j:=1 to n do write(a[i,j]:4); writeln end; max:=1; for i:=1 to n do if a[max,max]

then max:=i; for i:=1 to n do begin at:=a[m,i]; a[m,i]:=a[max,i]; a[max,i]:=at end; for i:=1 to n do begin for j:=1 to n do write(a[i,j]:4); writeln end end.

var a:array[1..200] of real; i,n:integer; d,r1,R2:real; begin readln(n); for i:=1 to n do begin readln(a[2*i-1]); readln(a[2*i]); end; d:=sqrt(sqr(a[1])+sqr(a[2])) r1:=d; R2:=d; for i:=1 to n do begin d:=sqrt(sqr(a[2*i-1])+sqr(a[2*i])); if dR2 then R2:=d end; writeln('r=',r1); writeln('R=',R2) end.

var a:array[1..100,1..100] of integer;

i,j,n:integer; begin readln(n); for i:=1 to n div 2 do for j:=i to n do

begin a[i,j]:=0; if ((j>=i) and (j<=(n-i+1))) and (i<=(n div 2)+1)

then begin a[i,j]:=1; a[n-i+1,j]:=1; end;

end; if n mod 2=1 then a[n div 2+1,j div 2+1]:=1; for i:=1 to n do

begin for j:=1 to n do write(a[i,j]:2); writeln end; readln end.
15) program mas;

var a:array[1..100] of integer;

i,n,k:integer;

begin readln(n); for i:=1 to n do begin readln(a[i]); end; i:=1; while i'); ReadKey; END.

var N:integer;

function KOL(N:integer):integer;

begin if N>9 then KOL:=KOL(N mod 10)+KOL(N div 10) else KOL:=1;

end;BEGIN ReadLn(N); WriteLn(KOL(N)); ReadLn; END.

20) program pasc;

var b,a,n,k: integer;

begin readln(n); k:=n; a:=k mod 10; repeat b:=k mod 10; k:=k div 10 until k div 10 =0; b:=k mod 10; writeln(a,n div 10 div 10 mod 10,n div 10 mod 10,b) end.

21) PROGRAM pasc;

TYPE massiv=array [1..50] of integer;

var a:massiv; n,i:integer; begin readln(n);

i:=1; while n>=2 do begin a[i]:= n mod 2; i:=i+1;

n:= n div 2; end; i:=i-1; write(n); while I < >0 do

begin write(' ',a[i]); i:=i-1; end; writeln end.

uses crt;

var i , s, n, dni, a : Integer; begin ClrScr;

ReadLn(n); ReadLn(dni); s := 0; a := 0; if dni > n then begin

TextColor(Red); GotoXY(15,5); GotoXY(15,6); end else begin for i := 1 to dni do begin if a mod n = 0 then begin

s := n div 2; n := n - s; end else begin

a := n - 1; s := a div 2; n := n - s + 1 end end;

end; WriteLn; Write('Press Enter'); ReadLn end.

uses crt;

var vklad, prozent, a : Real; i, let, b : Integer; begin

ClrScr; ReadLn(vklad); ReadLn(let); ReadLn(prozent);

for i := 1 to let do begin a := (vklad / 100) * prozent;

vklad := vklad + a end; WriteLn( vklad:10:2); WriteLn;

WriteLn('Press Enter'); ReadLn end.

24) program 7;

uses crt;

var i, a, b, n : Integer; begin ClrScr; ReadLn(n);

a := 0; i := 0; b := 0; repeat a := a + 2; Inc(i);

b := a * (a + 2) until b >= n; WriteLn( i, i + 1); WriteLn;

Write('Press Enter'); ReadLnend.

uses crt;

Var D,A,B,x,y,C:real;

function P(n:real):real;

begin P:= exp(1/3*ln(n)); end; begin

clrscr; write('x = '); readln(x); write('y = '); readln(y);

A:= P(x)+ P(y); writeln('A = ',A); readln; end.

26) Program Vera;

Uses crt;

var x,y,z,s,r:real; n,i,j:integer; b:boolean;

begin Clrscr;

write('enter x: '); readln(x); writeln(x); write('enter n: '); readln(n); writeln(n);

s := 0; b := false; if (not odd(n)) then n := n + 1; i := 1; while i <= n do begin y := x; z := 1; j := 1; while j < i do

begin y := y*x; j := j + 1; z := z*j; end;

if b = true then s := s-y/z else s := s+y/z; b := not b; i := i + 2;

r := sin(s); end; writeln(r); readln; end.

27) program piram;

uses crt;

var j,i:integer;

begin

for i:=1 to 25 do begin gotoxy(40-i,i); for j:=2 to 2*i do

write('*'); end; end.

28 ) Program Cylinder;

Uses Crt; Var R, H, V, S: Real;

BEGIN ClrScr;

ReadLn(H); ReadLn(R);

V := Pi * R * R * H; S := 2 * Pi * R * H; WriteLn;

WriteLn( S : 5 : 2); ReadLn END.

Uses Crt;

Var xA, yA, xB, yB, xC, yC, DistA, DistB, DistC : Real;

BEGIN ClrScr; Write('x = '); ReadLn(xA);

Write('y = '); ReadLn(yA); Write('x = '); ReadLn(xB);

Write('y = '); ReadLn(yB); Write('x = '); ReadLn(xC);

Write('y = '); ReadLn(yC); DistA := sqrt(sqr(xA) + sqr(yA));

DistB := sqrt(sqr(xB) + sqr(yB)); DistC := sqrt(sqr(xC) + sqr(yC));

If ( DistA < DistB) and (DistA < DistC) then WriteLn( a)

else If (DistB < DistC) then WriteLn( B) else WriteLn( C);

ReadLn END.

30) Program Quadratic;

Uses Crt; Var a, b, c : Real;

Discr : Real; x1, x2 : Real; Test, NTest : Integer;

EGIN ClrScr;

ReadLn(NTest); For Test := 1 to NTest do begin

ReadLn(a, b, c); begin Discr := b*b - 4*a*c;

If Discr > 0 then begin x1:=(-b + Sqrt(Discr)) / (2*a); x2:=(-b - Sqrt(Discr)) / (2*a); WriteLn('x1=' , x1:6:2 , '; x2=' , x2:6:2) end else if Discr = 0 then begin x1 := -b/(2*a); WriteLn(`x1=', x1:6:2, ' x2=', x1:6:2) end else WriteLn('natija yo`q'); end; WriteLn end; ReadLn END.

31) Program SummaFib;

Uses Crt;

Var M, F0, F1, F2, S : Integer;

BEGIN

ReadLn(M); F0:=1; F1:=1; F2:=2; S:=4;

Write(M, ' : ', F0:4, F1:4); While F2<=M do

begin F0:=F1; F1:=F2; Write(F1 : 4); F2:=F0+F1; S : =S+F2;

end; S:=S - F2; WriteLn; WriteLn( S ); ReadLn END.

32) program thir;

uses crt;

var a, b : LongInt;

begin clrscr; a:=1;

writeln; while a < > 0 do

begin readln(a);

while a > = 10 do begin

a : =a div 10; end;