7.Assume that a machine cycle consists of three phase: fetch, decode, and execute； besides, the time to execute each phase is T. Then how long do we need to execute n instructions when using the pipelining technique? Note that we assume that these n instructions are independent. (A) 3nT, (B) nT, (C) n +2T, (D) (n + 2)T.

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"

相關試題

相關試卷