7. (10%) Capacitive reactance \( X{\mathrm{C}} \) and resistor R in parallel that is supplied by a sine wave voltage \( V{\mathrm{A}} \). Draw the signal waveforms of \( V{\mathrm{A}} \), branch currents \( I{\mathrm{R}} \) and \( I_{\mathrm{C}} \) by showing one cycle. (Fig. 7) (Hint: You must identify \( 90^{\circ} \), \( 180^{\circ} \), \( 270^{\circ} \), and \( 360^{\circ} \) in one cycle.)

8. (10%) Explain (a) channel length modulation of a MOSFET. (b) early effect of a BJT.

9. (10%) How much current is needed for a 24Ω resistor that dissipates 600 Watt?

10. (10%) Draw the Bode plot gain response of the transfer function \( A(s) = 10[(1 + (s / 10^3)] / [(1 + (s / 10^6))] \).

4. (10%) Answer the questions about functions. First, how many functions are there from a set with eight elements to a set with three elements? Second, how many onto functions are there from a set with eight elements to a set with three elements?

5. (10%) Let \( X = \{1, 2, 3, \ldots, 9\} \). Algorithm A lists all 6-permutations of \( X \) in increasing lexicographic order. Algorithm B prints all 6-combinations of \( X \) in increasing lexicographic order where each combination is printed as an increasing sequence. First, find the next five permutations that will be generated by algorithm A after the permutation 321978. Then, find the next five combinations that will be generated by algorithm B after the combination 123689.

6. (10%) Solve the recurrence relation \( a_n = (4 / n)(a_0 + a_1 + \dots + a_{n-1}) \) where \( a_0 = 3 \).

7. (20%) Given the graph shown below, answer the following questions and prove your answers. Does it have a Euler circuit? Does it have a Euler path? Does it have a Hamilton circuit? Does it have a Hamilton path?

26. (5%) Let \( \mathbf{U} \) be an \( n \times n \) unit upper triangular matrix. It is known that \( \mathbf{U} \) is nonsingular. Now, \( \mathbf{U}^{-1} \) is derived by transforming \( [\mathbf{U} \mathbf{I}] \) into \( [\mathbf{I} \mathbf{U}^{-1}] \) via row operations. Use the above derivation method to prove that \( \mathbf{U}^{-1} \) is also unit upper triangular.

(27) (10%) Let \( \mathbf{A} \) be a symmetric positive definite matrix with Cholesky decomposition \( \mathbf{A} = \mathbf{R}_{1}^{\text{T}}\mathbf{R}_{1} = \mathbf{R}_{2}^{\text{T}}\mathbf{R}_{2} \). By using the uniqueness of LDU factorization, prove that the upper triangular matrices \( \mathbf{R}_{1} = \mathbf{R}_{2} \).

1. If \( \mathbf{A}\mathbf{A}^{-1} = \mathbf{I} \), then \( \mathbf{A} \) must be equal to \( \mathbf{I} \) or \( -\mathbf{I} \). (I: the identity matrix)

115年 - [無官方正解]115 國立臺北大學_碩士班一般入學考試試題_金融與合作經營學系：經濟學#147384

115年 - 115 國立臺北大學_碩士班一般入學考試試題_資訊工程學系：線性代數與離散數學#147267

114年 - 114 國立臺北大學_碩士班一般入學考試試題_資訊工程學系：線性代數與離散數學#147271

114年 - 114 國立臺北大學_碩士班一般入學考試試題_民俗藝術與文化資產研究所：語文論述能力(民俗與文化)#147240

113年 - 113 國立臺北大學_碩士班一般入學考試試題_資訊工程學系：線性代數與離散數學#147270

113年 - 113 國立臺北大學_碩士班一般入學考試試題_民俗藝術與文化資產研究所：語文論述能力(民俗與文化)#147238

112年 - [無官方正解]112 國立臺北大學_碩士班一般入學考試試題_資訊工程學系：線性代數與離散數學#147373

112年 - 112 國立臺北大學_碩士班一般入學考試試題_民俗藝術與文化資產研究所：語文論述能力(民俗與文化)#147239

111年 - 111 國立臺北大學_碩士班一般入學考試試題_資訊工程學系：線性代數與離散數學#147257

111年 - 111 國立臺北大學_碩士班一般入學考試試題_民俗藝術與文化資產研究所：語文論述能力(民俗與文化)#147245