Note: The matrix referred to in the question is: ![M = \left[\begin{array}{ccc}1/2&1/3&0\\1/2&1/3&0\\0&1/3&1\end{array}\right]](https://tex.z-dn.net/?f=M%20%3D%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D1%2F2%261%2F3%260%5C%5C1%2F2%261%2F3%260%5C%5C0%261%2F3%261%5Cend%7Barray%7D%5Cright%5D)
Answer:
a) [5/18, 5/18, 4/9]'
Explanation:
The adjacency matrix is
To start the power iteration, let us start with an initial non zero approximation,
![X_o = \left[\begin{array}{ccc}1\\1\\1\end{array}\right]](https://tex.z-dn.net/?f=X_o%20%3D%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D1%5C%5C1%5C%5C1%5Cend%7Barray%7D%5Cright%5D)
To get the rank vector for the first Iteration:
![X_1 = \left[\begin{array}{ccc}1/2&1/3&0\\1/2&1/3&0\\0&1/3&1\end{array}\right]\left[\begin{array}{ccc}1\\1\\1\end{array}\right] \\\\X_1 = \left[\begin{array}{ccc}5/6\\5/6\\4/3\end{array}\right]\\](https://tex.z-dn.net/?f=X_1%20%3D%20%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D1%2F2%261%2F3%260%5C%5C1%2F2%261%2F3%260%5C%5C0%261%2F3%261%5Cend%7Barray%7D%5Cright%5D%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D1%5C%5C1%5C%5C1%5Cend%7Barray%7D%5Cright%5D%20%5C%5C%5C%5CX_1%20%3D%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D5%2F6%5C%5C5%2F6%5C%5C4%2F3%5Cend%7Barray%7D%5Cright%5D%5C%5C)
Multiplying the above matrix by 1/3
![X_1 = \left[\begin{array}{ccc}5/18\\5/18\\4/9\end{array}\right]](https://tex.z-dn.net/?f=X_1%20%3D%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D5%2F18%5C%5C5%2F18%5C%5C4%2F9%5Cend%7Barray%7D%5Cright%5D)
Explanation:
The second for loop does 1 of 4 iterations for every 1 of 5 iterations of the parent loop. meaning it is 4 x 5 which is 20.
Answer:
Semaphores carries the signal between the task and interrupts that does not carry any type of additional data in the embedded system. A semaphore is used as synchronization object and helps in maintain the value between zero and the specific higher value.
It basically reduced the value each time and complete the semaphore object in the embedded system. Binary semaphores is the main type of semaphore that invoke activation of the task.
