Practice Defining A Generator Function (3.3.2) - Chapter 3: Generators and Iterators

Practise this section

8 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What keyword is used to define a generator function?
Show hintHide hint
It starts with 'y'.
Question 2.
True or False: A generator function runs all its code at once.
Show hintHide hint
Think about how values are generated.
3Question 3.
What does the 'yield' keyword do in a generator function?
- Returns a value and stops the function
- Continues the function without pause
- Ends the function completely
Show hintHide hint
Think about what happens during execution.
4Question 4.
True or False: Generator functions are less memory-efficient than traditional functions.
- True
- False
Show hintHide hint
Consider how regular functions behave.
Question 5.
Write a generator function that generates Fibonacci numbers up to a given limit.
Show hintHide hint
Use two variables and yield within a while loop.
Question 6.
Create a generator that yields the prime numbers up to a given number n.
Show hintHide hint
Consider how you would check if a number is prime as you yield each.

4 more questions in this section. Enroll free to practise them all.