Math 2346 — Mathematics for Electrical and Computer Engineering — Virgil U. Pierce

Supplementary Textbook

The textbook: \underline{Advanced Engineering Mathematics} by Kreyszig (9th ed. or 10th ed.) is recommended as a reference for the course.


A calculator is not required, and will not be allowed on tests. Students are required to have access to Matlab or Octave (a free open sourced program, details available on the wiki or in class), and a programming language compiler (C++ or Java). It may also be helpful to have access to Mathematica, Maple, or SAGE. Matlab, Mathematica, and Maple are all available in the computer labs on campus.

You will need in class a wifi capable device: smart phone, laptop (suggested), or tablet.

Course Pre-requisites

CSCI 1380 or CMPE 1370 or CSCI 1370 with a grade of C or better, and MATH 1460 with a grade of C or better.

Course Description

Topics include: Gauss-Jordan elimination, matrix algebra, determinants, eigenvalues, graphs, trees, root finding algorithms, numerical differentiation, numerical integration, numerical matrix methods, propositional and predicate logic, and formal logic proofs. In Kreyszig we will cover Chapters: 7, 8, 15, 19, 20, and 23, and additonal handouts).

Student Learning Outcomes

After completing this course students will (unless otherwise noted students will be able to do the activity either by hand or with Matlab):

  • Perform the basic operations of matrix algebra.
  • Solve a system of linear equations using Guass-Jordan elimination, including augmented matrices and elementary row operations.
  • Compute matrix inverses when they exist and solve linear systems using matrix inverses where applicable.
  • Compute determinants of square matrices using the defintion, elementary row operations, and cofactor expansion, know the basic properties of determinants, and solve linear systems using Cramer's rule where applicable.
  • Compute eigenvalues and eigenvectors of a square matrix and apply them to problems in engineering, mathematics, and science.
  • Know graph terminology, graph connectivity, Euler and Hamiltonian paths, planar graphs, and some of the major problems of graph theory, such as shortest path problems (solved by Dijkstra's algorithm) and coloring problems.
  • Understand trees, traversals of trees, sorting, and minimal spanning trees (Prim's and Kruskal's algorithms).
  • Find roots of functions using the bisection, fixed-point, secant, and Newton's methods.
  • Approximate derivatives of functions using finite differences.
  • Approximate integrals using midpoint, trapezoid, and Simpson's rulse; Gaussian quadrature; adaptive; and random methods.
  • Approximate the basic functions such as $\sin(x)$ $\cos(x)$ and $e^x$ using Taylor's series.
  • Apply formal methods of symbolic propositional and predicate logic.
  • Know how to use formal logic proofs and logical reasoning to solve problems.
  • Understand various proof techniques and determine which type of proof is best for a given problem.


Students are expected to attend each class. Attendance and participation will count towards your final grade through in-class-assignments; in addition more than 5 absences, regardless of excuse, may be grounds for an instructor initiated drop. Arriving late to class will count as an absence. Participation includes presenting solutions to the homework exercises to the class when asked.

Class Participation:

  • There will be in-class activities which you must participate in.
  • We will be maintaining a set of wiki pages for the course accessed at [http://wikivirgil/]. The pages will include notes for the course, and sets of problems and solutions; ** written by you **.
  • Class participation will be composed of four parts: your attendence in class, your participation in class activities, correct answwers to quizzes, and your contributions to the class wiki pages.

Practic and Webwork Homework:

I cannot emphasize this enough: HOMEWORK IS KEY TO MASTERING THE MATERIAL COVERED IN THIS CLASS. Trying to do this course without doing all of the homework is analogous to learning how to swim without ever getting in the water. Trying to do this course without doing MORE than the assigned homework is analogous to learning how to swim by walking in water. You may think I am joking. I AM NOT.

Homework will be delivered through webwork. Furthermore homework will form the basis for class discussions where you will be expected to show (partial) solutions to problems to the rest of us — or to at least intelligently articulate where you are stuck.

Written Homework Assignments:

Additional assignments during the semester will be written and handed in. Your work on these is expected to be of high caliber, work that shows a lack of respect for yourself and the subject will be rejected outright. Your written work should be neat and clearly organized; it is highly recommended that you type written assignments and use a computer to produce the graphics.

There will be a number of programming assignments given out during the semester. Taken together these assignments will have the equivalent value to one test. You may write your program in either Matlab/Octave or C++; other languages may be acceptable with prior arrangement with me.

Problem Session:

On Tuesday evening each week we will have an {\bf optional} problem session to work on problems and exercises. This will be student led, I will be there to provide guidance. Tentative schedule is to meet at 7:10p — 8p, though we will discuss the schedule in the first day of class.


The tests will be given at the following times:

Test 1 February 22 in class
Test 2 March 28 in class
Test III April 30 in class
Final Exam to be announced


Your grade has 7 basic components: webwork homework, class participation (including — quizzes, presentation of homework problems, and contributions to the wiki), written homework assignments, 3 in class tests, the take home test, and the final exam. The first 4 components are of equal weight with each other, while the final exam is worth two of the others.


  • University Drop Deadline is {\bf April 2 }.
  • Makeup Exams will only be given for documented illnesses and emergencies. It is imperative that you contact me by email, except in rare cases, before the exam begins.
  • Be aware: The state of Texas imposes penalties to students who drop to many classes (loss of financial aid, and a limit of 6 drops in Texas higher education). Please keep these in mind, and apply yourself to the course accordingly; if you are in a position to consider dropping the class check with your advisor and the University about the consequences first.
  • Be aware: The federal government imposes penalties on those receiving financial aid who stop attending classes. The last quiz you take will be used to compute your last day of attendance. You have been warned.
  • It is assumed that you have read the Student Handbook, in particular the section on plagiarism and cheating. You are permitted to work together to solve the homework problems but all work handed in {\bf must} be written by you. No cooperation of any sort is permitted on exams.
  • Students with disabilities are encouraged to contact the Disability Services office for a confidential discussion of their individual needs for academic accommodation. It is the policy of the University of Texas-Pan American to provide flexible and individualized accommodation to students with documented disabilities that may affect their ability to fully participate in course activities or to meet course requirements. To receive accommodation services, students must be registered with the Disability Services office (DS), University Center #322, 665-7005, ude.aptu|secivresytilibasid#ude.aptu|secivresytilibasid. The Director of Disabilities is: Christine Stuart-Carruthers, DS-Director, Ph: 665-5375, ude.aptu|srehturrac#ude.aptu|srehturrac.
  • Contact policy: You are required to use UTPA email as your primary contact with me. You should send any email to {\tt ude.aptu|uvecreip#ude.aptu|uvecreip}. I apologize for any inconvenience, but this is school policy and is out of my control.
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License