61. Quantum computing is a type of computation that harnesses the collective properties of quantum states. The existence of the quantum computer seriously affects current cryptographic primitives since there are some quantum algorithms that can break hardness assumptions. Which one of the following cryptographic primitives can still be used in the quantum era？
(A) RSA trapdoor permutation
(B) Diffie-Hellman key exchange protocol
(C) Digital Signature Algorithm
(D) SHA256 

41. Regarding QUICKSORT, which of the following statements is WRONG？ (A)When there is an array of length n, all elements of which have the same value, when QUICKSORT is used to sort this array, the execution time is Θ(n 2 ) (B)The best execution time of QUICKSORT is Θ(n 2 ) (C)Same as the previous array. When all elements have different values, and sorted in descending order first, use QUICKSORT to sort this array, and its execution time is Θ(n 2 ) (D)The worst execution time of QUICKSORT is Θ(n 2 )

42. Assuming that each of the following bit patterns initially has even parity, which one is WRONG？ (A) 0010011000 (B) 0100011001 (C) 0110000011 (D) 0100110100

43. In the artificial neural network, which of the following input connection weights will cause only the neuron with both inputs to be 1, and the threshold value of 3 to output 1？ (A) 0, 0 (B) 2, 0 (C) 0, 2 (D) 2, 2

44. In a programming language, which of the following is not a loop？ (A) Repeat statement (B) For statement (C) If- else statement (D) While statement

45. In software engineering, which of the following is NOT a tool for designing modular systems？ (A) Sequence diagrams (B) Structure charts (C) Class diagrams (D) Data dictionaries

46. Regarding HEAPSORT, which of the following statements is WRONG？ (A)The worst execution time of HEAPSORT is Ω(n2 ) (B)The same as the previous item, but it is changed to sort in descending order first, then use HEAPSORT to sort the array and its execution time is Θ(nlogn) (C)There is an array of length n, which has been sorted in ascending order. When using HEAPSORT to sort this array, the execution time is Θ(nlogn) (D)When the elements in the array are not the same, the best execution time of HEAPSORT is Ω(nlogn) 

47. Suppose there is a binary tree whose number of nodes is 2n , (n is a positive integer), how many nodes does this binary tree contain at least？ (A) (B) (C) (D)

48. At which layer of the TCP/IP hierarchy, the messages are divided into Internet-compatible units？ (A) Network layer (B) Transport layer (C) Application layer (D) Link layer

49. Given the relation below what values will be retrieved by the following SQL statement？ SELECT A, B FROM Y WHERE Y.B = Y.C (A) 2, 5 (B) 3, 6 (C) 5, 2 (D) 2, 2

50. Turing machines include？ (A) Paper tape and punch (B) a graphics processor and solid state drive (C) a central processing unit and main memory (D) a read/write head and a tape

114年 - 114 新北市公立高級中等學校_教師聯合甄選試題：資訊科技科#129033

114年 - 114 臺南市市立國民中學_正式教師聯合甄選試題：資訊科技專門科目#128069

114年 - 114 桃園市國民中學新進教師聯合甄選試題：資訊科技科#127897

114年 - 114 中區縣市政府策略聯盟教師甄選：國中資訊科技#127548

114年 - 114 臺北市市立國民中學正式教師聯合甄選：資訊科技科#127510

114年 - 114 基隆市市立中山、安樂、八斗高級中學_教師甄選試題：資訊科技科#127291

114年 - 114 新北市立國民中學_教師聯合甄選試題：資訊科技科#127263

114年 - 114 臺北市公立國民小學教師聯合甄選初試專門類科知能試題﹕資訊科技科#127125

114年 - 114-1 新竹縣立湖口高中_教師甄選試題﹕資訊科技科#127023

114年 - 114 新竹市立香山高級中學_教師甄選試題：高中資訊科技#126975