Name Surname Date Discrete Structures Computer Science Examination Questions Mandatory R Q43814308
‘Discrete structure of computer science. please show all thesteps and answer urgnet. Thaks
Name Surname Date:…….. . DISCRETE STRUCTURES OF COMPUTER SCIENCE Examination questions Mandatory requirement: There must be no more than 9 answers. To receive grades 8.9 or 10, there must be answers to questions from each block, including 2 answers from 4th and Sth block ©ách. The first block (relations) QI (point). Define the lexicographical order which is based on the relation 0 <1 for the given bit string 0, 1,01, 11, 001,010, 011, 0001, 1101. Q2 (2 points). Determine whether the relation R on the set of all integers is reflexive, symmetric, antisymmetric, and/or transitive, where ) ER if and only if xay. Q3 (3 points). Determine which of the following relations defined in the set (1, 2, 3, 4) are equivalence relations. If some relation is not an equivalence relation, determine which properties are missing d) {(3.4) 4 3), (3, 1) (3,310.4),(4,1). (43), 3, 3), (3, 4)) a) {(2, 2), (2, 1), (2, 3), (1, 2), (1, 1), (1,3), (3, 2), (3, 3), (3,4)) b) ((2, 2), (1, 1), (1.4), (3, 3), (3.4),(4,1). (4,3), (4,4)} c) {(1, 1), (1.3), (3, 1), (3, 3), (4,1),(4,4),(4,3)} d) {(3,4),(4,3), (4,4), (2, 2), (2,3), (3, 2), (3, 3)) e) {(1, 1), (1,3), (3, 1), (3, 3), (2, 2), (4,4)} 1 ((3,3), (4,4), (2, 2), (1, 1)) 40,2 0,383), 0,3 43) Place for an Show transcribed image text Name Surname Date:…….. . DISCRETE STRUCTURES OF COMPUTER SCIENCE Examination questions Mandatory requirement: There must be no more than 9 answers. To receive grades 8.9 or 10, there must be answers to questions from each block, including 2 answers from 4th and Sth block ©ách. The first block (relations) QI (point). Define the lexicographical order which is based on the relation 0
Expert Answer
Answer to Name Surname Date:…….. . DISCRETE STRUCTURES OF COMPUTER SCIENCE Examination questions Mandatory requirement: There …
OR