110年 - [非官方正解]110 國立臺灣師範大學_碩士班招生考試_圖書資訊學研究所：電子計算機概論#108292

科目：研究所、轉學考(插大)◆電子計算機 | 年份：110年 | 選擇題數：10 | 申論題數：6

試卷資訊

選擇題 (10)

(一)A(n)________ join links tables by selecting only the rows with common values in their common attribute(s). (A)equal (B) unique (C) foreign (D)nature

(二) An entity is said to be________ -dependent if it can exist in the database only when it is associated with another related entity occurrence. (A) existence (B) relationship (C)strong (D) weak

(三) The M:N relationship between STUDENT and CLASS must be divided into two 1:M relationships through the use of the ENROLL entity; the ENROLL entity is________ . (A)weak (B)strong (C)optional (D)mandatory

(四) A microkernel is a kernel________ . (A) containing many components that are optimized to reduce resident memory size (B) that is compressed before loading in order to reduce its resident memory size (C) that is compiled to produce the smallest size possible when stored to disk (D) that is stripped of all nonessential components

(五) Thread-specific data is data that________ . (A) is not associated with any process (B) has been modified by the thread but not yet updated to the parent process (C) is copied and not shared with the parent process (D) is generated by the thread independent of the thread's process

(六) What will be the result of the a Python language to print result?

S = ['hello', 'world']

print(S[1][2]) (A)e (B)o (C)w (D)r

(七) In which of the following addition problems (using two's complement notation) does an overflow error occur(發生溢位問題)? (A) (B)(C)(D)

(八) Suppose a binary tree contained the nodes W, X, Y, and Z, and each node had at most one child. How many terminal nodes would be in the tree? (A) One (B) Two (C) Three (D) Undetermined

(九) Consider this set of process p, where P={p₁, p₂, p₃, p₄}, as show in Table 1. The processes are assumed to have arrived in the order p₁, p₂, p₃, p₄. What is the average waiting time for FCFS (first come first serve) algorithm? (A) 9 (B)7 (C)11.25 (D) 11.5

(十) Consider this set of process pi, where P={p₁, p₂, p₃, p₄}, as show in Table 1. The processes are assumed to have arrived in the order p₁, p₂, p₃, p₄. What is the average waiting time for preemptive SJF (shortest job first) algorithm? (A) 9 (B)7 (C) 11.25 (D) 11.5

申論題 (6)

二、資料庫之 ERDiagram轉换為Tabl(十五分)

將下列ER Diagram轉換成Relational Schema 表示並標示出各Relation Schema 的 Primary Key

三、一資料庫中擁有1000篇文章而與某主題(topic1)相關的文獻有100篇,某檢索者由此資料庫檢索到40篇文章,與topic1相關的文章有20篇,請問此次檢索的精確率(Precision)、召回率(Recall)分別為多少?(共計十分)

(1)列出所有最小支持度至少為0.2的3-項目集的集合並計算支持度(support).

(2)列出所有最小支持度至少為0.2 與最小信心度(confidence)至少為0.5的3- 項目集的集合(Support20.2,Confidence≥0.5)

五、何謂監督式學習、非監督式學習?資料探勘中廣為應用的分群法、分類法與關聯規則,分別屬於哪一種學習方式?(十分)

六、申論題:目前已有不少各種形態AR(Augmented Reality)、VR(Virtal Reality)或MR(Mixed Reality)技術應用在圖書館或博物館服務,請舉例與說明相關技術可以在實體圖書館或博物館服務之應用場景(至少250字)(10分)