11. What is the output of the following program :
(A) 1
(B) 2
(C) 3
(D) 4 

12. What is the output of the following program: (A) 1,2,3 (B) 1,3,0 (C) 5,3,0 (D) 0,3,5

13. The following function return true when ____________.(A) s is string with same char. (B) s is a palindrome. (C) s is empty. (D) all of the above.

14. Given the following functions for Stack operation, please fill the blanks with correct statements. (A) code1: s[top++] , code2: s[top--] (B) code1: s[++top] , code2: s[--top] (C) code1: s[top++] , code2: s[--top] (D) code1: s[++top] , code2: s[top--]

15. Suppose p is a pointer of node points to the rear of a circular linked list. Initially, p = null.The following program codes will insert a node pointed by pointer q at the front of the circuler list. Please fill in the blanks. (A) code1: p , code2: q (B) code1: p , code2: q-＞link (C) code1: p-＞link , code2: q (D) code1: p-＞link , code2: q-＞link

16. Suppose p is a pointer of node points to the rear of a circular linked list. Initially, p = null. Suppose we have another linked list pointed by avail which links the unused space together. The following program will erase the circular list into the single linked list pointed by avail. Please fill the blanks.(A) code1: p-＞link-＞link, code2: p (B) code1: p , code2: p-＞link-＞link (C) code1: temp , code2: avail (D) code1: avail , code2: temp

17. Let T be a binary search tree with left and right pointers as usual.What does the function M(T) compute? (A) The height of T. (B) 1 + the height of T. (C) The number of keys in T. (D) The number of nodes in the extended version of T.

18. Consider we have n disks with size of S1,S2,...Sn to build RAID system with. Which of the following statements is NOT true? (A) For RAID 0, the capacity = Sum(S1,S2,...Sn),no fault tolerance. (B) For RAID 1, the capacity = Min(S1,S2,...Sn),fault tolerance = n-1. (C) For RAID 5, the capacity = (N-1)*Min(S1,S2,...Sn),fault tolerance = 1. (D) For RAID 10, the capacity = (N-2)*Min(S1,S2,...Sn),fault tolerance = 2.

19. How many of the following errors can NOT be detected during program compiling? (A)4 (B)5 (C)6 (D)7

20. Amdahl's law is often used in parallel computing to predict the theoretical speedup when using multiple processors. Assume we have a program that is 80% parallelizable, What is the theoretical speedup gained by running on Quad-Core machine relative to a Single-Core machine ? (A)2.5 (B)4 (C)0.8 (D)3.2

21. Which of the following statements about Hamilton Path/Circuit is True? (A) A Hamiltonian path is a path in an undirected or directed graph that visits each edge exactly once. (B) Determining whether Hamiltonian paths and cycles exist in graphs is polynomial. (C) A simple graph with n vertices (n ＞= 3) is Hamiltonian if every vertex has degree n / 2 or greater. (D) A graph with n vertices (n ＞= 3) is Hamiltonian if, for every pair of non-adjacent vertices, the sum of their degrees is n/2 or greater.

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

115年 - 115 臺北市立成淵高級中學_正式教師甄選試題：高中資訊科#139666

115年 - 115 教育部受託辦理公立高級中等學校教師甄選試題：資訊科技科#139592

115年 - 115-1 國立頭城高級家事商業職業學校_教師甄選試題：資料處理科#138785

115年 - 115-1 國立竹東高級中學_教師甄試試題：資訊科技概論科#138750

115年 - 115-1 國立羅東高中_教師甄選初試試題：資訊科#138680

115年 - 115-1 國立蘭陽女子高級中學_教師甄選試題︰資訊科技科#138669

115年 - 115 國立屏科實驗高級中等學校_教師甄選：國小資訊專長#138635

115年 - 115 國立屏科實驗高級中等學校_教師甄選：高中資訊科技科#138625

115年 - 115-1 臺北市立大同高級中學_教師甄選初選試題：高中資訊科技科#138590