3.For dx dy ,(1)sketch the region of integration； (2) switch the order of integration and evaluate the integral.

4. Evaluate the line integral ，where C. line segment from (1, 1) to (Hint:)

5.Find the area of the region Iying between the inner and outer loops of the limacon r(θ) =1-2sinθ.

(a) CISC

(b) RISC

(e) Reconfigurable Computing

(d) Multi-core Processor

[Problem 2] Suppose we are considering a change to an instruction set. The base machine is a load-store machine. Measurements of the load-store machine showing the instruction mix and clock cycle counts per instructions are given in the following table:       Let's assume that 25% of the ALU operations directly use a loaded operand that is not used again. We propose adding ALU instructions that have one source operand in memory. These new register-memory instructions have a clock cycle count of 2. Suppose that the extended instruction set increases the clock cycle count for branches by 1, but it does not affect the clock eycle time, Would this change improve CPU performance? Explain your answer. (20%)

[Problem 3] A set associative cache has a block size of four 64-bit words and a set size of 4. The cache can accommodate a total of 256K words. The main memory size that is cacheable is 512M * 64 bits. Design the cache structure and show how the processor's addresses are interpreted. (20%)

[Problem 4] Design an 8-bits multiplier in Booth's Algorithm. (15%)

[Problem 5] Use the following code fragment:Loop:     Assume the initial value of R3 is R2+200. Use the five-stage instruction pipeline ( IF, DEC, EXE, MEM, WB) and assume all memory accesses are one cycle operation. Furthermore, branches are resolved in MEM.     Show the timing of this instruction sequence for the five-stage instruction pipeline with normal forwarding and bypassing hardware.     Assume that branch is handled by predicting it has not taken. How many cycles does this loop take to execute? (10%) Assuming the five-stage instruction pipeline with a single-cycle delayed branch and normal forwarding and bypassing hardware, schedule the instructions in the loop including the branch- delay slot. You may reorder instructions and modify the individual instruction operands, but do not undertake other loop transformations that change the number of op-code of instructions in the loop. Show a pipeline timing diagram and compute the number of eyeles needed to execute the entire loop. (15%

115年 - 115 中央警察大學_碩士班入學考試試題_海洋科技組：微積分#139855

115年 - 115 中央警察大學_碩士班入學考試試題_消防科學研究所、交通管理研究所：微積分#139760

114年 - 114 臺灣綜合大學系統_學士班轉學生考試試題:微積分A#137897

114年 - 114 臺灣綜合大學系統_學士班轉學生考試試題：微積分B#137819

114年 - 114 台灣聯合大學系統_學士班轉學生考試試題:微積分#137762

114年 - 114 台灣聯合大學系統_學士班轉學生考試試題:微積分#137761

114年 - 114 國立臺灣大學_轉學生招生考試_物理學系/土木工程學系/生物環境系統工程學系/生物機電工程學系:微積分(B)#137745

114年 - 114 國立臺灣大學_轉學生招生考試_數學系:微積分(A)#137744

113年 - 113 國立嘉義大學_轉學生招生考試試題_(全校)：微積分#122986

112年 - 112 國立臺灣大學_碩士班招生考試題：微積分(D)#130254