emilia wrote:
Grila algoritmica grafurilor. BB
Multiple choice
1-b 2-a 3-b 4-b 5-a 6-b 7-b 8-a 9-b? 10-d 11-b 12-c 13-b 14-c 15-e 16-b 17-c 18-d 19-d 20-c 21-a 22-c 23-a 24-a 25-c 26-b 27-a 28-a 29-b 30-c 31-d 32-b 33-c 34-b 35-a 36-a 37-d 38-c 39-c 40-c 41-c 42-c 43-b 44-a 45-d 46-b 47-b 48-a 49-b 50-c 51-c 52-d 53-b 54-d 55-c 56-d 57-c 58-d 59-a 60-c 61-e 62-a 63-a 64-a 65-a 66-a 67-d 68-c 69-d 70-c 71-a 72-a 73-b 74-c
yes/no(d/n)
75-da 76-d 77-x 788-x 79-n 80- 81-n 82-n 83-n 84-n 85-d 86-n 87-n 88-d 89-n 90-d 91-d 92-d
completion
93-arbore 94-saturat 95-gradul 96-terminal 97-izolat 98-par 99-graf partial 100-subgraf 101-complet 102-elementar 103-simplu 104-ciclu 105-conex 106-componenta conexa 107-complet 108-regulat 109-k-regulat 110-(n-1) 111-k4 112-bipartit 113-bipartit comlet 114-stea 115-noduri izolate 116-grad exterior 117-grad interior 118 –drum 119-digraf complet 120-tare conex 121-noduri terminale(frunze) 122-arbore de acoperire 123-noduri terminale 124-combinari de n luate cite 2 125-drum 126-cost minim 127-drumurilor minime 128-matricea drumurilor? 129-egala 130-sa depaseasca 131-taietura 132-minima 133-egalitate 134-(n-1) 135-bipartit 136-complet 137-mn 138-orientat 139-simetrica 140-n 141-n-p 142-conex 143-2 144-n-1 145-un arbore partial de cost minim 146-kruskal 147-kruskal 148-matricea 149-dijkstra 150-minime 151-tempotala 152-taietura 153-ford 154-taieturi 155-minima 156-hamiltonian 157-complet 158-fleury 159-eulerian 160-coarde 161-conex 162-2 163-planar 164-2 165-euler 166 –neplanare 167-kuratowski 168-maxim 169-maxim 170-digrafurilor 171-fara bucle
Multiple choice
5 a ???? daca ne uitam la clasele de grafuri este graf complet care are Kn(n-1)
iar intrebarea 5 este din graf bipartit complet unde avem Kmn nu ar trebui sa fie (m-1)(n-1)?