信计11级 离散数学A试题 B卷.doc

  1. 1、本文档共5页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
信计11级 离散数学A试题 B卷

山东建筑大学试卷 共 5 页 第1页 2012 至 2013 学年第 1 学期 考试时间: 120 分钟 课程名称: 离散数学A B卷 考试形式:闭卷 年级: 11 专业: 信息与计算科学 ;层次:本科 题号 一 二 三 四 五 总分 分数 一、填空题(每小题2分,共30分) 1. Let p be the proposition: The message is scanned for viruses and q: The message was sent from an unknown system”. Write the following statement in terms of p, q and logical connectives. It is necessary to scan the message for viruses whenever it was sent from an unknown system.___________ 2. Let P(x) be the statement x can speak Russian and let Q(x) be the statement x knows the computer language C++. Express the statement “There is a student at your school who can speak Russian and who knows C++” in terms of P(x), Q(x), quantifiers(量词), and logical connectives ___________. The domain for quantifiers consists of all students at your school. 3. Let A={1,2,…,30}, define a relation R on A by aRb if and only if | a-b|( 5 (a, b (A), determine whether R is symmetric. 4. Let A={a, b, c}, R={ (b, c), ( b, b) } be a relation on A, then the symmetric closure (对称闭包) of R is ________________________. 5. Let A= {3, 7, 1}, define a relation R on A by xRy if and only if x-y 4. Let MR=(mij) be the matrix of the relation R, then m21 = , m22= . 6. Determine whether the lattice shown in Figure 1 is distributive (分配的). _______. 7. In a poset whose Hasse diagram shown in Figure 2, the least upper bound (最小上界) of B={ c, d, e} 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 D60 is a Boolean algebra. _________ 9. Is the poset A={2, 3, 6, 18} under the relation of divisibility a lattice? _______. 10. Suppose f : N ? N has the rule f(n) = 3n+2. Determine whether f is one-to-one? ___________. 11. Use the Huffman code tree in Figure 3 to decode the message: 000110000101 (用图3中的Huffman编码树,译出信息: 000110000101) ___________. 12.

文档评论(0)

yan698698 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档