Babeş-Bolyai University

Faculty of Matematics and Computer Science

GRADUATION EXAM
Written Test - July 2024
Mathematics Computer Science Study Programme

SUBJECT I. Algebra

  
a b 2 2
1. (4 points) Consider M = ∈ M2 (R) a + b = 1 . Prove that (M, ·) is a group. Is it a
−b a
commutative group?
2. (5 points) In the R-vector space R4 we consider the vectors:

a1 = (2, 1, 1, 1), a2 = (1, 0, 1, 1), b1 = (0, 1, 2, 1), b2 = (0, 0, 1, 1)

and the generated subspaces A = ⟨a1 , a2 ⟩ and B = ⟨b1 , b2 ⟩. Determine a basis and the dimension for
each of the R-vector spaces A, B, A + B and A ∩ B.

SUBIECTUL II. Calculus

1. (3 puncte) Study with discussion on the real parameter α the nature of the series of real numbers:
√
X ln( n + 1) − 1 ln n
2
.
nα
n≥1

2. (3 puncte) Write Taylor’s polynomial of rank n ≥ 3 attached to the function f : R → R about the
point a = 0, for
f (x) = (x2 − 2x)ex , ∀x ∈ R.
When determining the n-th derivate of the function f you may use Leibniz’s formular for the derivative
of the product of functions.

3. (3 puncte) Determine the value of the determinate integral:

Z 1
(x + 1) ln(x + 1) + (x + 2) ln(x + 2)
dx.
0 (x + 1)(x + 2)

SUBJECT III. Geometry

1. (5 points) Consider the points A(3, 5) and B(11, 11).

a) Write the equation of the perpendicular bisector of the segment [AB].
b) Find the coordinates of the point C, knowing that this lies on the [Ox axis, in its positive part,
and that the area of the triangle ABC is equal to 32.
c) Write the equation of the median that passes through A in the triangle ABC and show that this
median splits triangle ABC in two triangles of equal areas.
d) Compute the distance between the origin O(0, 0) and the median that passes through A in the
triangle ABC.
2. (4 points) Find the canonical equation of the hyperbola for which the distance between its focal
√ 1
points is 2 5 and whose asymptotes are the lines y = ± x.
2
SUBJECT IV. Computer Science

Note for the Computer Science subject:

One of the programming languages C++, Python, Java or C# can be used to solve problem 1.
Please indicate the programming language used.
Existing libraries (from C++, Python, Java, C#) can be used in the provided solutions.

1. (2 points) Write a program that:

a) Implements a Meeting class with the following protected attributes:

- title of type string;

- dateHour of type string (in the format "dd.mm.yyyy hh:mm"). The hour will be in the range [0, 23], and the minute in the range [0,
59].

Add to the class:

- a parameterized constructor,
- get/set methods for all the attributes,
- a toString method that returns a string consisting of title and dateHour separated by a comma.

b) Derive the class OnlineMeeting from the class Meeting which has all the attributes of the class Meeting and adds the private string
attribute url. Add get/set methods for the newly added attribute. The toString method for the OnlineMeeting class will return the content
of the toString method of the Meeting class to which it will concatenate the url of the meeting.

2. (2 points) Create a vector with three objects: two of type Meeting and one of type OnlineMeeting. Write a code sequence to order it
chronologically by the dateHour attribute.

3. (2 points) Fill in the missing lines of code of the following function to determine objects of type OnlineMeeting from the vector meets that have
a dateHour greater than the parameter specificDateHour and the title equal to the parameter specificTitle. The push_back() function inserts an
element at the end of the vector.

vector<OnlineMeeting> filter(const vector<OnlineMeeting>& meets, const string& specificDateHour, const string&

specificTitle) {
vector<OnlineMeeting> res;
…
return res;
}

4. (2 points) Indicate what is the result of executing the code sequence given below. The push_back() function inserts an element at the end of
the vector, the pop_back() function deletes the last element of the vector, and the back() function returns a reference to the last element in the
vector.

