1.

e t (2u(t) + 4t + 6t 2 )
F(s) = L [2u (t) + 4t + 6t 2]; s = s+1

F(s) =

F(s) =

s +1

2
4
3
+
+
s+1 (s+1)2

2 4 3
+ +
s s2 s3

; s = s+1

(t) + 3et/2[cos ((3/2) t) + (3/2) sin ((3/2) t)]

F(s) = 1 + L [3 (cos ((3/2) t) + (3/2) sin ((3/2) t))]; s = s -

F(s) = 1 +

F(s) = 1 +

( 12 ) + 3 3( 23 )
( 2 ) s 1 + 3
1
3
s
+
( 2) ( 2 ) ( 2) ( 2 )

3
(
2 )
3s
3
+( )
2
3
3
s +( )
s +( )
2
2
3

; s=s

3 s

2.
3.

y + 2y + 10y = 0
x1(t) + x2(t) + x3(t) = 0
x1(t) = y
x2(t) = 2y
x3(t) = 10y

y (0) = 2, y (0) = 3

x1(t) + x2(t) + x3(t)

L

X1(s) + X2(s) + X3(s)

s2 Y(s) s y (0) - y (0)

2y

2 (s Y(s) y (0))

10 y

x1(t)

x2(t)

x3(t)

10 Y(s)

s2 Y(s) - 2s - 3

2s Y(s) - 4

10 Y(s)

x1(t) + x2(t) + x3(t)

s2 Y(s) - 2s 3 + 2s Y(s) 4 + 10 Y(s)

0 = s2 Y(s) + 2s Y(s) + 10 Y(s) - 2s -7

Y ( s )=

2 s+ 7
s + 2 s+10
2

Falta!!!

y + 5y + 3y = 0

y (0) = 1, y (0) = 0

x1(t) + x2(t) + x3(t) = 0

x1(t) = y
x2(t) = 5y
x3(t) = 3y
x1(t) + x2(t) + x3(t)
L

5y

X1(s) + X2(s) + X3(s)

s2 Y(s) s y (0) - y (0)

5 (s Y(s) y (0))

3y

x1(t)

3 Y(s)

x2(t)

x3(t)

s2 Y(s) - s
5s Y(s) - 5
3 Y(s)
L

x1(t) + x2(t) + x3(t)

s2 Y(s) - s + 5s Y(s) 5 + 3 Y(s)

0 = s2 Y(s) + 5s Y(s) + 3 Y(s) - 5 - s

Y ( s )=

s+5
s +5 s+3
2

Falta!!!
4.
5.
I.

y[x(t)] = x(t) / 1+(1)x(t)

y[x(t)] = y[x(t0)]+ y[x(t0)] (x(t)- x(t0))

[ 1+ ( 1 ) x ( t0 ) ] [ ( 1 ) x ( t0 ) ]
2
[ 1+( 1 ) x ( t 0 ) ]

y[x(t)] = y[x(t0)] +

y[x(t)] = y[x(t0)] +

[ 1+ ( 1 ) x ( t0 ) ]

(x(t)- x(t0))

(x(t)- x(t0))

y[x(t)] - y[x(t0)] =

[ 1+ ( 1 ) x ( t0 ) ]

Y[x(t)] =

[ 1+ ( 1 ) x ( t0 ) ]

X (t)

(x(t)- x(t0))

y[T(t)] = e

[ T ( t ) +C ]

y[T(t)] = y[T(t0)]+ y[T(t0)] (T(t) - T(t0))

B

y[T(t)] = y[T(t0)] +

([ ( ) ] )
T t 0 +C

[T (t 0)+C ]

(T(t)-T(t0))

y[T(t)] - y[T(t0)] =

([ ( ) ] )
T t 0 +C

y[T(t0)] (T(t)-T(t0))

Si X (t) = (T(t)-T(t0))
By [T (t 0 )]

Y[T(t)] =

II.
6. .
7.

([

T ( t 0 ) +C ]

X(t)

falta!!!!

En la figura se observa:
R(s) como la poblacin deseada de estudiantes,
G1(s) como el bloque de la administracin de la universidad,
G2(s) como el bloque de la oficina de admisiones de la universidad y
C(s) como la cantidad neta de estudiantes.

Adems se observan las siguientes seales:

Del primer nodo a G1(s), es la poblacin actual + la poblacin deseada,
De G1(s) a G2(s), es el nmero de admisiones posibles,

De G2(s) al segundo nodo, es el nmero de estudiantes admitidos,

De G1(s) al segundo nodo, es el nmero de estudiantes expulsados y
abandonos,
De C(s) al primer nodo, poblacin actual de estudiantes.
8. .
9. .

P1=1*1*G1*G2*G3*G4*1*G5
P1= G1G2G3G4G5
P2=1*1*G1*G2*H2*G5
P2=G1G2G2H2
P3=1*1*G6*G7*G8
P3=G6G7G8
L1= - G1G2G3G4G5H4
L2= - G2G3G4H5
L3= - G2H1
L4= - G4H3
L5= - G6G7G8H4
L6= - G1G2H2G5H4
L7= - G7H6
1= 1 L7
2= 1 + L4L7 L4 L7
3= 1 + L3L4 L2 L3 L4
=1 (L1+L2+L3+L4+L5+L6+L7) + L4L7 + L3L4 L3L4L7

Ley De Mason:

P k k
k=1

C ( s ) ( G1 G2 G3 G4 G 5 )( 1 L7 )+ ( G1 G2 G 2 H 2 ) (1+ L 4 L7 L 4 L 7 ) + ( G 6G 7 G 8 ) (1+ L 3 L 4 L 2 L3 L 4
=
R ( s)
1 ( L1+ L 2+ L3+ L 4+ L 5+ L6+ L7 )+ L 4 L7+ L 3 L 4 L 3 L 4 L 7