Bu kartlar henüz kaydedilmedi — sayfayı terk ettiğinde silinecekler. Saklamak ve aşağıdakilerin tümünün kilidini açmak için ücretsiz bir hesap oluştur.
What are the main topics covered in this video?
Kartlarına buradan göz at, veya 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).
Kartlarına buradan göz at, veya sign up to study with spaced repetition.
In the example, what is the output when 'Test(3)' is called?
3, 2, 1
Kartlarına buradan göz at, veya sign up to study with spaced repetition.
How many times does 'Test(n)' call itself when given 'n'?
n+1 times
Kartlarına buradan göz at, veya sign up to study with spaced repetition.
How many times is the 'printf' function executed in 'Test(n)'?
n times
Kartlarına buradan göz at, veya 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
Kartlarına buradan göz at, veya sign up to study with spaced repetition.
What is the time complexity of the function 'Test(n)' in Big O notation?
O(n)
Kartlarına buradan göz at, veya sign up to study with spaced repetition.
What is another name for a tracing tree?
Recursive tree
Kartlarına buradan göz at, veya 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.
Kartlarına buradan göz at, veya sign up to study with spaced repetition.
What is the typical function name used for recurrence relations?
t
Kartlarına buradan göz at, veya sign up to study with spaced repetition.
What does 'n' stand for?
Represents a variable or an unspecified number.
Kartlarına buradan göz at, veya 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.
Silmek istediğine emin misin 0 kart(lar)? Bu işlem geri alınamaz.
Silinecek etiketleri seç 0 seçili kart(lar):
Etiketler yükleniyor...