Ignou Solved Assignments

1 (a) Calculate Cyclic Redundancy Check (CRC), where Message bits M=1010101110 and Generator bits G=10001. Ans (b) Write an algorithm to compute the shortest path using Dijkstra’s algorithm. Ans DIJKSTRA (G, w, s) 1. INITIALIZE SINGLE-SOURCE (G, s) 2. S ← { } // S will ultimately contains vertices of final shortestpath weights from s 3. Initialize...