77. 下列哪一CPU排程法主要為分時作業系統而設計的？
(A)先到先服務（First Come First Served）排程法
(B)最短工作優先（Shortest Job First）排程法
(C)優先等級（Priority）排程法
(D)知更鳥式循環（Round Robin, RR）排程法

78. 已知一組尚未排序的數據為：4,1,2,5,3觀察以下數據間順序產生的變化，研判該數 據採用了哪一種排序演算法？ 4,1,2,5,3 → 1,4,2,5,3  → 1,2,4,5,3  → 1,2,3,5,4  → 1,2,3,4,5 (A)Selection sort (B)Insertion sort (C)Merge sort (D)Quick sort

79. 現今極大多數的網站均採用HTTPS協定，而不再採用HTTP協定，主要的原因是什 麼？ (A)網路傳輸速度將會有明顯提升 (B)新的HTML技術已陸續不再支援HTTP連線格式 (C)採用更高規格的加密協議，確保使用者瀏覽安全 (D)較高的瀏覽器版本已朝開發64位元版本，而無法執行HTTP版本

80. 關於Arduino之程式設計，下列敘述何者正確？ (A)程式只能讀取數位資料 (B)setup( )是無窮迴圈 (C)loop( )只會執行一次 (D)loop( )是無窮迴圈

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)

113年 - 113 金門縣國民小學教師聯合甄選試題：資訊科技專業科目#120867

113年 - 113 高雄市市立國民小學_教師聯合甄選：專長類-資訊試卷#120693

112年 - 112 新北市國民小學暨幼兒園教師甄選試題：資訊科#118895

112年 - 112-1 國立臺東大學附設實驗國民小學教師甄選試題:資訊專業科目#115036

112年 - 112 臺北市市立國民中學正式教師聯合甄選:資訊科技(雙語)科#114640

112年 - 112 臺北市市立國民中學正式教師聯合甄選:資訊科技科#114633

112年 - 112 高雄市市立高級中等學校聯合教師甄選試題：資料處理科#114465

112年 - 112-1 國立東華大學附設實驗國民小學教師甄選題目:資訊專業#114445

112年 - 112 臺北市市立普通型暨技術型高級中等學校正式教師聯合甄選：資料處理科#114335

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