ES 210
Dynamics
Week 15
1 of 11
Reminder: The Final Exam is Wednesday, 9 May 2012, 13:00 15:00
o The Final is comprehensive and may include problems from the
entire course. However, the majority of the problems will be over
topics covered since Exam #2.
T
ES 210
Dynamics
Week 07
1 of 15
Last time we introduced the concepts of work and kinetic energy.
o Work is force acting through a distance. Mathematically:
2
U 12 = F dr
(1)
1
Since work is associated with a force, it is also dependent on
the particles ma
ES 210
Dynamics
Week 09
1 of 16
Today well return to our investigation of kinematics.
This time well
concentrate on the kinematics of rigid bodies.
o As was the case when we investigated the kinematics of particles,
our goal is to analyze motion.
Now, we
ES 210
Dynamics
Week 04
1 of 16
To this point, weve limited our investigation of Dynamics to a kinematics
or a geometric point of view. Today well expand our approach to take in
kinetics.
o Kinetics allows us to account for forces and energy of bodies
(pa
ES 210
Dynamics
Week 02
1 of 21
Lets begin our study of Dynamics by investigating the kinematic aspects
of linear motion.
o Kinematics deals with the geometric aspects of the motion.
o In
particular,
we
will
look
at
the
relationships
between
position/disp
ES 210
Dynamics
Week 08
1 of 20
Last time we introduced the principle of impulse and momentum.
t2
(mi vi )1 + Fi dt = (mi vi )2
(1)
t1
o The momentum of a particle is its mass x its velocity. So, for a
multi-particle system, the 1st and last terms in eqn
ES 210
Dynamics
Week 12
1 of 19
We ended last time with the general equations of motion for rigid bodies
from a kinetics point of view.
F = m(a )
F = m(a )
M = I
x
Gx
(1)
y
Gy
(2)
G
G
(3)
Lets now apply these general equations to the three types of mot
ES 210
Dynamics
Week 06
1 of 8
Class meeting 14 will be used to take the first Exam.
o Exam #1 will cover the material weve discussed to-date.
o This is the material on kinematics and kinetics for particle motion
from Chapters 12 & 13 of the text, the ass
ES 210
Dynamics
Week 13
1 of 18
Last time we looked at the principle of work and energy as it applies to
rigid bodies:
(ke)1 + U 12 = (ke)2
(1)
The work term in eqn (1) consists of forces acting through a
displacement.
o These forces may be classified as
ES 210
Dynamics
Week 14
1 of 7
Last time we investigated the momentum of a rigid body system. Now,
lets combine this knowledge with a look at forces acting on the body in
order to develop the Principle of Impulse & Momentum for rigid bodies.
o By combinin
ES 210
Dynamics
Week 03
1 of 16
Up to this point we have introduced the equations of motion and
mentioned that it is advantageous to analyze motion within the structure of
some sort of reference frame.
o The equations of motion relate the properties of lo
ES 201
Computer Techniques
Lecture 03
1 of 11
Last time we began our look at the C+ programming language. In lab
you wrote, compiled, linked, and ran the traditional 1st C+ program, Hello
World.
o C+ is a compiled high-level programming language.
o It is
ES 201
Computer Techniques
Lecture 23
1 of 8
Last time we introduced the if elseif else end construct as one of
Matlabs Selective Structures.
o Remember, a Selective Structure is used to tell the program to
branch based on the outcome of a conditional tes
ES 201
Computer Techniques
Lecture 15
1 of 9
Up to this point, the data weve entered into our programs was either hard
coded into the source file or was entered at the keyboard via user
interaction. The data output from our programs has been displayed to
ES 201
Computer Techniques
Lecture 04
1 of 10
Today well continue to expand our knowledge of the C+ language and
its syntax. Well take a closer look at:
o Statements & expressions.
o Operators.
o Truth.
In C+, a statement may control the flow of the progr
ES 201
Computer Techniques
Lecture 05
1 of 12
Weve noted that there are 3 structures in a structured programming
language.
o Sequential statements are executed in order (sequentially) from
the top to the bottom of the code.
o Selective also known as branc
ES 201
Computer Techniques
Lecture 06
1 of 12
So far weve looked at the constructs used by C+ to implement the
Sequential and Selective Structures. Today well look at the last main
construct, the Repetitive Structure.
o Another name for the Repetitive Str
ES 201
Computer Techniques
Lecture 09
1 of 11
Last class we introduced the concept of the function in the C+
programming language.
o C+ programs are made up of functions.
o main is a special C+ function. It is the function that executes first
when you run
ES 201
Computer Techniques
Lecture 17
1 of 10
Today well begin to learn how to use Matlab.
o Matlab is a computer program or more precisely an operating
environment.
o The version we use runs within the Windows O/S.
In addition to the basic Matlab package
ES 201
Computer Techniques
Lecture 24
1 of 8
Today well look at Matlabs Repetitive Structures or loops. Matlab offers
two choices of Repetitive Structures:
o The while loop.
o And the for loop.
o Both of these constructs are similar to their namesakes in
ES 201
Computer Techniques
Lecture 21
1 of 8
Last time we introduced some concepts of linear algebra and performing
mathematical operations with matrices and vectors. Lets look at some
examples of how we can use this to solve engineering problems.
o In ma
ES 201
Computer Techniques
Lecture 02
1 of 13
How do computers work with and store information?
o Computers deal with information in binary form.
That is, all
information, whether it is text, graphical, or numerical in nature, is
converted to a system of
ES 201
Computer Techniques
Lecture 14
1 of 9
Lets look at a gaming simulation example that uses many of the
techniques that weve learned about C+. Well also introduce a couple of
new features.
o This program simulates some aspects of the dice game craps.
ES 201
Computer Techniques
Lecture 08
1 of 14
Weve completed our investigation of the basic constructs used in C+ to
implement the Sequential, Selective, and Repetitive Structures for writing
our programs.
o We are now equipped to write perfectly function
ES 201
Computer Techniques
Lecture 10
1 of 13
Lets continue our investigation of functions.
o All C+ programs consist of functions.
o main is the function the runs when we invoke (run) the program. All
C+ programs include a main function.
o We generally w
ES 201
Computer Techniques
Lecture 07
1 of 11
Last time we introduced the Repetitive Structure or looping.
o A Repetitive Structure allows the program to execute a block of
code repeatedly.
o Each time the block is executed, a condition is checked to
dete
ES 201
Computer Techniques
Lecture 16
1 of 11
Last time we introduce file I/O.
o We can obtain information from a file and send output to a file just
as weve interacted previously with the systems standard input
(keyboard) and output (display) devices.
o
ES 201
Computer Techniques
Lecture 12
1 of 11
Today well begin to investigate how C+ deals with arrays.
o An array is an entity that can take on more than one value.
o For example, a string is an array of char values.
o In engineering, we often deal with
ES 201
Computer Techniques
Lecture 13
1 of 11
Today well continue our investigation of arrays in C+.
o Last time we learned that an array is a type of data structure.
o We declare an array in a manner similar to what we would use to
declare any other vari