Scribd
Upload
17 views1 page

CC Inf4017 2024

The document outlines exercises for a university course on advanced algorithmic complexity, including mathematical explanations of complexity classes and NP-completeness. It covers topics such as order of complexity, vertex cover, context-free languages, the Euclidean algorithm, and half-clique problems. Each exercise requires both theoretical explanations and practical illustrations or proofs.

Uploaded by

jordantsagmo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views1 page

CC Inf4017 2024

The document outlines exercises for a university course on advanced algorithmic complexity, including mathematical explanations of complexity classes and NP-completeness. It covers topics such as order of complexity, vertex cover, context-free languages, the Euclidean algorithm, and half-clique problems. Each exercise requires both theoretical explanations and practical illustrations or proofs.

Uploaded by

jordantsagmo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

.j.

.'

UNIVERSITE DE YAOUNDÉ 1 - FACULTÉ-\>Es SCIENCES 2024-2025


1
, : - Prof. iDOUNDAM RENE
DU fE: 3 HEURES

· cc - 15 DECEMBRE 2024 - INF 40 "'L


-•.-l,o;'GO�PLE:XJTÉ ALGORITHMIQUE AVANCÉE )
Î''
Exercice 1. ( Order of Complexity ) .. ,\
.·. .;.
- • Explain mathematically that h ={ 0(!1 ). In the same figure, draw two fonctions to
illustrate that h = O(/1 ).
• Explain mathematically that /4
J
l n(/3). In the same figure, dr�w two fonctions to
illustrate that /4 = 0(/3).
• Explain mathematically that /s �e(f6). In the same figure, draw three fonctions to
illustra.te that /s = 0(/5 ). 'I.
Answer each part TRUE or FALSE an giving explanation
• 2n4 = O(n4 ) , 2n = o(n2 ) .• .' , .. ,
• (49 * n3 ) + (8 * n2� + 47 = 0(n3 ), n = 0,(31\.)
Exercice 2. ( ) .✓ 1
. •i'J' .
• Define VËRTEX-Cover of a grapl1.•-
• Show that VERTEX-Cover is NP�o�plete.
In the question 2, you should use the following boolean formula
,✓.-� ," ' -
<P = (xi V x1 V xi) /1 (x1 V xi V x2) /1 (x1 V x2x2)
;- I
.,....
,:).., 1
"�#Z':',��� I• -� �
Exercice 3. ( )
Show the following theorem:
Every context-free language is a member of P
1 ·• •
Exercice 4. Let x and y be two positive integers�••. , -> �';,,,.t!!JI, ..
1. Give.the-Ellelidea.h algorithm that,takes in entries,' x and y ana l'etUl' -- output the
-�t common divisor .of,x and y:
2. Give the complexity of Euclidean Algorithm and explains explicitely how you obtain its .
Exercice 5. ( )
Let 1'r
HALF- CLIQUE {G I Gis an ulidirected graph having
a complete subgraph with at least m/2 nodes where m
is the number of nodes in G}

1. Show that RALF-CLIQUE is NP-complete


I

You might also like