ds-t3(1)

# 110 101 m r m s 010 a if we assume that the matrices

This preview shows pages 2–4. Sign up to view the full content.

110  101 M R = M S = 010  (a) If we assume that the matrices were constructed using the order listed above for the set A, then R= (b) What is the matrix representing R S? M R S = (c) Construct the digraph representing S in the space below. 4. (10 pts.) (a) Using the prefix code a:001, b:0001, e:1, r:0000, s:0100, t:011, and x:01010, decode the following bit string: 0111001000100100000100 (b) Construct the ordered rooted binary tree representing the following expression: (C - (A B ) )=( ( C-A ) (C - B))

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
TEST-3/MAD2104 Page 3 of 4 5. (15 pts.) (a) Draw a directed graph G 1 whose adjacency matrix is 0110 1001 . (b) Now draw an undirected graph G 2 which is represented by the adjacency matrix in part (a) of this problem. (c) Is G 2 =( V 2 ,E 2 ), above, isomorphic to the simple graph G 3 V 3 ,E 3 ) given below? Either display an isomorphism f:V 2 -> V 3 or very briefly explain why there is no such function by revealing an invariant that one graph has that the other doesn’t.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page2 / 4

110 101 M R M S 010 a If we assume that the matrices were...

This preview shows document pages 2 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online