Question

5. If we apply binary dilation to the same large object twice using the same small structuring element, the effect, if any, of the second dilation on the object is that the object: (a) is unchanged (b) is completely removed (c) becomes larger (d) becomes smaller (e) does not change 6. Which of the following is/are true? (a) Dijkstra's algorithm can be used to find shortest paths in a network (b) Dijkstra's algorithm is a method to find straight lines in images (c) Dijkstra's algorithm is a fast algorithm for determining chain codes (d) All of the above (e) None of the above 7. When computing the shortest path from A to Z in Figure 2 using Dijkstra's algorithm as described in lectures, which of the following statements is/are true? Note: As in the lectures, visit nodes in alphabetic order when there is a choice of shortest path F 1 2 2 2 2 G 3 10 2 E Figure 2 The shortest path from A to Z has distance 11 (i) Node C becomes a trial point before D. (ii) (iii) The shortest path obtained by the algorithm passes through node I (a) both (i) and (i) (b) both (i) and (ii) (c) only (i) (d) only (ii) (e) neither (i) nor (ii) N eee 8. Following the example in lectures, we wish to use dynamic programming to match two strings. The LEFT string is EALEPANT and the TOP string is ELEPHANT. The following string operations have the conventional costs: Delete LEFT 1 Delete TOP 1 Match 0 What is the cost of matching two substrings ELEP to EALE illustrated by the shaded square d(3,4) in the table below? (a) 2 (b) 3 (c) 4 (d) 5 (e) None of the above E P H T E A L E P A T Z 0.

Answer 1

(6).DijKstra's algorithr algovithm is an paths for shontest finding the raph/ be toeen nodes in a hetuoork. only (A) There fore, the answer to find nouhere osed ES Enages & for nodes Lines chain deteimsn ng graph Gven 9. 6 3 18 have We pust shortest to Path between (A -3) Path Gnsider the we -H-2(22+) 8- D E- : shoT test path olso possible with (o) weght So, (A) TOng S

s the if,the werght of lo totol t does ot path, then Shortest vertex (i) therefore Passes the not tre. also option (c) sjol poir Node beores o C shortest path before 'o' i-e not O Theiefore, the fino L answer ts 6. pilation is two of the one the basic avea OpeTO tors of maths The basic effect of the objeob OpeTO toY on gradoally enlorge the boondarių to af resions of foregroun pyol apply. twice, TheTcfore, f we sige then inTeases Theefoe, the optian s c) beomes laTgeT