Deze flashcards zijn nog niet opgeslagen — ze verdwijnen zodra je weggaat. Maak een gratis account aan om ze te bewaren en krijg toegang tot alles hieronder.
What are the main topics covered in this video?
Bekijk hier je kaarten, of sign up to study with spaced repetition.
What is the basic structure of the C language function 'Test(n)'?
If n > 0, print n and call Test(n-1).
Bekijk hier je kaarten, of sign up to study with spaced repetition.
In the example, what is the output when 'Test(3)' is called?
3, 2, 1
Bekijk hier je kaarten, of sign up to study with spaced repetition.
How many times does 'Test(n)' call itself when given 'n'?
n+1 times
Bekijk hier je kaarten, of sign up to study with spaced repetition.
How many times is the 'printf' function executed in 'Test(n)'?
n times
Bekijk hier je kaarten, of sign up to study with spaced repetition.
If the time taken for 'printf' is one unit, what is the approximate time complexity of 'Test(n)'?
n units of time
Bekijk hier je kaarten, of sign up to study with spaced repetition.
What is the time complexity of the function 'Test(n)' in Big O notation?
O(n)
Bekijk hier je kaarten, of sign up to study with spaced repetition.
What is another name for a tracing tree?
Recursive tree
Bekijk hier je kaarten, of sign up to study with spaced repetition.
What is the next step after finding the time complexity using a tracing tree?
Prepare a recurrence relation for the function.
Bekijk hier je kaarten, of sign up to study with spaced repetition.
What is the typical function name used for recurrence relations?
t
Bekijk hier je kaarten, of sign up to study with spaced repetition.
What does 'n' stand for?
Represents a variable or an unspecified number.
Bekijk hier je kaarten, of sign up to study with spaced repetition.
What are the main topics covered in this video?
What is the basic structure of the C language function 'Test(n)'?
If n > 0, print n and call Test(n-1).
In the example, what is the output when 'Test(3)' is called?
3, 2, 1
How many times does 'Test(n)' call itself when given 'n'?
n+1 times
How many times is the 'printf' function executed in 'Test(n)'?
n times
If the time taken for 'printf' is one unit, what is the approximate time complexity of 'Test(n)'?
n units of time
What is the time complexity of the function 'Test(n)' in Big O notation?
O(n)
What is another name for a tracing tree?
Recursive tree
What is the next step after finding the time complexity using a tracing tree?
Prepare a recurrence relation for the function.
What is the typical function name used for recurrence relations?
t
What does 'n' stand for?
Represents a variable or an unspecified number.
Weet je zeker dat je de volgende 0 flashcard(s) wilt verwijderen? Dit kun je niet ongedaan maken.
Kies tags om te verwijderen uit 0 geselecteerde flashcard(s):
Tags laden...