信计08级离散数学A试题 A卷.docVIP

山东建筑大学试卷 共 4页 第1页 2009至2010第 1 学期 课程名称 离散数学A 试卷 A （A、B）Let p: I will study discrete structures; q: I will go to a movie. Write the following statement in terms of p, q and logical connectives. “I will go to a movie only if I will not study discrete structures.” ________________ 2. Let R(x, y): x+y is even. The variables x and y represent integers. The truth value of the statement “(x(y R(x, y)” is____________. 3. Let A={1，2，…，10}, define a relation R on A by aRb if and only if | a-b|( 2 (a, b (A), determine whether R is transitive. 4. Let A={1, 2, 3}, R={(1, 2), (3, 3)} be a relation on A, then the reflexive closure (自反闭包) of R is ____________________. 5. Let A= {3, 7, 11}, define a relation R on A by xRy if and only if x-y 3. Let MR=(mij) be the matrix of the relation R, then m12 = , m33= . 6. Determine whether the lattice shown in Figure 1 is complemented (有补的). _______ 7. In a poset whose Hasse diagram shown in Figure 2, the greatest lower bound (最大下界) of B = {d, e, f } is . 8. Let n be a positive integer and let Dn be the set of all positive divisors of n. Then Dn is a lattice under the relation of divisibility. Determine whether D42 is a Boolean algebra. _________. 9. Let A={1, 2, 3, 4}, R={(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (3, 4), (4, 3), (4, 4)} be an equivalence relation on A, then the equivalence class [1]= _________. 10. Given the Boolean function described by the logic diagram in Figure 3.___________________ 11. Use the Huffman code tree in Figure 4 to decode the message 0111001101 (用图4中的Huffman编码树，译出信息0111001101) ________________. 12.Whether the graph shown in Figure 5 has an Euler circuit? . 13. Let S={1, 2, 3}, for P(S), * is defined as intersection, then (P(S), *) is a monoid, and the identity is ________________. 14. If S is a nonempty set, for A, B(P(S), * is defined as A*B=A(B (symmetric differen