The following simple undirected graph is referred to as the Peterson graph.
Which of the following statements is/are TRUE?
The following graph is isomorphic to the Peterson graph.
Which of the properties hold for the adjacency matrix A of a simple undirected unweighted graph having n vertices?
Which of the following is/are the eigenvector(s) for the matrix given below?
$$\left( {\matrix{ { - 9} & { - 6} & { - 2} & { - 4} \cr { - 8} & { - 6} & { - 3} & { - 1} \cr {20} & {15} & 8 & 5 \cr {32} & {21} & 7 & {12} \cr } } \right)$$
Consider the following threads, T1, T2 and T3 executing on a single processor, synchronized using three binary semaphore variables, S1, S2 and S3, operated upon using standard wait( ) and signal( ). The threads can be context switched in any order and at any time.
| $${T_1}$$ | $${T_2}$$ | $${T_3}$$ |
|---|---|---|
| while (true) { wait ($${S_3}$$); print ("C"); signal ($${S_2}$$); } |
while (true) { wait ($${S_1}$$); print ("B"); signal ($${S_3}$$); } |
while (true) { wait ($${S_2}$$); print ("A") signal ($${S_1}$$); } |
Which initialization of the semaphores would print the sequence BCABCABCA....... ?