6. Below is a weird encoding for a 3-bit wordsize that encodes only 0 and prime...

 

Transcribed Image Text:

6. Below is a "weird" encoding for a 3-bit wordsize that encodes only 0 and prime values. Suppose we ask a 3-bit computer to add all possible pairs of values and return the result (in the same encoding, of course). Indiciate which pairs of numbers when summed together produce an overflow. value 0 Bit sequence 000 001 1 010 2 011 3 100 5 101 7 110 11 111 13 9. (5 points) Consider an undirected graph G = (V,E). If we run the BFS algorithm on G, a BFS-tree T results. If we run the DFS algorithm on G, a DFS-tree Td results. If T = Td, what can you say about G. Justify your answer. 6. Below is a "weird" encoding for a 3-bit wordsize that encodes only 0 and prime values. Suppose we ask a 3-bit computer to add all possible pairs of values and return the result (in the same encoding, of course). Indiciate which pairs of numbers when summed together produce an overflow. value 0 Bit sequence 000 001 1 010 2 011 3 100 5 101 7 110 11 111 13 9. (5 points) Consider an undirected graph G = (V,E). If we run the BFS algorithm on G, a BFS-tree T results. If we run the DFS algorithm on G, a DFS-tree Td results. If T = Td, what can you say about G. Justify your answer.