Divide et Impera

Divide et Impera

11th Grade - University

12 Qs

quiz-placeholder

Similar activities

Week 9 - Functions and Pointers

Week 9 - Functions and Pointers

University

14 Qs

PSC ALM QUIZ

PSC ALM QUIZ

University

16 Qs

Java Operators

Java Operators

University

14 Qs

2D Array and Strings in C

2D Array and Strings in C

University

16 Qs

C Basics

C Basics

University

12 Qs

Array

Array

University

11 Qs

Operators in C

Operators in C

9th - 12th Grade

10 Qs

Java Loops

Java Loops

9th - 12th Grade

12 Qs

Divide et Impera

Divide et Impera

Assessment

Quiz

Computers

11th Grade - University

Easy

suma, numarare, maxim

+1

Standards-aligned

Created by

Marilena Vilciu

Used 5+ times

FREE Resource

AI

Enhance your content

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

12 questions

Show all answers

1.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

void suma(int v[], int s, int d){

if( s>d) return ...?...;

else

return suma(v,s, (s+d)/2-1) + v[(s+d)/2]+

suma (v, (s+d)/2 +1, d);

}

Tags

suma

2.

FILL IN THE BLANK QUESTION

45 sec • 1 pt

void suma(int v[], int s, int d){

if( s>d) return 0;

else

return suma(v,s, ...?...) + v[(s+d)/2]+

suma (v, (s+d)/2 +1, d);

}

Tags

suma

3.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

void suma(int v[], int s, int d){

if( s>d) return 0;

else

return suma(v,s, (s+d)/2-1) ...?... v[(s+d)/2]...?...

suma (v, (s+d)/2 +1, d);

}

Tags

suma

4.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

int nr(int v[], int x, int s, int d){

if(...?...) return 0;

else {

int m; m=(s+d)/2;

if ( v[m]==x )

return

1 + nr(v,x,s, m-1) +nr(v, x, m+1,d);

else

nr(v,x,s, m-1) +nr(v, x, m+1,d);

}

}

Tags

numarare

5.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

int nr(int v[], int x, int s, int d){

if(s>d) return 0;

else {

int m; m=(s+d)/2;

if ( v[m]==x )

return ...?... + nr( v, x, s, m-1) +nr (v, x, m+1,d);

else

return nr (v, x, s, m-1) +nr (v, x, m+1,d);

}

}

Tags

numarare

6.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

int nr(int v[], int x, int s, int d){

if(s>d) return 0;

else {

int m; m=(s+d)/2;

if ( v[m]==x )

return 1 + nr(v,x,s,...?...) +nrAp(v, x, m+1,d);

else

return nr(v,x,s,...?...) +nrAp(v, x, m+1,d);

}

}

Tags

numarare

7.

FILL IN THE BLANK QUESTION

1 min • 1 pt

int maxim(int v[], int s, int d){

if (s==d) return ...?...;

else if(s+1==d) if(v[s]>v[d]) return v[s];

else return v[d];

else {

int m1, m2;

m1=maxim(v,s,(s+d)/2);

m2=maxim(v,(s+d)/2+1,d);

if(m1>m2)return m1;

else return m2;

}

}

Tags

maxim

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 Computers