Divide et Impera
11th Grade - University
•12 Qs
Similar activities
PPS : Quiz 2
University
•15 Qs
Java - arrays and String methods
9th - 12th Grade
•12 Qs
Java Programming Basics
University
•10 Qs
Quiz LTP 1
University
•10 Qs
Структуры С++
University
•11 Qs
C++ Array
University
•10 Qs
BASIC C QUIZ
University
•15 Qs
UAS Praktikum: Logika dan Algoritma Pemrograman
1st Grade - University
•10 Qs
Divide et Impera
Quiz
•
Computers
•
11th Grade - University
•
Easy
+1
Standards-aligned
Marilena Vilciu
Used 5+ times
FREE Resource
Enhance your content
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
Continue with Google
Continue with Email
Continue with Classlink
Continue with Clever
or continue with
Microsoft
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
Similar Resources on Wayground
15 questions
Milking Minds 2 17-01-24
Quiz
•
University
13 questions
Récursivité
Quiz
•
University
10 questions
C Programming - Basics 001
Quiz
•
University
10 questions
104-P-01: Delegates and lambdas
Quiz
•
University
10 questions
AppsLab_Q2
Quiz
•
10th Grade - Professi...
10 questions
C Programming Quiz-1
Quiz
•
University
15 questions
Java Programming
Quiz
•
University
15 questions
C programming
Quiz
•
University
Popular Resources on Wayground
20 questions
Brand Labels
Quiz
•
5th - 12th Grade
10 questions
Ice Breaker Trivia: Food from Around the World
Quiz
•
3rd - 12th Grade
25 questions
Multiplication Facts
Quiz
•
5th Grade
20 questions
ELA Advisory Review
Quiz
•
7th Grade
15 questions
Subtracting Integers
Quiz
•
7th Grade
22 questions
Adding Integers
Quiz
•
6th Grade
10 questions
Multiplication and Division Unknowns
Quiz
•
3rd Grade
10 questions
Exploring Digital Citizenship Essentials
Interactive video
•
6th - 10th Grade