離散數學-台北市立大學資訊科學系.docVIP

臺北巿立教育大學 100學年度研究所碩士班入學考試試題 班 別：資訊科學系碩士班 科 目：離散數學 考試時間：90分鐘【08:20 ? 09:50】 總 分：100分 注意：不必抄題，作答時請將試題題號及答案依照順序寫在答卷上；限用藍色或黑色筆作答，使用其他顏色或鉛筆作答者，所考科目以零分計算。(於本試題紙上作答者，不予計分。) 名詞解釋（共10分） （一）Define the following tree terminologies: (5%) 1.Forest 2.Spanning tree （二）Consider Relations and their properties: (5%) 1.What is an equivalence relation? 2.What is a transitive closure? 二、問答與證明（共90分） (一) G is a graph that has 20 vertices, and all of them have degree five. How many edges does this graph have? (5%) (二) When will a graph have an Euler circuit? (5%) (三) Prove by mathematical induction the formula for sum of the cubes of the first n positive integers: 13 + 23 + 33 + · · · + n3 = (10%) (四) The harmonic numbers, j = 1, 2, 3,... are defined as follows: = 1 + 1/2 + 1/3 + ... + 1/j. What is the value of || when j=1000? Please show all workings. (10%) (五) Consider a source with source alphabet { a1, a2, a3, a4, a5, a6} in which the symbols probabilities are as follows: p1 = 0.50; p2 = 0.011; p3= 0.05; p4 = 0.09; p5 = 0.10; and p6 = 0.15. One possible coding is a1 : 11 a2 : 000 a3 : 01 a4 : 001 a5 : 100 a6 : 101 Compute the expected codeword length for this coding.Please show your workings. (3%) What if we use Huffman coding to improve the expected codeword length. Design the Huffman coding and its expected codeword length. (7%) (六) Construct a Boolean expression having the given table as its truth table followed. Please show all workings. (10%) P Q R S 1 1 1 0 1 1 0 0 1 0 1 0 1 0 0 0 0 1 1 1 0 1 0 1 0 0 1 0 0 0 0 0 (七) Find the number of paths of length 3 between two different vertices in K4. (10%) (八)The figure shown below illustrates one of the path which consists of a minimal number of steps between (0,0) and (5,3). Please count the number of paths between (0,0) and (20,12) such that each path is made up of a minimal number of steps. (10%) (5,3) (0,0)