- 1、本文档共3页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
选择题20分
10题多选题
1, Let B={?}, A =ρ(ρ(B)), find the correct ones in following statements:
(1) ?∈A (2) {?,{ ? }}∈A (3) {?,{{?}}∈A (4) {?,{{?}}A
2, Let R be a relation on A={1,2,3,…,10}, R={(x,y)|x+y = 10, x,y∈A}, then R is:
(1) reflexive (2) symmetric (3) transitive (4) antisymmetric
3, Let |A| = n, how many binary operations can we define on A:
2nn2(1) 2n (2) n2 (3) n
2n
n2
4, operation defined as following, which ones can not make ({a,b},*) a monoid?
(1) (2) LINK Word.Document.8 F:\\离散试卷.doc OLE_LINK1 \a \r (3) (4)
5, which ones are lattices in the following posets?
(1)(2)
(1)
(2)
(3)
(4)
6,Let directed graph D = V,E, then:
(1), EV×V (2), EV×V (3) E=V×V (4) V×VE
7, In a connected undirected graph with n vertices, the number of edges is
(1) at least n-1 (2) at least n (3) at most n(n-1)/2 (4) at most n2/2
8, which one is tautology?
(1) (P∧(P→Q))→Q (2)P→(P∨Q) (3) P→(P∧Q) (4)(P→Q)→Q
9,In the following sentences, which one is true?
(1), (2),
(3), (4),
10,How many numbers must be chosen from 1 to 25 to ensure that one of them is a multiple of another?
(1)12 (2)13 (3)14 (4)15
计算题25分
1,Let p be the proposition “I will do every exercise in this book” and q be the proposition “I will get an ‘A’ in this course.” Express each of the following as a combination of p and q:
a), I will get an ‘A’ in this course only if I will do every exercise in this book.
b), I will get an ‘A’ in this course and I will do every exercise in this book.
c), Either I will not get an ‘A’ in this course or I will not do every exercise in this book.
d), For me to get an ‘A’ in this course it is necessary and sufficient that I do every exercise in this book.
2, What is the coefficient of x12y13 in the expansion of (2x-3y)25
3,compute the connectivity relation for R defined by the following matrix (detail steps needed):
4, From point A, use Prim’s algorithm to find a minimum spanning tree in the following graph(detail steps needed):
E
E
A
3
D
2
F
4
文档评论(0)