vector<Meeting> v;
v.push_back(Meeting("Project discussion", "01.05.2024 12:00"));
v.push_back(OnlineMeeting("Team meeting", "02.05.2024 15:00", "https://meet.com/abc123"));
v.push_back(Meeting("Presentation", "03.05.2024 09:30"));
v.push_back(OnlineMeeting("Q & A Session", "04.05.2024 11:00", "https ://meet.com/def456"));
if(v.back().getDateHour() < "01.05.2024 11:00")
v.pop_back();
v.pop_back();
cout << v.back().getDateHour() << endl;

5. (1 point) Explain the binary search algorithm and specify its time complexity.

NOTE.
All subjects are compulsory and full solutions are requested.
An initial score of 1 point is awarded to each subject. The minimum passing grade is 5,00.
The working time is 3 hours.
 Universitatea Babeş-Bolyai
Facultatea de Matematică şi Informatică

EXAMEN DE LICENŢĂ
Proba scrisă - iulie 2024
Specializarea Matematică
Barem de corectare

SUBIECTUL I. Algebră
Oficiu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1p
   
a b
1. M = A = ∈ M2 (R) det A = 1 ⊆ GL2 (R) = {A ∈ M2 (R)| det A ̸= 0}, unde (GL2 (R), ·)
−b a
este grupul general liniar. Arătăm că M este subgrup ı̂n GL2 (R) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1p
Pentru a = 1 şi b = 0 se obţine I2 ∈ M . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0.5p
 ′
b′
  
a b a
Pentru A = , A′ = ∈ M (deci det A = a2 + b2 = det A′ = (a′ )2 + (b′ )2 = 1) avem:
−b a −b′ a′
aa′ − bb′ ab′ + ba′
 
AA′ = cu det(AA)′ = det A · det A′ = 1, deci AA′ ∈ M . . . . . . . . . . . . . . . . 1p
−(ab′ + ba′ ) aa′ − bb′
   
−1 1 a −b a −b 1
A = = ∈ M, deoarece det A−1 = = 1 . . . . . . . . . . . . . . . . . . . . 1p
det A b a −(−b) a det A
aa′ − bb′ ab′ + ba′
 
Grupul este comutativ deoarece AA′ = = A′ A . . . . . . . . . . . . . . . . . . . . . . . 0.5p
−(ab + ba ) aa′ − bb′
′ ′

 
2 1 1 1
2. dim A = rangul matricii formate cu vectorii a1 , a2 (ca linii sau coloane) = rang = 2,
1 0 1 1
prin urmare (a1 , a2 ) este bază ı̂n A . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0.5p
 
0 1 2 1
dim B = rang = 2 ⇒ (b1 , b2 ) este bază ı̂n B . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0.5p
0 0 1 1
 
2 1 1 1
1 0 1 1
A + B = ⟨A ∪ B⟩ = ⟨a1 , a2 , b1 , b2 ⟩ ⇒ dim(A + B) = rang  0 1 2 1 = 4 . . . . . . . . . . . . . . . . . . 1.5p


0 0 1 1
Într-adevăr,
       
2 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1
1 0 1 1 l1 ↔l2 2 1 1 1 l2 −2l1 0 1 −1 −1 l3 −l2 0 1 −1 −1
0 1 2 1 ∼ 0 1 2 1 ∼ 0 1 2
      ∼  ,
1 0 0 3 2
0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1
iar ultima matrice are determinantul 1, deci rangul său este 4.
Se deduce că (a1 , a2 , b1 , b2 ) este o bază ı̂n A + B . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0.5p
dim A + dim B = dim(A + B) + dim(A ∩ B) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1p
dim(A ∩ B) = dim A + dim B − dim(A + B) = 0 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0.5p
Rezultă că A ∩ B = {(0, 0, 0, 0)} este subspaţiul nul şi ∅ este o bază ı̂n A ∩ B . . . . . . . . . . . . . . . . . 0.5p

NOTĂ: Orice altă soluţie corectă va fi punctată corespunzător.

 Universitatea Babeş-Bolyai
