Recursia

Recursia

Professional Development

10 Qs

quiz-placeholder

Similar activities

Day 3 Recap - Provisioning

Day 3 Recap - Provisioning

Professional Development

10 Qs

Business Writing 4

Business Writing 4

Professional Development

10 Qs

Impression Management

Impression Management

Professional Development

10 Qs

Chapter 3

Chapter 3

Professional Development

14 Qs

MC Townhall

MC Townhall

Professional Development

11 Qs

Basic Quiz Thrusday

Basic Quiz Thrusday

Professional Development

10 Qs

Post Test Formative Assessment and Flipped Classroom

Post Test Formative Assessment and Flipped Classroom

Professional Development

10 Qs

REVISION CA3 M04 KA

REVISION CA3 M04 KA

Professional Development

15 Qs

Recursia

Recursia

Assessment

Quiz

Professional Development

Professional Development

Hard

Created by

Liuda Josan

Used 20+ times

FREE Resource

AI

Enhance your content

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Avem următorul algoritm recursiv:

F(0) = 1, F(1) = 1

F(n) = F(n–1) + F(n-2), n > 1

Cu ce este egală valoarea funcției F(7)?

În răspuns avem numai partea întreagă a numărului.

25

21

35

24

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Calcululul următorului membru al progresiei aritmetice este prezentat prin algoritmul recursiv?

da

nu

uneori

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Avem următorul algoritm recursiv:

F(1)= 1; F(2)=1;

F(n) = F(n-2) * n, n >2.

Cu ce este egală valoarea funcției F(7)? În răspuns avem numai

numărul natural.

87

105

93

117

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Avem următorul algoritm recursiv:

F(1) = 1

F(2) = 2

F(n) = F(n–1) − F(n–2) + 2 * n, n >2

Cu ce este egală valoarea funcției F(6)?

14

1

16

15

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Se consideră funcţia f definită recursiv. Ce va returna f(5)? int f(int i)

{

if (i==0) return 0;

if(i%2==0) return f(i-1)+i;

else return f(i-1)-i;

}

-4

-3

0

3

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Se consideră funcţia f definită recursiv.

Ce va returna f(6)?

int f(int x)

{

if(x<=1) return x;

else return f(x-2)+x;

}

6

8

12

15

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Se consideră funcţia f definită recursiv.

Ce va returna f(3)?

float f(int i)

{

if (i==0) return 0;

return f(i-1)+i*(i+1);

}

15

10

20

5

Create a free account and access millions of resources

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?

Discover more resources for Professional Development