Recursion

Quiz
•
Computers
•
12th Grade
•
Medium
Dinesh
Used 491+ times
FREE Resource
20 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
A recursive function is
A function that calls other functions in a recursive way.
Any function that calls itself is called recursive
A function that has a base case or termination condition
None of the above
2.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Recursion is:
is a computer programming technique involving the use of a procedure, subroutine, function, or algorithm that calls itself in a step having a termination condition.
is a computer programming technique involving the use of a procedure, subroutine, function, or algorithm that calls other function in a step.
is a computer programming technique involving the use of a procedure, subroutine, function, or algorithm that calls itself in a step having no termination condition.
None of the above
3.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Which of the following is the best definition of a recursive method?
A method that iterates itself exactly 5 times.
A method that invokes itself by name within the method.
A method that will never iterate infinitely.
A method that cannot be called more than once.
4.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
What is the definition of recursion?
Recursion is a programming technique you can use to allow a method to have numerous fields in its argument.
Recursion is programming technique you can use in which a method calls itself to solve a problem.
Recursion is a programming language model organized around objects rather than "actions" and data rather than logic
Recursion is a program that translates a source program written in some high-level programming language into machine code.
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Name the condition at which the recursive method will stop calling itself.
Base case
Worst Case
Best Case
None of the above
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The program may run out of memory in a
non-recursive function call
recursive function call
condition when too many variables are declared
none of the above
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following condition is true?
Recursion is always better than iteration.
Recursion uses more memory as compared to iteration.
Recursion uses less memory as compared to iteration.
Iteration is always better and simpler than recursion.
Create a free account and access millions of resources
Similar Resources on Wayground
15 questions
CS Algorithms Quiz

Quiz
•
12th Grade
15 questions
Recursion in Java

Quiz
•
11th - 12th Grade
16 questions
Mastering Python Functions

Quiz
•
12th Grade
15 questions
Javascript

Quiz
•
10th - 12th Grade
20 questions
Stack

Quiz
•
12th Grade
20 questions
Python Programming Quiz

Quiz
•
9th Grade - University
15 questions
Basics in Java

Quiz
•
9th - 12th Grade
22 questions
Camp 1_30

Quiz
•
12th Grade
Popular Resources on Wayground
10 questions
Video Games

Quiz
•
6th - 12th Grade
20 questions
Brand Labels

Quiz
•
5th - 12th Grade
15 questions
Core 4 of Customer Service - Student Edition

Quiz
•
6th - 8th Grade
15 questions
What is Bullying?- Bullying Lesson Series 6-12

Lesson
•
11th Grade
25 questions
Multiplication Facts

Quiz
•
5th Grade
15 questions
Subtracting Integers

Quiz
•
7th Grade
22 questions
Adding Integers

Quiz
•
6th Grade
10 questions
Exploring Digital Citizenship Essentials

Interactive video
•
6th - 10th Grade