M152 Mathematical Algorithms with
Maple
Spring 2005, course homepage
When and where:
2/22-3/31 T R 4:10 - 7:00
room: T: Weber 205, R: Weber 206 from 4:10-5:00 and then Weber 205 from 5:00-7:00
Registration is open until 2/24
Texts:
none required.
Objectives:
This course is an introduction to Mathematical Algorithms using the Computer Algebra system Maple. The topics are chosen mainly from the broad area of Discrete Mathematics, which involves for example Graph Theory, Linear Algebra, Algebra and Combinatorics. However, we will have no requirements and everything will be self-contained.
This course is a programming course. We will learn how to write simple programs in the Maple language, including the question of choosing the right data types for storage of data. The goal is to learn basic algorithmic principles and data types. We need to understand how computers handle numbers internally, and what the difference is between exact and numerical arithmetic. We will discuss numbers, i.e. what different kinds of numbers exist in Mathematics and how Maple handles them. Our particular focus is on Symbolic Computation, which involves algebraic manipulations of terms and solving equations. Symbolic computing differs from numerical computing in that the answers are always exact, even though sometimes lengthy.
Prerequisites:
There are no formal requirements. Everyone who knows the definition of a one-to-one and onto function is ready to attend.
Grading Rules:
There will be homework assignments. The final grade is determined by your performance on these homework problems. There will be no final exam (remember this is a one credit mini-course).
Worksheets:
Homework:
none yet
For further information:
Please contact A. Betten: betten at math dot colostate dot edu