To operate the Blended Learning Center(BLC) at optimal level, maintenance will be performed every day at 8:30 AM and at 5:00 PM regularly which can take up to 30 minutes. Please consider scheduling your activity in the BLC platform accordingly.
Topic outline
- General
General
Course Rationale
This
course emphasizes mathematical definitions and proofs and applicable methods to
solve and analyse problems that arise in computer science. It trains students
in developing the ability to think quantitatively and analyze problems critically.
Course objective:
Mathematical Reasoning: To construct mathematical arguments and formulae from mathematical reasoning and logic
Combinatorial Analysis: To Develop problem-solving skills using the ability to count or enumerate objects
Algorithmic Thinking: To use mathematical methods for developing algorithms
Applications and Modeling: To apply mathematical models to applications in Computer Science.
Course Outcome:
CO1 | Able to solve computational problem using mathematical models |
CO2 | Able to implement basic mathematical reasoning techniques and logical operations for engineering problems |
CO3 | Able to apply graph theory and other mathematical methods to both data structures and analysis of algorithms, and some other analytical problems in computer science |
Grading Scheme:
Attendance: 7%
Class Tests/Quizes: 15%Assignment: 5%Presentation (using video/ppt): 8%Midterm Exam: 25%Final Exam: 40% WELCOME LETTER
Dear Students
Welcome to the Math for Computer Science (CSE 236) course, I, Md Ibrahim Khan will be your co-pilot in this journey of learning.
I care about your success in these courses. I'm glad you are here.
Md. Ibrahim Khan
Lecturer, Department of Computer Science and Engineering
Daffodil International University
Course Instructor
|
|
Name |
| Md Ibrahim Khan |
Designation |
| |
Office Address |
| Room 738, AB04, Level 6, DSC. |
Email |
| ibrahim.cse0366@diu.edu.bd |
Contact No |
| +880-1303082758 |
Outcome based Teaching and Learning Action Plan
- Week 1
Week 1
Course
introduction, Objective and outcome of course, Assessment policies, Application etc.
Concept
of Logic and logical sense, the foundations of math with logic
- Week 2
Week 2
Introduction
to mathematical proofs using axioms and propositions, Propositional logic,
propositional equivalence, Logic Puzzle, Laws of Logic
Predicates,
Quantifiers I, Quantifiers II
Predicates,
Quantifiers I, Quantifiers II
- Week 3
Week 3
Sets:
Concept, type, Finite and Infinite
sets, Power set etc.
Set
Operations: Union, Intersection etc. and rules of set operations
- Week 4
Week 4
Functions I:
Function – “Machines” Definition, Representation of function, Function Vs. non
Function, Properties of functions
Functions
II: Composition of Functions, An Application of Functions: The Pigeonhole
Principle
- Week 5
Week 5
Basic counting techniques
Permutations and Combinations
Induction:
An introduction to proof techniques, covering proof by contradiction and
induction
- Week 6
Week 6
Rules
of Inference (What, Why, How)
- Week 7
- Week 8
Week 8
Introduction
to graphs, graph terminologies and application, Representing graphs
Connectivity,
Directed and Undirected graphs
- Week 9
Week 9
Euler
paths: Concept and application
Hamilton paths
Concept and application
- Week 10
Week 10
Shortest
path problem and application
- Week 11
Week 11
Tree traversal,
Minimum Spanning Trees
- Week 12
Week 12
Relations
and their properties,
Representation
of relations, Partial Order
- Week 13
- Week 14