This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: (a) Determine whether a system with the test graph below is tdiagnosable for (i) t = 1 and (ii) t = 2. B C E F G H A D Explain your answers. (i) t = 1 (ii) t = 2 (b) State true or false with explanation : A test graph of n nodes with n > 2 t and connectivity t is tdiagnosable. 4. (5 points) This question relates to the tech report on equality computation by Liang and Vaidya. Present an algorithm for the MEQAD(3,5) problem. Your algorithm should have the property that the values sent by each node depend entirely on its initial input. Represent your answer using a bipartite graph as in the example in Figure 2 of the report. Recommended exercise: Determine whether your algorithm is optimal....
View
Full
Document
 Spring '08
 Sauer,P
 Algorithms

Click to edit the document details