Assignment $3-$ Chapters $4\backslash$&$5(5$ Marks$)$

$1.$ Consider the $6-$node network shown below, with the given link costs. Using Dijkstra's algorithm, find the least cost path from source node $($u$)$ to all other destinations. $[2\mathrm{.}5$ Marks$]$

$*******************************************************************$

$2.$ The following figure shows a two$-$dimensional generalization of the single$-$bit parity scheme. Correct the bit$-$error$/$errors for this scheme. $($Note: show the two solutions$)[1$ mark$]$

Column Parities

$*******************************************************************$

$3.$ Consider the following LAN and that the switch has the following table at this point. $[1\mathrm{.}5$ Marks$]$

switch with six interfaces $(\backslash (1,2,3,4,5,6)\backslash )$

How will the switch process the following frames?

a$)\backslash ($ A $\backslash )$ frame received from $\backslash ($ B $\backslash )$ and sent to $\backslash ($ D $\backslash )$ :

b$)\backslash ($ A $\backslash )$ frame received from $\backslash ($ F $\backslash )$ and sent to $\backslash ($ E $\backslash )$ :

c$)$ A frame received from $\backslash ($ C $\backslash )$ and sent to $\backslash ($ F $\backslash )$ :

solve these questions using the tables in the picture if the question have one.