Queste flashcard non sono ancora salvate — spariranno se lasci la pagina. Crea un account gratuito per conservarle e sbloccare tutto quello qui sotto.
What are the main topics covered in this video?
Sfoglia le tue carte qui, oppure 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).
Sfoglia le tue carte qui, oppure sign up to study with spaced repetition.
In the example, what is the output when 'Test(3)' is called?
3, 2, 1
Sfoglia le tue carte qui, oppure sign up to study with spaced repetition.
How many times does 'Test(n)' call itself when given 'n'?
n+1 times
Sfoglia le tue carte qui, oppure sign up to study with spaced repetition.
How many times is the 'printf' function executed in 'Test(n)'?
n times
Sfoglia le tue carte qui, oppure 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
Sfoglia le tue carte qui, oppure sign up to study with spaced repetition.
What is the time complexity of the function 'Test(n)' in Big O notation?
O(n)
Sfoglia le tue carte qui, oppure sign up to study with spaced repetition.
What is another name for a tracing tree?
Recursive tree
Sfoglia le tue carte qui, oppure 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.
Sfoglia le tue carte qui, oppure sign up to study with spaced repetition.
What is the typical function name used for recurrence relations?
t
Sfoglia le tue carte qui, oppure sign up to study with spaced repetition.
What does 'n' stand for?
Represents a variable or an unspecified number.
Sfoglia le tue carte qui, oppure 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.
Sei sicuro di voler eliminare 0 flashcard? Questa azione non può essere annullata.
Seleziona i tag da rimuovere da 0 flashcard selezionata(e):
Caricamento tag...