KAIST 산업및시스템공학과 문일철_ 데이터 구조 및 분석 수업을 참고하여 작성하였습니다

ch_4_7 Quiz 4

Quiz 4

1. Recursion is a method to call a function within a function with reduced parameter size.
-> T

2. The notion of recursion is similar to the notion of mathematical induction.
-> T

3. Dynamic programming stores the results of previous function calls to reuse in the future.
-> T

4. Dynamic programming cannot be transformed into recursion.
-> F

5. The problem of recursion is excessive function calls.
-> T

6. Figure below is a process of assembly line scheduling. Chart (a) represents lasting time. We want to complete the charts.

6 & 7. What is the value for location with L1 and 3 in Table - (L1, 3)?
-> 21

8. Write the fastest path and time of this process.
Path : Start - (   ) - (   ) - (   ) - End.
-> S_21 - S_12 - S_13

1. What is the time of this process?
Time : (     )
-> 22