Scribd
Upload
6 views

Lecture - 01 - Introduction

This document outlines the details of a Discrete Mathematics course, including the instructor, class times, target students, resources, teaching approach, grading policy, topics to be covered, and tentative schedule. The instructor is Abdurrahman Yusuf Haydar and the class will meet on Saturdays and Sundays. The target students are computer science freshmen familiar with basic algebra. Topics will include logic, sets, counting, probability, graphs, and more. Assessment includes homework, quizzes, a midterm, and final exam.

Uploaded by

Mowliid Ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
6 views

Lecture - 01 - Introduction

This document outlines the details of a Discrete Mathematics course, including the instructor, class times, target students, resources, teaching approach, grading policy, topics to be covered, and tentative schedule. The instructor is Abdurrahman Yusuf Haydar and the class will meet on Saturdays and Sundays. The target students are computer science freshmen familiar with basic algebra. Topics will include logic, sets, counting, probability, graphs, and more. Assessment includes homework, quizzes, a midterm, and final exam.

Uploaded by

Mowliid Ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 12

Discrete Mathematics

Abdurrahman Yusuf Haydar


12 Sept. , 2020
Instructor and Class Time
• Instructor
– Abdurrahman Yusuf Haydar
– B.Sc. In CSE (IUT), M.Sc. T.E (CSE) also IUT, Dhaka
– E-mail: [email protected]
– Class Hours: Saturday 8:40 AM -10:20 AM
– Sunday 10:40 AM – 12:20 PM
Course Overview
• Course: Discrete Mathematics
• Classroom: right here
• Prerequisite: Secondary School algebra
Target Students
• For those who
– Are Computer Science freshmen
– Familiar with basic college algebra,
– Preparing to learn more details in
mathematical facts, and
– Want to learn how to think logically and
mathematically
Resources
• Textbook: Discrete Mathematics and its
Applications, 7th ed., by Kenneth H. Rosen,
McGraw-Hill. (International Edition)
– http://www.mhhe.com/math/advmath/rosenindex.
mhtml

• References:
– Discrete and combinatorial mathematics : an applied
introduction, 5th ed., by Ralph P. Grimaldi, Addison-
Wesley, 2004.
– Discrete mathematics, 7th ed., by Richard
Johnsonbaugh, Pearson, 2009.
Teaching
• Lectures
• 4-5 homework assignments
– Homeworks should be turned in within two
weeks
• Mid-term and final exams
Grading Policy
• (Tentative) grading policy
– Homework assignments: 20 Marks
– -Quizzes (3 out of 4): 20 Marks
– Midterm exam: 30 Marks
– Final exam: 30 Marks
– Total: 100 Marks
What Will You Learn
• Introduction to mathematical facts
– Logic, set theory, number theory, linear
algebra, combinatorics, graph theory,
(discrete) probability theory
• Mathematical reasoning and problem
solving
• Gateway to more advanced courses
– Data structures, algorithms, database,
automata, formal languages, compiler,
computer security, operating systems
Outline & Schedule
• Outline
– Fundamentals (Ch. 1-4)
• Logic and Proofs
• Sets, Functions, Sequences, and Sums
• Algorithms, Integers, and Matrices
• Induction and Recursion
– Enumeration (Ch. 5,6)
• Counting
• Discrete Probability
• Advanced Counting
• Relations
Outline & Schedule (Cont’)
• Outline (cont’d)
– Graph Theory (Ch. 9-10)
• Graphs (to be covered in “Data Structures” and
“Algorithms”)
• Trees (to be covered in “Data Structures” and
“Algorithms”)
– Advanced Topics (Ch. 11,13)
• Boolean Algebra (to be covered in “Digital Logic
Design”)
• Modeling Computation (to be covered in
“Automata Theory”)
Outline & Schedule (Cont’)
• (Tentative) Schedule
– Fundamentals: 4-5 wks
– Enumeration: 2-3 wks
– Graph Theory: 4-5 wks
– Advance topics: 2-3 wks (if time permits)
Thanks for Your Attention!

Hope We will enjoy this journey

You might also like