# Fall 2016

## TA

• REN-HAU HOWARD LIU, email: liurhh@temple.edu
• Office: SERC 339
• Office Hours: Thursday 15:00 - 17:00

## Class

• Meets: Tuesday and Thursday 11:00-12:20  TL 401B

## Recitation

• Meets: Friday 13:00-14:50  TL 402
• Recitations are lead by the Teaching Assistant. Attendance for the full period of each recitation is MANDATORY.

## Text

• Required:
Kenneth Rosen, Discrete Mathematics and its Applications, 7th edition, McGraw Hill Inc.

• Gilbert Strang, Introduction to Linear Algebra, 4th Edition, 2009
http://web.mit.edu/18.06/www/videos.shtml

## Topics

• Algorithms (Ch. 3)
• Graphs (Ch. 10)
• Matrix Algebra
• Unconstrained Optimization
• Modeling Computation (Ch. 13)

## Course Goals and Learning Objectives

• A continuation of CIS 1166. Concepts include fundamental mathematical concepts of computing: complexity of algorithms, graphs, matrix algebra, finite automata. Applications to computer science are illustrated.
• The learning objectives of this course include understanding of mathematical foundations of the following basic concepts: growth of functions, complexity of algorithms, mathematical induction and recursive definitions, graph representation, properties of graphs, algorithms on graphs, matrix algebra, systems of linear equations, eigenvalues and eigenvectors, language recognition, finite state machines, Turing machines.

• At the end of this course, students will be able to:
1. Estimate the growth of function and classify algorithms according to complexity.
2. Use mathematical induction and recursive definitions
3. Understand properties of graphs and algorithms on graphs
4. Perform basic operations on matrices, including computing eigenvalues and eigenvectors
5. Solve systems of linear equations
6. Familiar with Google PageRank algorithm
7. Classify formal languages and develop finite state machines
8. Understand Turing machines

• Homework: 10%
• Quizzes: 30%
• Midterm: 25%
• Final: 35%

Homework: Homework due dates are on Friday. Late homework will receive no credit. You will be allowed to drop your lowest three homework grades.

Class attendance: Class attendance is expected, and may be recorded from time to time. Absences for legitimate professional activities and illnesses are acceptable only if prior notice is given to the instructor by e-mail or phone. Scheduling conflicts with your work, extra-curricular activities, or any other such activities is not a valid excuse. Although attendance is not a specific part of the course evaluation it has a direct effect on class participation. If you are not in class you cannot participate. Class participation means that you attend class regularly and have completed your assigned readings. It means that you ask relevant questions and make informed comments in class. Class participation will contribute to the final grade.

Quizzes: Each week there will be one 20 - 25 minute quiz based on the homework assignment for the previous week. There will be no make up quizzes; however, you will be allowed to drop your lowest three quiz grades. Each quiz will be worth 20pts. You may bring one letter size page filled with your own notes to each quiz.

Exams: If you miss a midterm for an emergency [as agreed ahead of time with the instructor], there will be no makeup exam: the other exams will become proportionally more important. If you miss any exam without prior agreement, and without definitive proof as to the reasons, you will get a zero. If you miss the final and do not make alternative arrangements before grades are turned in you will be graded F.

Homework and Quiz Schedule: Homework that is due on Friday (beginning of the recitation).
Graded homework will be returned and discussed a week later during the recitation.
The quiz on Friday is testing the material covered during the previous week.
Thus, it coincides in the scope with the homework that was due on the previous Friday.

## Honor Code

• All work submitted for credit must be your own.
• You may discuss the homework problems with your classmates, the teaching assistant, and the instructor. You must acknowledge the people with whom you discussed your work, and you must write up your own solutions and code. Any written sources (apart from the text) used must also be acknowledged; however, you may not consult any solutions from previous years' assignments whether they are student or faculty generated.
• Plagiarism will be handled with severe measures.
• Please ask if you have any questions about the Honor Code. Violations of the honor code will be treated seriously. Please check the Temple University policy on Academic Honesty.

## Disabilities

I encourage students with disabilities, including "invisible" disabilities such as chronic diseases and learning disabilities, to discuss with us any appropriate accommodations that we might make on their behalf. Student must provide me with a note from the office of Disability Resources and Services at in 100 Ritter Annex, 215-204-1280, regarding their disability.

latecki@temple.edu