DC2 2023 Correction
DC2 2023 Correction
DC2 Correction
Matière: Informatique (MP1 - PC1 - T1 et BG1) Durée : 2H AU: 2022/2023
Enseignantes : BENFRADJ A., HACHAICHI H. & MEFTEH F. Nombre des pages : 4
3. TA=np.transpose(A))
4. np.trace(A)
5. D,V=npl.eig(A)
II.
1. from math import *
fct=lambda x:exp(-x**x+3*x)
2. def Points():
f=open("Abscisses.txt" ,'r')
Lx=f.readlines()
print(Lx)
for i in range(len(Lx)):
Lx[i]=float(Lx[i].strip())
Ly=[fct(x) for x in Lx]
return Lx,Ly
1
for j in range (N):
while True:
a=int(input('donner un entier positif'))
if a>0:
break
M[i,j]=a
return M
3. def Som_lig(M,i) :
L=M[i,:].tolist()
return sum(L)
4. def liste_som(M) :
L=[]
n=len(M)
for i in range(n):
L.append(Som_lig(M,i))
return L
5. def tri_bulle(L):
n = len(L)
for i in range(n):
for j in range(0, n-i-1):
if L[j] > L[j+1] :
L[j], L[j+1] = L[j+1], L[j]
return L
def tri_insertion(L):
for i in range(1, len(L)):
k = L[i]
j = i-1
while j >= 0 and k < L[j] :
L[j + 1] = L[j]
j -= 1
L[j + 1] = k
return L
def tri_selection(L):
for i in range(len(L)):
min = i
for j in range(i+1, len(L)):
if L[min] > L[j]:
min = j
tmp = L[i]
L[i] = L[min]
L[min] = tmp
return( L)
2
6. N=Taille()
M=Saisie_Tab(N)
L=liste_som(M)
print(tri_list(L))
5. def Chercher_client(D,cd) :
if cd in D:
l=D[cd]
print (l[0], ' ', l[1],' ',l[2])
else:
return None
6. def Chercher_sup(D) :
sol=0
L=[]
3
for cle in D:
if D[cle][2]>sol:
sol=D[cle][2]
cd=cle
L=D[cle]
return cd, L
7. def TrierFich(D):
f=open('tri.txt','w')
while (len(D)!=0):
cd, L=Chercher_sup(D)
f.write(L[0]+ ' '+ L[1]+' '+str(L[2])+'\n')
del(D[cd])
f.close()