第二节离散数学试题.PDF

銘傳大學八十七學年度資訊管理研究所碩士班招生考試 第二節 離散數學 試題 The points are indicated at the rear of the (sub)problem. 1. (a) The edges of complete graph K6 are colored in either red or blue. Prove that there must be a red triangle or a blue triangle. {10%} (b) Does the above property hold for complete graph K5? If so, prove it; otherwise, disprove it by giving a counter example.{5%} 2. For the graph given below, find (a) a minimum spanning thee, (b) an Eulerian path, (c) a maximal independent set, and (d) a minimal dominating set. {3% each} 3. Is there a Hamiltonian path in the graph given below? Why? {6%} 4. Let Θ denote a binary relation denned on set A = {2, 3, 4, 6, 12, 16, 18, 24, 32} by divisibility. i.e. for x, y ε A, x Θy if and only if x divides y. (a) Which of the four properties “reflexive, transitive, symmetric, and anti-symmetric” are satisfied? {5%} (b) Draw the corresponding Hass Diagram. {5%} 5. Define recurrence relations, including their initial conditions, for the following problems:(You do not have to solve it.) (a) Let H(n) denote the number of moves when dealing with n discs in Hanoi Tower problem. {5%} (b) A code word defined on the alphabet {0, 1, 2, 3} is legitimate if and only if it has an even number of 0's. Let C(n) denote the number of legitimate code words of length n. {5%} 6. Suppose that G is a permutation group defined on set A == {1,2,3}. Let S be a binary relation defined on set A such that for x, y εA. xSy if and only if there is a permutation π in G such that π(x)=y. Show that S is an equivalence relation.{10%} 7. Find the number of non-negative