Facultatea de Matematică şi Informatică

EXAMEN DE LICENŢĂ
Proba scrisă - iulie 2024
Specializarea Matematică Informatică
Barem de corectare

SUBIECTUL II. Analiză matematică

Oficiu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (1p)
1.
P
2. Notăm prin xn termenul general al seriei. Se constată că seria xn este cu termeni pozitivi, şi se va
ı̂ncerca aplicarea criteriului II.b) de comparaţie pentru serii cu termeni pozitivi, pornind de la seria
armonică generalizată

X X 1  convergentă : dacă a > 1
yn = .
na 
n≥1 divergentă : dacă a ≤ 1
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0.5p)
Scopul este determinarea unei valori a parametrului a asfel ı̂ncât
xn
lim ∈ (0, ∞),
n→∞ yn
P P
caz ı̂n care cele două serii xn şi yn au aceeaşi natură. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0.5p)
Se va ţine cont de faptul că atunci când (an ) ⊆ R este un şir cu lim an = 0, atunci
n→∞

ln(an + 1)
lim = 1.
n→∞ an
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0.5p)
Avem
√ √ √
 
1 1
ln( n + 1) − ln n = ln( n + 1) − ln n = ln 1 + √ ,
2 n
iar  
ln 1 + √1
n
lim = 1.
n→∞ √1
n

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0.5p)
Deci
 
ln 1 + √1
xn n 1 1 na
lim = lim · √ · α · na = 1 · lim α+ 1 .
n→∞ yn n→∞ √1 n n n→∞ n 2
n

Această limită va fi ı̂n (0, ∞) doar ı̂n cazul ı̂n care

1
a=α+ .
2
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0.5p)
Atunci, limn→∞ xynn = 1 deci, conform criteriul de comparaţie II.b) seria
P
xn are aceeaşi natură cu
P P 1
seria yn = α+ 1
.
n 2

În concluzie, 
X  convergentă : dacă α > − 21
xn .
divergentă : dacă α ≤ − 12


. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0.5p)
3. ˆ Determinarea derivatei de ordinul n, n ≥ 2 a funcţiei f .
Observăm că funcţia f este un produs dintre o funcţie polinomială g(x) = x2 − 2x şi h(x) = ex ,
astfel ea este indefinit derivabilă pe R.
Fie x ∈ R arbitrar ales. Derivata de ordinul n se va calcula cu ajutorul formulei lui Leibniz pentru
derivata de ordinul n pentru produsul a două funcţii. Astfel, dacă f (x) = g(x) · h(x), atunci
n
X
(n)
f (x) = Cnk g (n−k) (x)h(k) (x).
k=0

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0.5 p)

g ′ (x) = 2x − 2, g ′′ (x) = 2 şi g (n) (x) = 0, ∀n ≥ 3,

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0.25 p)
iar
h(n) (x) = ex , ∀n ≥ 0.
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0.25 p)
De aceea,

∀n ≥ 2, f (n) (x) = Cnn g(x)h(n) (x) + Cnn−1 g ′ (x)h(n−1) (x) + Cnn−2 g ′′ (x)h(n−2) (x).

Astfel  
(n) x 2 n(n − 1)
∀n ≥ 2, f (x) = e x − 2x + n(2x − 2) + 2 .
2
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0.5p)
ˆ Polinomul lui Taylor ataşat funcţiei f : I → R şi unui punct a ∈ I ı̂n care funcţia este de n ori
derivabilă este funcţia polinomială Tn,a f : R → R,
n
X f (k) (a)
Tn,a f (x) = (x − a)k , ∀x ∈ R,
k!
k=0

astfel, pentru a = 0
n
X f (k) (0)
Tn,0 f (x) = xk , ∀x ∈ R.
k!
k=0

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0,5p)
Avem
f (0) = 0, f ′ (0) = −2 şi ∀n ≥ 2 f (n) (0) = n(n − 3),
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0.5p)
astfel
n
X k−3 k
Tn,0 f (x) = −2x + x ∀x ∈ R.
(k − 1)!
k=2

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (0.5p)
4. Avem
(x + 1) ln(x + 1) + (x + 2) ln(x + 2) ln(x + 1) ln(x + 2)
= + ,
(x + 1)(x + 2) x+2 x+1
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (1p)

