83. RSA trapdoor pseudo random permutation is the most famous tool used in public key cryptography. Now let\'s see if you know how to derive the trapdoor. Given P=43,q=59, we have n=pq=2537. Let e=13. Please find the trapdoor d that ∀M∈Z_n,M^ed≡M mod n.
(A) 257
(B) 419
(C) 843
(D) 937

79. Given a binary search tree where its node numbers are in [1,1000], now we want to search the number 363. Which one of the following searching orders is impossible？ (A) 925, 202, 911, 240, 912, 245, 363 (B) 2, 252, 401, 398, 330, 344, 397, 363 (C) 924, 220, 911, 244, 898, 258, 362, 363 (D) 2, 399, 387, 219, 266, 382, 381, 278, 363

80. There are three different processors P1, P2, P3 which execute the same instruction set. Their clock rates and CPIs (Cycle Per Instruction) are as the following table. Which processor has the highest performance？ (A) P1 (B) P2 (C) P3 (D) They have the same performance.

81. Which of the following is not an NP-complete problem？ (A) Traveling salesman problem (B) Dominating set problem (C) Subgraph isomorphism problem (D) Discrete logarithm problem

82. What is the meanings of the flowchart symbol, , defined by American National Standard Institute (ANSI)？ (A) Predefined process (B) Multiple Document (C) Decision (D) Start/End

84. How many operations can be defined if a control bus has eight wires？ (A) 8 (B) 16 (C) 256 (D) 512

85. Assuming P≠NP, which one of the following is true ？ (A) NP-complete = NP (B) NP-complete (C) NP-hard = NP (D) P = NP-complete

86. A Turing machine is a mathematical model of computation that defines an abstract machine. Which of the following statement is wrong about the Turing machine？ (A)Turing machine uses random-access memory. (B)In the Turing machine model, it assumes that there is unlimited memory. (C)Even there are more than one tapes in the Turing machine, it still has the same ability with the original version. (D)In the Turing machine, there is a head that can read and write symbols on the tape and move the tape left and right one cell at a time.

87. Which one is the lossy compression methods in data compression？ (A) Run-length encoding (B) Joint photographic experts group (JPEG) (C) Huffman encoding (D) Lempel Ziv (LZ) encoding

88. Let f(n)= f(n-1)+(n-1) , where n ≥ 2 , and let f(1) =0 . Then (A)f(n)=n2-2n+1 (B)f(n)=n2-n (C) (D)

89. When taking pictures in reduced lighting (i.e., low illumination), image noise becomes apparent. One simple way to reduce this granular noise is to take several identical pictures and                  them. (A) XOR (logic operation) (B) average (arithmetic operation) (C) OR (logic operation) (D) AND (logic operation)