Search Header Logo

Graf Eulerian si Graf Hamiltonian

Authored by Corina Hera

Computers

11th Grade

Used 1+ times

Graf Eulerian si Graf Hamiltonian
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

7 questions

Show all answers

1.

FILL IN THE BLANK QUESTION

45 sec • 1 pt

Un lant elementar care contine toate nodurile grafului se numeste lant

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Media Image

Care dintre urmatoarele variante reprezinta un lant eulerian?

0,2,1,0,3,4

3,0,1,2,0,3,4

4,3,0,2,1

4,2,1,0,3

0,1,2,3,4

3.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Un ciclu care contine toate muchiile grafului se numeste ciclu

eulerian

hamiltonian

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Cate cicluri euleriene exista in graful din imagine?

0

2

4

8

6

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Presupunand ca se doreste parcurgerea unui ciclu hamiltonian, plecand din varful 1, care va fi ultimul varf parcurs?

4

5

1

3

2

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Secventa ABCFGEDCA este un ciclu hamiltonian?

da

nu

nu stiu

7.

DRAW QUESTION

3 mins • 1 pt

Reprezinta printr-un desen cum te-a facut sa te simti lectia de azi

Media Image

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?

Similar Resources on Wayground