Varianta 2

1.

Limbajul C++/ Limbajul C Limbajul Pascal

for(i=1; i<=5; i++) for i :=1 to 5 do
for(j=5; j>=i; j--) for j :=5 downto i do
if (i%2==0) cout<<i; if i mod 2 = 0 then write(i)
| else write(j);
else cout<<j;

a) 12345 b) 111115432333545 c) 543212222543445

d)122333444455555 e) 12334445555 f) 23344455554443

2.

Limbajul C++/ Limbajul C Limbajul Pascal

!((x<=y && x>=z) || x<=t) not(((x<=y) and (x>=z))or(x<=t))

Limbajul C++/ Limbajul C Limbajul Pascal

a) x<=y || x>=z && x<=t a) (x<=y) or (x>=z) and (x<=t)
b) x>y || x<z && x>t b) (x>y) or (x<z) and (x>t)
c) x>y && x<z || x>t c) (x>y) and (x<z) or (x>t)
d)(x>y || x<z) && x>t d) ((x>y) or (x<z)) and (x>t)
e) x>y || x<z && x<=t e) (x>y) or (x<z) and (x<=t)
f) x>=y && x<=z || x>t f) (x>=y) and (x<=z) or (x>t)

3. Un tablou bidimensional a de la 1 la n

Limbajul C++/ Limbajul C Limbajul Pascal

a) a[i][j] == a[j][i] a) a[i, j] = a[j, i]
b) a[i][i] == a[n+1-j][n+1+i] b) a[i, i] = a[n+1-j, n+1+i]
c) a[i][j] == a[n+1-i][n+1-j] c) a[i, j] = a[n+1-i, n+1-j]
d) a[i][j] == a[n-j][[n-i] d) a[i, j] = a[n-j, n-i]
e) a[i][j] == a[n+1-j][n+1-i] e) a[i, j] = a[n+1-j, n+1-i]
f) a[i][j] == a[n+j][[n-i] f) a[i, j] = a[n+j, n-i]

4. valoare are variabila b

Limbajul C++/ Limbajul C Limbajul Pascal

var b: string[30];

13
 b[3]=b[3]-1;
strcpy(b+5,b+7); b[4]:= chr(ord(b[4])-1);
strcpy(b,b+3); delete(b,6,2);
delete(b,1,3);
a) b20 b) 19 c) 20 d) 10 e) toc f)2019

5. punct
tipul de date segment
segment di
s de tip segment.

Limbajul C++/ Limbajul C Limbajul Pascal

typedef struct type punct=record
{ float x, y;}punct; x, y: real;
typedef struct end;
{punct A, B;}segment; type segment=record
segment s; A, B: punct;
end;
var s: segment;

a) (A.x+B.x)/2 b) (A.s.y+B.s.y)/2 c) (s.y+s.y)/2

d) (A.x+B.y)/2 e) (s.A.x+s.B.x)/2 f) (s.A.y+s.B.y)/2

6. Utilizând
ordin n
n=3 tablourile bidimensionale sunt generate

100 100 010 010 001 001

010 001 100 001 100 010
001 010 001 100 010 100

n =4
bidimensional:
0010
1000
0001
0100.
a) 0010 b) 0010 c) 0001 d) 0010 e) 0001 f) 1000
1000 0100 1000 0001 0010 0010
0100 1000 0010 1000 0100 0100
0001 0001 0100 0100 1000 0001

7. nr,
nr(6,3).

Limbajul C++/ Limbajul C Limbajul Pascal

int nr (int x, int y) function nr(x,y:integer): integer;

14
 { int a, t; var a, t : integer;
if (x==y || y==1) return 1; begin
if (x<y) return 0; if (x=y) or (y=1) then nr := 1
a=0; else if x<y then nr :=0
for(t=1; t<=y; t++) else begin
a=a+nr(x-y,t); a :=0;
return a; for t :=1 to y do
} a :=a+nr(x-y,t);
nr := a;
end;
end;
a) 0 b) 1 c) 2 d) 3 e) 4 f) 6

8.
(0, 1, 1, 1, 3, 3, 3, 4, 7, 7)
a) 5, 6, 7 b) 5, 6, 7, 9, 10 c) 4, 5, 6, 7, 8, 9, 10
d) 6, 7 e) 4, 5, 6 f) 4,7

9. x y
F(x,y) (pentru variantele în limbajele C++ sau Pascal) respectiv F(&x,y)
(pentru varianta în limbajul C):

Limbajul C++ Limbajul C Limbajul Pascal

void F( int &x, int y) void F( int *x, int y) procedure F(var x:
{ { integer; y: integer);
x=2; y=3; *x=2; y=3; begin
} } x:=2; y:=3;
end;
a) 3 2 b) 1 2 c) 1 1 d) 2 3 e) 2 2 f) 3 3

10
.

a) 1 b) 2 c) 3 d) 4 e) 6 f) 8

11 -
. este:
a) 15 b) 18 c) 23 d) 25 e) 36 f) 45

12 c de lungime maxi
. în
c.

Limbajul C++/ Limbajul C

-c; -c );
b) cout<<str
-c-1; -c-1 );

-c+2; -c+2 );
d- -

15
 Limbajul Pascal

-1);

13 de tip întreg a
.

Limbajul C++/ Limbajul C Limbajul Pascal

a=2019; a: = 2019;
for(x=1; x<=5; x++); for x:=1 to 5 do;
a=a+2; a: =a+2;

a) 2019 b) 2020 c) 2021 d) 2024 e)2027 f)2029

14
. -

a) elementelor produsului cartezian A5

b)
c) aranjamentelor de 30 de elemente luate câte 5

câte 5

15
.
Limbajul C++/ Limbajul C Limbajul Pascal
int s(int t) function s(t : integer) : integer;
{ if (t == 1) return 0; begin
else if t = 1 then s := 0
if (t == 2) return 1; else
else if t = 2 then s := 1
return s(t-2) + s(t 1); } else
s:=s(t-2)+s(t-1);
end;

nu
s(6).
a) 4 b) 6 c) 8 d) 10 e) 11 f) 14

16