阿摩線上測驗
登入
阿摩線上測驗
登入
試卷名稱：104年 - 104 國立中山大學_碩士班招生考試_電機系(丙組)：計算機概論#110053
年份：104年
科目：中山◆電機◆計算機概論
2.Given an integer n 2 0 , the Fibonacci number F(n) is defined as follows.
Whether the problem of finding a Fibonacci number F(n) is NP-complete?
(A) Yes, because there exists a recursive program whose running time (in units of instruction) is at least 1.618",
(B) No, because we can use an iterative approach to derive F(n) such that the running time (in units of instruction) is about n +1；
(C) Yes, because we can use an iterative approach to derive F(n) such that the running time (in units of instruction) is about n+1；
(D) No, because there exists a recursive program whose running time (in units of instruction) is at least 1.618"