阿摩線上測驗 登入

申論題資訊

試卷:110年 - 110 國立高雄大學_碩士班招生考試_資訊工程學系:離散數學與資料結構#102139
科目:研究所、轉學考(插大)◆ 離散數學與資料結構
年份:110年
排序:0

題組內容

6. Consider a 3-gram index below, where 3-gram refers to a string of 3 characters, and the index refers to a link list whose nodes are the vocabulary containing the 3-gram. For instance, the first node in the list is “beetroot”, which contains the 3-gram “etr”. Note that in this data structure, vocabulary terms are lexicographically ordered.6167a59fda972.jpg

申論題內容

(a) (20%) Discuss how to find the intersection nodes of the two lists (the intersection nodes refer to the nodes appear in both of the two lists), and what is the corresponding time complexity.