11 cards generated

덱이 사라지기 전에 저장해 둬

이 플래시카드는 아직 저장되지 않았어 — 페이지를 나가면 사라져. 무료 계정을 만들면 저장되고 아래 기능들도 모두 이용할 수 있어.

저장하고 공부하기

Save this deck to your account
Study with spaced repetition
Export to Anki (.apkg) or PDF

더 크고 더 나은 생성

Process documents up to 100 pages
Images extracted from your PDFs
Sharper text extraction & a more advanced AI model

youtube.com/watch?v=4V30R3I1vLI

공개

1 / 11 Q&A

What are the main topics covered in this video?

Click to reveal

여기에서 카드를 살펴보거나 sign up to study with spaced repetition.

2 / 11 Q&A

What is the basic structure of the C language function 'Test(n)'?

Click to reveal

여기에서 카드를 살펴보거나 sign up to study with spaced repetition.

3 / 11 Q&A

In the example, what is the output when 'Test(3)' is called?

Click to reveal

여기에서 카드를 살펴보거나 sign up to study with spaced repetition.

4 / 11 Q&A

How many times does 'Test(n)' call itself when given 'n'?

Click to reveal

여기에서 카드를 살펴보거나 sign up to study with spaced repetition.

5 / 11 Q&A

How many times is the 'printf' function executed in 'Test(n)'?

Click to reveal

여기에서 카드를 살펴보거나 sign up to study with spaced repetition.

6 / 11 Q&A

If the time taken for 'printf' is one unit, what is the approximate time complexity of 'Test(n)'?

Click to reveal

여기에서 카드를 살펴보거나 sign up to study with spaced repetition.

7 / 11 Q&A

What is the time complexity of the function 'Test(n)' in Big O notation?

Click to reveal

여기에서 카드를 살펴보거나 sign up to study with spaced repetition.

8 / 11 Q&A

What is another name for a tracing tree?

Click to reveal

여기에서 카드를 살펴보거나 sign up to study with spaced repetition.

9 / 11 Q&A

What is the next step after finding the time complexity using a tracing tree?

Click to reveal

여기에서 카드를 살펴보거나 sign up to study with spaced repetition.

10 / 11 Q&A

What is the typical function name used for recurrence relations?

Click to reveal

여기에서 카드를 살펴보거나 sign up to study with spaced repetition.

11 / 11 Q&A

What does 'n' stand for?

Click to reveal

여기에서 카드를 살펴보거나 sign up to study with spaced repetition.

Flashcards in this deck (11)

검색 중...

What are the main topics covered in this video?
- Tracing a recursive function.
- Writing a recurrence relation.
- Solving a recurrence relation.
recursion recurrence_relation algorithms
What is the basic structure of the C language function 'Test(n)'?

If n > 0, print n and call Test(n-1).

c_language recursion programming
In the example, what is the output when 'Test(3)' is called?

3, 2, 1

recursion tracing example
How many times does 'Test(n)' call itself when given 'n'?

n+1 times

recursion calls
How many times is the 'printf' function executed in 'Test(n)'?

n times

printf execution
If the time taken for 'printf' is one unit, what is the approximate time complexity of 'Test(n)'?

n units of time

time_complexity approximation
What is the time complexity of the function 'Test(n)' in Big O notation?

O(n)

time_complexity big_o_notation
What is another name for a tracing tree?

Recursive tree

tracing recursion tree
What is the next step after finding the time complexity using a tracing tree?

Prepare a recurrence relation for the function.

recurrence_relation algorithms
What is the typical function name used for recurrence relations?

t

recurrence_relation notation
What does 'n' stand for?

Represents a variable or an unspecified number.

math algebra

덱이 사라지기 전에 저장해 둬

youtube.com/watch?v=4V30R3I1vLI

정보

학습하기

내보내기

편집

관리

Flashcards in this deck (11)