|
1
/
|
|
|
| ?
| 1. PHP
2.
3. C, C++
4. Java
|
| Lisp?
| 1.
2.
3.
4.
|
| Prolog?
| 1.
2.
3.
4.
|
| - ...
| 1.
2.
3.
4.
|
| ( ) :
| 1. ,
2.
3. ,
4.
|
| , , , ___________
| 1.
2. -
3.
4.
|
| Prolog :
| 1.
2.
3.
4.
|
| - ...
| 1.
2.
3.
4.
|
| "" ?
| 1. ,
2. ,
3. ,
4.
|
| 2- :
| 1.
2.
3.
4. ,
|
| ++:
| 1.
2.
3.
4.
|
| "" ?
| 1. ,
2.
3.
4. ,
|
| ?
| 1.
2.
3.
4.
|
| :
" ";
" ";
" ";
D "";
" ";
F " ";
G " ".
.
| 1. C, B, E, D, A, G, F
2. C, B, E, D, G, A, F
3. B, C, E, D, G, A, F
4. C, E, B, D, G, A, F
|
|
| 1.
2. ()
3.
4.
|
| - . A, B C 3, 3 1, F
| 1. 6
2. 8
3. 7
4. -1
|
| -
| 1.
2.
3. , ,
4.
|
|
| 1. 5
2. 10
3. 0
4. 15
|
|
| 1.
2.
3.
4.
|
| ""
| 1.
2.
3.
4.
|
| , . , . . , ,
| 1. " "
2. " "
3. " "
4. ""
|
| S n =4
| 1. 11/6
2. 4
3. 25/12
4. 0
|
| :
)
)
)
) .
| 1. ,
2. ,
3. ,
4. ,
|
| X1, X2, ,XN.
| 1.
2.
3.
4.
|
| , x, y, z 2 .
| 1. x=2; y=4; z=1
2. x=1; y=4; z=0
3. x=2; y=4; z=3
4. x=3; y=3; z=1
|
| -
,
| 1. ,
2. ,
3. ,
4. ,
|
| , ,
| 1.
2.
3.
4. ()
|
| F, A, B C 1, 1 4,
| 1. 0
2. 6
3. -4
4. 5
|
| y = Ax2 + Bx + C ( ^, :=)
| 1. y:= A*x^2 + B*x + C
2. y:= (A*x)^2 + B*x + C
3. y:= Ax2 + Bx + C
4. y:= Ax^2 + Bx + C
|
| ,
a:= 2; b:= 15;
a+b<40
a:= a+2
b:= b+3
| 1.
2. 4
3.
4. 5
|
| . , " 1" " 2". " ". " 3".
| 1.
2.
3.
4.
|
| F
a:=1; b:=1; c:=3; f:=0; a=b
b<c
b:=b+c; f:=a+b+c;
a:=c; f:=a+b+c;
| 1. 7
2. 0
3. 5
4. 8
|
| ""
| 1. ,
2. ,
3.
4.
|
| - , ,
| 1. Pascal
2.
3.
4. Visual Basic
|
| K :
a:=-5; b:=-12; c:=0; d:=7; k:=0; a<0 k:=k+1
b<0 k:=k+1
c≤0 k:=k+1
d<0 k:=k+1
k:=k+2
| 1. 5
2. 1
3. 3
4. 0
|
| "", "", "", "". -
| 1.
2.
3.
4.
|
| ...
| 1. SQL
2. Java
3. ADA
4. XML
|
| -
| 1. x,z (x<100) (z>10) y:=x+z y:=x*z y:=x*z y
2. x,z (x<100) (z>10) y:=x*z y:=x+z y
3. x,z x<100: y:=x*z z>10: y:=x+z y
4. x,z (x<100) (z>10) y:=x*z y:=x+z y:=x+z y
|
| mod . K :
k:=0;
i 1 100
(mod(i,3)=2) (mod(i,5)=1)
k:=k+1
| 1. 288
2. 6
3. 3
4. 7
|
| -
| 1.
2.
3.
4.
|
| a b
a:=15 div (16 mod 7)
(: x div y x y. x mod y x y)
| 1. a=7, b=25
2. a=7, b=22
3. a=1, b=4
4. a=1, b=160
|
| . , ,
| 1.
2.
3.
4.
|
| ...
| 1.
2.
3.
4.
|
| D , , 3, 4, 5, 1, 2, D[D[5]]-D[D[3]] ...
| 1. -1
2. 1
3. -3
4. 2
|
| , , ...
| 1.
2.
3.
4.
|
| ...
| 1.
2.
3.
4.
|
| a, b, c "", i, k "". :
(a) a ( "").
(a,i) i- () a ( ").
(a,b) , a, b ( ").
(, a:='').
a:=
i:=(a)-5
k:=1 b:=
i > 2
c:=(a,i)
b:=(c,b)
i:=i-k
b .
| 1.
2.
3.
4. В
|
| __________ .
| 1. 7
2. 8
3. 9
4. 5
|
| .
| 1. ((a*b)-c/(a-c))/(2*b*c)
2. (a*b)-c/(a+c)/2*b*c
3. = ((a*b)-c/(a-c))/(2*b*c)
4. ((ab)-c)/(a+c))/(2bc)
|
| , .
| 1. 1 1 2 3 2
2. 1 2 2 3 1
3. 1 1 2 2 3
4. 1 1 2 2 3
|
| " , , , "
| 1.
2.
3.
4.
|
| , x y .
| 1. y:=x; b:=x; x:=y;
2. c:=x; x:=y; x:=c;
3. x:=x+y; y:=x-y; x:=x-y;
4. b:=x; x:=y; y:=x;
|
| , n=8 [4; 6; 8; 10; 12; 14; 16; 18 ]
| 1. i 1 n A[i]:=i*2
2. i 1 n A[i]:=i*2+2
3. i 1 n A[i]:=i*2-2
4. I 2 n A[i]:=i*i
|
| ?
| 1. PHP
2. C++
3. Tcl
4. Java
|
| :
| 1. A 2, B 3, C 1
2. A 2, B 1, C 3
3. A 1, B 3, C 2
4. A 3, B 1, C 2
|
| -
| 1.
2.
3.
4.
|
|
| 1.?Gross
2. Sor1_t1_12
3. M O D
4. SchwarzKopf
|
|
| 1. Integer
2. Long Int
3. Boolean
4. String
|
| ,
| 1. x:= x + 2 +1;
2. x + 1:= y;
3. x:= (y + 2) / y + 1);
4. x:= y x + 1;
|
|
| 1. S:= X * Y / (A * B * C);
2. S:= (X * Y) / A / B / C;
3. S:= X * Y / A * B * C;
4. S:= X / A * B / C * Y;
|
| y = -1
((y*y -x) > x*x) or (cos(x)>0) and not P
| 1. x = - 0.5, P = TRUE
2. x = 0.5, P = TRUE
3. x = 3, P = FALSE
4. x = 1, P = FALSE
|
| Random(X) , 0 X-1 .
x:= Random(51) 20;
x
| 1. [-50; -20]
2. [-20; 50]
3. [-20; 30]
4. [20; 50]
|
| ,
1. a:= a + 1;
2. b:= a 2;
3. c:= sqr(a + 1);
4. Edit1.text:= inttostr(a);
5. Edit2.text:= inttostr(c);
, ,
| 1. 3 4
2. 1 2
3. 2 3
4. 2 4
|
|
Y:= X 1;
X:= Y + 2;
Y:= X + Y;
Y 10. X
| 1. 5
2. 10
3. 1
4. 2
|
| , k 1, a = 8 b = 6:
1) (a>b) And (b>7) k:=0 k:=1;
2) (a<b) Or (b>7) k:=1 k:=0;
3) (a>b) Or (b>7) k:=1 k:=0;
4) Not (a = 8) k:= 1 k:= 0;
| 1. (1,2)
2. (1,3)
3. (2,4)
4. (2,3)
|
|
x:= 1; y:= 0; z:= -2;
If x > 0 Then
If y < 0 Then z:= y + 5
Else z:= y + 4;
If z = 0 Then z:= z + 1;
| 1. 1
2. -2
3. 0
4. 4
|
| -
F A, B, C = 3, 3, 1,
| 1. 7
2. -7
3. 0
4. 1
|
| d
k:= 5;
casek mod 12 of
7: d:= k;
5: d:= 2*k-1;
9..11: d:= k mod 12;
else d:= k div 12;
end;
| 1. 0
2. 5/12
3. 5
4. 9
|
| (i, Y),
Y:= 1; i:= 0;
i:= 1 6
Y:= Y i;
| 1. A
2. B
3. C
4. D
|
|
a:= 73045;
b:= 0;
While a <> 0 Do
b:= b + a Mod 10;
a:= a div 10;
b
| 1. 19
2. 0
3. 45
4. 1
|
| round (X) X .
X:= 7; Y:= round (X / 2) + 4;
while X <= Y do Y:= (X + Y) mod 8;
| 1. 2
2. 1
3.
4. 3
|
|
A:= 0; B:= 20;
While A <= B Do
A:= A + 2;
If A > 10 Then Break;
.
: break .
| 1. 10
2. 5
3. 6
4. 7
|
|
k:= 1;
For i:= 1 To 5 do
For j:= i To 5 do
k:= k + 1;
k ...
| 1. 16
2. 25
3. 26
4.
|
|
For i:= 1 To 5 do
For j:= 1 To 5 do
If i >= j Then
A[i, j]:= i - j
Else A[i, j]:= j i;
A 5 5
|
|
|
For i:= 1 To 10 do
A[i]:=10 - i + 1;
A 10 :
| 1. (10, 9, 8, 7, 6, 5, 4, 3, 2, 1)
2. (9, 8, 7, 6, 5, 4, 3, 2, 1, 0)
3. (1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
4. (0, 1, 2, 3, 4, 5, 6, 7, 8, 9)
|
| Matrix 10 10
S:= 0;
For a:= 1 To 7 do
S:= S + Matrix[1, a];
,
| 1.
2.
3.
4.
|
| , A N
S:= 0;
For J:= 1 To N do
If _______ Then S:= S + 1;
S:= N - S;
| 1. A[J] > S
2. A[J] >= 0
3. A[J] <= S
4. A[J] < 0
|
| A[1.. N],
M:= 1; T:= A[1];
For J:= 1 To N do
If A[j] > T then
begin
M:= J; T:= A[j];
end;
M :
| 1.
2.
3.
4.
|
| , A 10 :
Y:=A[1];
For k:= 1 To 10 Do
If A[k] > Y Then Y:=A[k];
: (2, 12, 0, -3, 10, -3, -5, 7, 21, 0).
Y
| 1. 21
2. 0
3. -5
4.
|
|
Y:= 0;
For N:= 1 to 5 do
For M:= 1 to 5 do
If N < M Then
Y:= Y + A[N, M];
A:
Y ...
| 1. 0
2. 15
3. 12
4. 20
|
| A N
For I:= 1 To N div 2 do
Z:= A[I];
A[I]:= A[N - I + 1];
A[N - I + 1]:= Z;
;
| 1.
2.
3.
4.
|
| pos(,) 1, 0, (, pos('','') 2). delete (, , .) (, delete ('',4,2) '').
S:= 'fbh hyu hjk i';
while pos ('h', S) <> 0 do
delete (S, pos ('h', S), 1);
S
| 1. fbhhyuhjki
2. fb yu jk i
3. fbyujki
4. ''
|
| - :
| 1. A 2, B 3, C 1
2. A 1, B 3, C 2
3. A 3, B 2, C 1
4. A 2, B 1, C 3
|
|
A. Pascal
| 1.
| B. Delphi
| 2.
| C. Lisp
| 3.
| D. Javascript
| 4. -
|
| 1. A 1, B 2, C 3, D 4
2. A 3, B 1, C 4, D 2
3. A 3, B 4, C 1, D 2
4. A 2, B 4, C 1, D 3
|
| , , - ...
| 1.
2.
3.
4.
|
| - ( )
| 1. x <= y
2. y < 16
3. x <= y
4. y < 16
5.
|
| x1=2, y1=-2, x2=-1, y2=-2, x3=2, y3=2 b
| 1. 2
2. -2
3. 1
4. -1
|
| - , .
| 1. 1
2. 1 ,
3. 1 ,
4.
|
| X
| 1. 2 24
2. 2 2
3. 2 4
4. 2 16
|
| -
| 1. a,b a>0 X:=a/b a<0 X:=a+b X:=a-b X .
2. a,b a > 0 a < 0 X:=a+b X:=a-b X:=a/b X .
3. a,b a > 0 X:=a/b a < 0 X:=a+b X:=a-b X .
4. a,b a>0 X:=a/b a < 0 X:=a+b X:=a-b X .
|
| :
n=6 s
| 1. 637
2. 21
3. 91
4. 55
|
|
| 1.
2.
3.
4.
|
| ,
| 1. (), ,
2.
3.
4. , -
|
| -
| 1.
2. ,
3.
4. ,
|
| a=2, n=8, p
| 1. 256
2. 128
3. 64
4. 512
|
| , , ,
| 1.
2.
3.
4.
|
| " " (-) (-)
| 1. 3
2. 1
3. 2
4. 4
|
| ,
| 1. "" ""
2. "" ""
3. "" ""
4. "" ""
|
|
| 1.
2.
3.
4.
|
|
| 1.
2.
3.
4.
|
| -
| 1. ()
2. ()
3. ,
4. ,
|
| - ""
| 1.
2.
3. -
4.
|
| - ,
| 1.
2. ,
3.
4. ()
|
| - , ,
| 1.
2.
3.
4.
|
| - ""
| 1.
2. -
3.
4.
|
| - , ,
| 1.
2.
3.
4.
|
|
| 1. ++
2. ALGOL
3. PROLOG
4. LISP
|
|
| 1. PROLOG
2. LISP
3. PASCAL
4. C++
|
| :
| 1.
2.
3.
4.
|
| , , ... | 1. -
2.
3.
4.
|
| "" | 1.
2. -
3.
4.
|
| ... | 1.
2.
3. -
4. -
|
| ... | 1.
2.
3.
4.
|
| ... | 1.
2.
3.
4. ,
|
| | 1.
2.
3.
4.
|
| , , ... | 1.
2.
3.
4. -
|
| , , , :
| 1.
2.
3.
4.
|
| ()
| 1.
2.
3.
4.
|
| , ,
| 1.
2.
3.
4.
|
| ?
| 1.
2. -
3.
4.
|
| -, ?
| 1.
2. -
3.
4. /
|
| -, ?
| 1. -
2.
3.
4. /
|
| -
| 1.
2.
3.
4.
|
|
| 1.
2.
3.
4.
|
|
| 1.
2.
3.
4.
|
| ?
| 1. (x+y)*(x+y)
2. sqr(x+y)
3. (x+y)/N
4. x*yx/y
|
| For
| 1.
2.
3.
4.
|
|
| 1.
2.
3.
4.
|
|
| 1. IfThenElse
2. For
3. Case
4. Goto
|
| ?
| 1. ,
2. ,
3. , ,
4. , , 3- , ,
|
|
) ;
) , ; ) ; )
| 1. ,
2. ,
3. ,
4. , ,
|
| , :
) ) ) )
| 1. , ,
2. , ,
3. ,
4. ,
|
|
| 1.
2.
3.
4.
|
| : ) , ) , ) , ) , ) , ) , ) , )
| 1. , ,
2. , , , ,
3. ,
4. , , ,
|
| : ) , ) , ) , )
| 1. ,
2. ,
3. ,
4. , ,
|
| :
| 1.
2.
3. -
4.
|
| ( ),
| 1.
2.
3.
4.
|
| , , ,
| 1.
2.
3.
4.
|
| , ,
| 1.
2.
3.
4.
|
| :
| 1.
2.
3.
4.
|
|
| 1.
2.
3.
4.
|
| :
| 1.
2.
3.
4. ,
| | | | | | | | | | | | | | | | | | | | | | | | | | | |
: 2015-05-07; !; : 4514 | :
:
, , ==> ... 1469 - | 1440 -
© 2015-2024 lektsii.org - - |