CIS 1166

Mathematical Concepts in Computing I

Fall 2017

The objective of this course is to provide students with a knowledge to perform mathematical reasoning to read, comprehend, and construct mathematical arguments; conduct combinatorial analysis to solve counting problems; understand discrete structures to represent discrete objects and relationships between these objects; and employ algorithmic thinking to understand, create, execute, and evaluate algorithms.

Prerequisite: MATH 1022, or MATH 1041 to 4999 with a grade of C or better.

 

Instructor: Amitangshu Pal
Office: SERC 371
Phone: 980-229-3383
E-mail: amitangshu.pal@temple.edu
List of topics:

  • The Foundations: Logic and Proof.

  • Basic Structures: Sets, Functions, Sequences, and Sums.

  • Number Theory.

  • Counting.

  • Discrete Probability.

  • Relations.

    • Graph Theory.

  • Trees.
Syllabus: Download
Textbook:

Discrete Mathematics and Its Applications by Kenneth H. Rosen, McGraw Hill, 7th Edition, ISBN 0-07-338309-0.
Grading:

Grading will be performed on the basis of the following components:

  • Homework assignments=25%

  • Mid-term exam=25%

  • Quiz=20%

  • Final examinations=30%

Late assignments will not be accepted for grading

 
Academic Integrity: Students have the responsibility to know and observe the requirements of the The Code of Student Academic Integrity . This code forbids cheating, fabrication or falsification of information, multiple submission of academic work, plagiarism, abuse of academic materials, and complicity in academic dishonesty.