Lecture 1

Khairun Nahar
Assistant Professor
Dept of CSE, Comilla University.
Introduction

Course Code : EMCS 511

Course Title : Mathematics for Computer
Science
Credit Hour : 2

Tentative Date for Final Exam : 1st week/ 1st December

Maximum Class : 8 + 2 =10

Date for (1st + 2nd) Midterm : 13/10/23

[Topics: Based Lecture 1-6]
Reference Book

Discrete Mathematics
&
Its Applications

Writer
Kenneth H Rosen
Marks Distribution For Before Final and Final Exam

Before Final (20) Final (30)

Mid Term (10) Answer any 4 questions
Mid Term 1 05 out of 6.
Mid Term 2 05
Midterm 10
Attendance 5
Assignment 5
Total 20
Syllabus
 What is Discrete Mathematics

Discrete Mathematics is a branch of mathematics involving discrete

elements that uses algebra and arithmetic. It is increasingly being
applied in the practical fields of mathematics and computer science.

Why need Discrete Mathematics:

1. It is a very good tool for improving problem solving capacities.
2. Complexity of algorithms-Execution time: Best, worst, average
3. Probability.
4. Graph and tree: Map, Shortest path, Computer network.
5. Sorting Program: Ascending or Descending order.

Prepared by Khairun Nahar,Assistant Professor,

Department of CSE, Comilla University
Difference between Discrete and Continuous Mathematics

Ordinal Data/Number indicates the position or order of something in relation.

Prepared by Khairun Nahar,Assistant Professor,

Department of CSE, Comilla University
 The Foundations: Logic and Proofs

Logic: Logic is the basis of all mathematical reasoning, and

of all automated reasoning. The rules of logic specify the
meaning of mathematical statements.
Application:
⚫ Design of computing machines.
⚫ Artificial intelligence
⚫ Computer programming to programming languages and
⚫ Other areas of computer science, as well as to many other
fields of study.

Prepared by Khairun Nahar,Assistant Professor,

Department of CSE, Comilla University