CS 300 Applied Symbolic Computation - Syllabus

Term and Credits

Winter 2015-2016
3 Credits

Room and Time

Tuesday, Thursday 2:00pm - 3:20pm
PSRC 217

Instructor

Mark Boady
Electronic Mail Address: mwb33@drexel.edu
Office: University Crossings 138
Extention: 215-895-2347
Office Hours: Tuesday 4-5pm, Thursday 11am-1pm, 4-5pm, Wed: By Appointment

Teaching Assistant(s)

None :-(

Course Description

This course covers the fundamentals of symbolic mathematical methods as embodied in symbolic mathematics software systems, including: fundamental techniques, simplification of expressions, solution of applications problems, intermediate expressions swell, basic economics of symbolic manipulation, efficient solution methods for large problems, hybrid symbolic/numeric techniques.

Course Objective and Goals

  1. Introduce Methods for Symbolic Computation.
  2. Study the fundamental algorithms for working with symbolic expressions.
  3. Examine the difference between symbolic and numerical techniques.
  4. Solve Problems from various fields using symbolic computation.

Audience and Purpose within Plan of Study

This is a computer science course for students who want a more indepth understanding of how computers can be used to handle exact and symbolic mathematics.

Prerequisites
CS 260 Minimum Grade: D and CS 270 Minimum Grade: D and MATH 200 Minimum Grade: D and MATH 201 Minimum Grade: D

What Students Should Know Prior to this Course

  1. Students should have some experience programming in mutliple languages
  2. Familiarity with basic data structures such as trees, arrays, and lists.
  3. Familarity with Descrete Mathematics and Calculus.

What Students will be able to do upon Successfully Completing this Course: Statement of Expected Learning

  1. Students will know how to use common symbolic computation software.
  2. Students will be able to determine when to apply symbolic or numerical methods.
  3. Students will be able to implement fundemental symbolic computation algorithms.

Textbook

None!

Final grades will be determined by your total points weighted according to this distribution. Grades may be curved but are generally computed via the formula below. It may be modified at the instructor's sole discretion, but letter grades will generally not be lower than those shown here.

Academic Honesty Policy

The CCI Academic Honesty policy is in effect for this course. Please see the policy at http://drexel.edu/cci/resources/current-students/undergraduate/policies/cs-academic-integrity/ .

Submitting Assignments

Assignments will be submitted to learning.drexel.edu by 11:59PM on the date they are due. Grades will be reported via learning.drexel.edu.

Labs, and assignments, and exams will be returned on a regular basis to provide feedback to students.

Late submissions will recieve a deduction of 15% per day after the due date. Exceptions may be given by the Professor for special cases.

Topics

  1. Maple
  2. Large Integer Arithmetic
  3. Cryptography
  4. Term Rewriting Systems
  5. Symbolic Simpliciation
  6. Exact solution to systems of linear equations.
  7. Exact solution to systems of polynomial systems

Computer/Software Help
iCommons: http://drexel.edu/cci/about/our-facilities/rush-building/iCommons/

University Policies
In addition to the course policies listed on this syllabus, course assignments or course website, the following University policies are in effect:

Tentative Course Schedule

Please see the appropriate assignment, lab, and/or project webpages for a tentative schedule of course deliverables.

Week Topic Reading Assignment
1 Introduction to Maple Chapter 1 of the Maple user manual http://www.maplesoft.com/documentation_center/ Download Maple from https://software.drexel.edu
2 Cryptography and CGD TBD HW1 Assigned
3 Fast Multiplication TBD HW1 Due Jan 24 11:59PM
HW2 Assigned
4 Term Rewriting Systems TBD  
5 Symbolic Derivatives TBD HW2 Due Feb 7 11:59PM
6 Midterm TBD HW3 Assigned
7 Symbolic vs Numerical TBD  
8 Fast Linear Algebra TBD HW3 Due Feb 21 11:59PM
HW4 Assigned
9 Polynomial Systems (Grobner Bases) TBD  
10 Symbolic Integration TBD HW4 Due Mar 13 11:59PM
11 Final