所屬科目:研究所、轉學考(插大)、學士後-計算機概論
1. (20%) (A) Please explain hamming error correction code; (B) What is the corresponding hamming error correction code of the ASCII code of “n” (6E)?
2. (20%) In the studies of information retrieval and image processing, extracting and ranking the significance of data from a large given set is important. Among many available techniques, SVD (singular value decomposition) is effective but inefficient. Explain (A) the main idea of SVD and explain (B) why SVD is not computationally efficient.
3. (20%) In many applications of computers, computing the similarity of two objects is a fundamental and essential task. Let A and B be n-by-n matrices representing the features extracted from two complex objects. Please prove that if B is similar to A, then the two matrices both have the same characteristic polynomial and consequently both have the same eigenvalues.
4. (20%) The study on social network is an emerging research topic. Search for specific relationships in a huge network is a time-consuming task. Therefore, the uses of effective data structures such as tree and graph help improve the search performance. Please prove that looking for an item in a balanced binary tree with n nodes is in Θ(log₂ n)
5. (20%) Recently, a notable informatics event is the cyber battle caused by the shooting of a Taiwanese fishing boat by the Philippine coast guards. Hackers claim that they deploy DDoS attacks and DNS hijacking via the Internet and successfully paralyze many governmental websites of both countries. Please (A) explain DDoS and DNS hijacking and (B) how to prevent such attacks