1 / 21

# Lecture Notes - PowerPoint PPT Presentation

1. 3. 2. 5. 1. 2. 1. x. 2. This was adjacency matrix after k=x and k=1 steps. Notice the shorter (green) path from x to 4. Now use k=3 and see how we pick it up. We do get to look at paths of length > 2!. 4. 4. 3. 3. X 1 2 3 4. X 1 2 3 4.

Related searches for Lecture Notes

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Lecture Notes' - Gabriel

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

3

2

5

1

2

1

x

2

This was adjacency matrix after k=x and k=1 steps. Notice the shorter (green) path from x to 4.

Now use k=3 and see how we pick it up. We do get to look at paths of length > 2!

4

4

3

3

X 1 2 3 4

X

1

2

3

4

A[i,3]+A[3,j] < A[i,j] ?

• Boolean Expressions

• Logic Networks

• Truth Functions

• Can every truth table be written as a Boolean expression? As a computer circuit?

Control

(off=false)

+

-

Control

(on=true)

+

-

A

+

-

B

A

B

+

-

A

-

+

And ( . )

Or ( + )

Not (‘)

• A Boolean Expression in n variables x1,x2, .. Xn, is any string of finite symbols formed by the following rules

• 1. x1,x2, .. Xn are Boolean expressions

• 2. If P and Q are Boolean Expressions, then so are (P+Q), PQ , and P’.

(x + y) x + y’(xy+z)

is a Boolean expression.

• A truth function is a truth table for Boolean expressions

X

Y

Z

Exercise: Find a network for (xy’+z)’

Truth function Boolean expression

Boolean expression logic network

Can we find a Boolean expression for any truth function? Yes!

• For the truth function shown, find a Boolean expression:

True for:

xyz’

xy’z

x’yz

x’yz’

x’y’z

xyz’+xy’z+x’yz+x’yz’+x’y’z

This is the Canonical form for the truth function (a standard form into which we can place any two Boolean expressions for comparison.)

xyz’+xy’z+x’yz+x’yz’+x’y’z

= xyz’+xy’z+x’yz+x’yz’+x’y’z+x’yz’

=y’z(x+x’)+x’y(z+z’)+yz’(x+x’)

=y’z+x’y+yz’

Notice the groupings of two the same/ one different.

• Design a circuit to add binary numbers

xy’+x’y=(x+y)(xy)’

xy

(x+y)(xy)’

x

sum

y

x

y

carry

xy

Cprevious

s

x

c

s

cnext

y

c

x

Digit 1

a

Digit 2

y

b

Digit 3

z

c

Digit 4