Discussion-10-01-10

Discussion-10-01-10 - ICS 132 Discussion Oct. 01, 2010 So...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
S 132 Discussion ICS 132 Discussion Oct. 01, 2010
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
o far So far… inary review and modulo 2 calculation Binary review and modulo 2 calculation CRC ext Next… Shortest path algorithm
Background image of page 2
ecap (CRC) Recap (CRC) n n-1 + 2 a n x + a n-1 x + . .. + a 2 x + a 1 x + a 0 In CRC coefficients a n ,a n-1 …, a 0 are only eros and ones zeros and ones. For instance f(x) = x 2 + 1 is equal to 1x 2 + 0x + 1 which has coefficients 1, 0, 1 So f(x) = x 2 + 1 can be represent as 101.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Computing the Shortest Path uppose a graph consisting of nodes and Suppose a graph consisting of nodes and links with distance uestion Question What is the shortest path from A to H? Solution Dijskstra’s Shortest Path Algorithm B C 7 2 2 23 3 A G E F H D 4 6 12 2
Background image of page 4
Computing the Shortest Path ijkstra’s Shortest Path Algorithm: Dijkstra s Shortest Path Algorithm: Step 1: Initially all nodes are “non-permanent” (not painted black) tep 2: Set the source node as the current node Step 2: Set the source node as the current node
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/24/2011 for the course CS 132 taught by Professor Suda,t during the Fall '08 term at UC Irvine.

Page1 / 28

Discussion-10-01-10 - ICS 132 Discussion Oct. 01, 2010 So...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online