阿摩線上測驗
登入
首頁
>
教甄◆資訊科技概論專業(電腦科)
>
109年 - 109 臺北市市立國民中學正式教師聯合甄選:資訊科技(雙語)科#85971
> 試題詳解
78. Which programming language uses interpreter to translate its code?
(A) C++
(B) Java
(C) Pascal
(D) Python
答案:
登入後查看
統計:
A(13), B(5), C(9), D(67), E(0) #2320365
私人筆記 (共 1 筆)
anita-home+go
2021/06/15
私人筆記#3186580
未解鎖
interpreter
(共 11 字,隱藏中)
前往觀看
0
0
相關試題
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
#2320366
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.
#2320367
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
#2320368
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
#2320369
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∈Zn,Med≡M mod n. (A) 257 (B) 419 (C) 843 (D) 937
#2320370
84. How many operations can be defined if a control bus has eight wires? (A) 8 (B) 16 (C) 256 (D) 512
#2320371
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
#2320372
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.
#2320373
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
#2320374
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)
#2320375
相關試卷
115年 - 115 臺北市公立國民小學教師聯合甄選初試專門類科知能試題:資訊科技科#139878
2026 年 · #139878
115年 - 115 臺北市立成淵高級中學_正式教師甄選試題:高中資訊科#139666
2026 年 · #139666
115年 - 115 教育部受託辦理公立高級中等學校教師甄選試題:資訊科技科#139592
2026 年 · #139592
115年 - 115-1 國立頭城高級家事商業職業學校_教師甄選試題:資料處理科#138785
2026 年 · #138785
115年 - 115-1 國立竹東高級中學_教師甄試試題:資訊科技概論科#138750
2026 年 · #138750
115年 - 115-1 國立羅東高中_教師甄選初試試題:資訊科#138680
2026 年 · #138680
115年 - 115-1 國立蘭陽女子高級中學_教師甄選試題︰資訊科技科#138669
2026 年 · #138669
115年 - 115 國立屏科實驗高級中等學校_教師甄選:國小資訊專長#138635
2026 年 · #138635
115年 - 115 國立屏科實驗高級中等學校_教師甄選:高中資訊科技科#138625
2026 年 · #138625
115年 - 115-1 臺北市立大同高級中學_教師甄選初選試題:高中資訊科技科#138590
2026 年 · #138590