iar prin integrarea prin părt, i obt, inem că

Z 1 1
Z 1 Z 1
ln(x + 1) ln(x + 2) ln(x + 2)
dx = ln(x + 1) ln(x + 2) − dx = ln 2 · ln 3 − dx,
0 x+2 0 0 x+1 0 x+1

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (1p)
 de unde Z 1  
ln(x + 1) ln(x + 2)
+ dx = ln 2 · ln 3.
0 x+2 x+1
Deci
Z 1
(x + 1) ln(x + 1) + (x + 2) ln(x + 2)
dx = ln 2 · ln 3.
0 (x + 1)(x + 2)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (1p)

NOTĂ: Orice altă soluţie corectă va fi punctată corespunzător.

 Universitatea Babeş-Bolyai
Facultatea de Matematică şi Informatică

EXAMEN DE LICENŢĂ
Proba scrisă - iulie 2024
Specializarea Matematică Informatică
Barem de corectare

SUBIECTUL III. Geometrie

Oficiu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1p

1. a) Mijlocul segmentului este M (7, 8). Panta dreptei AB este 43 , aşadar panta mediatoarei este − 43 .
Ecuaţia mediatoarei este y − 8 = − 34 (x − 7) care se rescrie 4x + 3y − 52 = 0. . . . . . . . . . . . . . . . . . . . . 1p
b) Fie C(x, 0) punctul cerut. Aria triunghiului ABC se poate scrie

3 5 1
1 1
A[ABC] = 11 11 1 = | − 22 − 6x|
2 2
x 0 1

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1p
Din | − 22 − 6x| = 64 şi x > 0 se obţine x = 7, deci C(7, 0).
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1p
c) Mijlocul segmentului [BC] este N 9, 11


2 . Ecuaţia dreptei AN este x − 12y + 57 = 0.
Cum N este mijlocul segmentului [BC], avem că
1 1
A[ABN ] = · BN · d(A, BC) = CN · d(A, BC) = A[ACN ] . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1p
2 2
d) Distanţa de la originea O(0, 0) la această dreaptă este

|1 · 0 − 12 · 0 + 57| 57
√ =√
1 + 144 145

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1p
√ √
2. F F ′ = 2c = 2 5 ⇒ c = 5. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1p
b 1
Din ecuat, iile asimptotelor avem că: = ⇔ a = 2b. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .1p
a 2
c2 = 5 = a2 + b2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1p
Înlocuind a = 2b ı̂n ecuat, ia precedentă, avem b2 = 1 s, i a2 = 4.
x2
Deci ecuat, ia hiperbolei este − y 2 = 1. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1p
4

NOTĂ: Orice altă soluţie corectă va fi punctată corespunzător.

UNIVERSITATEA BABEŞ -BOLYAI CLUJ-NAPOCA
FACULTATEA DE MATEMATICǍ ŞI INFORMATICǍ

Barem Subiect Informatică

Proba 1: Evaluarea cunoștințelor fundamentale și de specialitate, examen licenţă iulie
2024
Specializarea Matematică Informatică

Subiect Informatică

1. 2p
a) Definitie clasa Meeting (constructor, metode, acces la date) .......................................... 1p
b) Definitie clasa derivata OnlineMeeting (mostenire, constructor, toString) .................... 1p

2. 2p
Creare vector ....................................................................................................................... 1p
Ordonare cronologică după dateHour…............................................................................ 1p

3. 2p
Secventa filtrare (iterare elemente, comparare , actualizare rezultat) ................................ 2p

4. 2p
Indicarea corecta valorii afișate........................................................................................... 2p

5. 1p
Explicarea căutării binare ................................................................................................... 0.5p
Indicarea corectă a complexității timp ................................................................................ 0.5p

Notă:
(1p) Oficiu