文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > IT/计算机 > 机械工业出版社离散数学英文版部分答案8
侵权投诉

机械工业出版社离散数学英文版部分答案8

Homework8

8.1:P527

Ex4: a) anitisymmetric, transitive b)reflexive; symmetric; transitive

c)reflexive; symmetric; transitive d)reflexive; symmetric

Ex30: {(1,1),(1,2),(2,1),(2,2)}

8.2:P536

Ex6: We see that the “Professor” filed by itself is not a key, since there is more than one 5-tuple containing the same professor. We can make the identification of the tuple unique by including the course number as well, or by including the time as well.

Ex12: (9191,2,80,4)

8.3:P542

1

0Ex2 b)

0

1010000101 0 00 d) 10 0 0

th001000000 1 1 0 th-1Ex12: we take the transpose of the matrix, since we want the (i,j) entry of the matrix for R to be 1 if and only if the (j,i) entry of R is 1.

8.4:P553

Ex2: When we add all the pairs (x,x) to the given relation we have all of Z Z; in other words, we have the relation that always holds.

Ex10: The symmetric closure was found in Example 2 to be the “is not equal to” relation. If we now make this relation reflexive as well, we will have the relation that always holds.

3Ex19 b) The matrix for R is the Boolean product of the first matrix displayed above with the

1

1

1

1

11001010111101100 1 1 . 0 1 answer to part (a), namelyMR3

8.5:P562

Ex2 a) This is an equivalence relation. b) This is an equivalence relation.

c) This is not an equivalence relation. d) This is not an equivalence relation.

e)This is not an equivalence relation.

Ex12: This follows from Exercise 9, where f is the function that takes a bit string of length n>=3 to its last n-3 bits.

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email