Question: MH 1304 FINAL EXAM AAB 132 not (2) This graph 9 K 2 in lo LP lar 300 Galerian chronit. FALL 2020/ 0 Consitar strings

MH 1304 FINAL EXAM AAB 132 not (2) This graph 9 K 2 in lo LP lar 300 Galerian chronit. FALL 2020/ 0 Consitar strings of length 6 (corts.) where first 3 places are letters Now consider than the relation from A, B, C, D & last 3 places numbers from 1,2,3. The numbers R = {(x,y) |X, YET, the sum of can't repeat. So digits of x equals sum of digits good but BAC 112 is good How many total such strings Ris equivalence relation, there? In loxicographic order, what is the [201]. - ? 1st, 200th & last such string? [202]e = ? Write all the equivalence has classes of R. & Compute 3 mod 100. Find it class. Multiply 663, Draw the following graphs Show all ks Pc 0 C the soft steps in detail, verts & elges. EXTRA CREDIT Draw all possible graphs 8 unlabelled verts with t elges. Consider set I from exercise (5) Compute the truth table reln. of the expression prane (pad) V (pv) V S={(xv) | Consider T is the set of digits of equal equals sum of all strings of length 3 using of Y} 0,1,2 many pairs does S have ? Hint First and equestence classes using the procedure we learned 8 with 5027 For each of them tell the num of 6. Consider following equivo S on Ti sum of first 2 first 2 digits How of S
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
