Computation Lab I (TDEC 160)

  Announcements  Labs  Programs  Course Resources  Grading Policy
Course Description
Introduces computation and programming through the use of a symbolic mathematical computation system.  Programming techniques and and algorithmic problem solving are introduced in the context of the differential calculus.  Illustrates the power and limitations of the computer in solving mathematical problems.
Course Goals
To provide students with the skills to effectively use a symbolic mathematical system to solve mathematical problems and to introduce students to programming and algorithmic thinking.  To reinforce concepts from mathematics by presenting them in an algorithmic and computational manner and to learn concepts from Computer Science in the context of mathematical computation.
 
Course Objectives
Audience
This is a required freshman level course for all engineering and computer science students.
Corequisites
Should be taken concurrently with or following calculus I (TDEC 110 or MATH 121)
Instructor
Jeremy Johnson
Office: 100 University Crossings
phone: (215) 895-2669
e-mail: jjohnson@cs.drexel.edu
office hours:  TR 11-12:30.  Additional hours available upon request (via email).
TAs
Servesh Tiwari
Office: 147 Univ. Crossings (CS Student Resource Center)
e-mail: st86@drexel.edu
office hours: M 1-3.

Meeting Time
W 10-12 (Univ. Crossings 150), 12-2 (Univ. Crossings 149), 2-4 (Univ. Crossings 149)

Course Web Page and Mailing List

Textbook

All students should have a copy of Maple 10 (free with Calculus book).  Instead of a text book, this course will rely on Maple documentation and course notes/labs provided as Maple worksheets (see class web page)


Topics

  1. The use of maple (interface, symbolic computation, numeric computation, graphics, and an interactive programming environment). 
  2. Experimental mathematics (properties of sequences, equations, and functions)
  3. Algorithmic mathematics (differentiation and equation solving)
  4. Elementary programming constructs (variables, loops, conditionals,  functions)
  5. Elementary data structures (sequences, lists, sets, trees)

Grading

  1. Weekly labs (80%)
  2. Exam - (20%) - exams will be done in lab using Maple.



Resources

Reference Books
  1. Charles F. van Loan, Introduction to Scientific Computing, 2nd Ed., Prentice Hall, 2000.
Web Pages
  1. TBA


Look Here for Important Announcements

Announcements ( )


Labs

This list is subject to change.


Programs and Worksheets



Created: 7/20/05 (revised 10/25/05) by jjohnson@cs.drexel.edu