Department of Computer Science and Engineering, BUET

Description of Course CSE 103

PART A: General Information

1 Course Title : DISCRETE MATHEMATICS
2 Type of Course : THEORY
3 Offered to : DEPARTMENT OF CSE
4 Pre-requisite Course(s) : NONE

PART B: Course Details

1. Course Content (As approved by the Academic Council)
Sets, functions, sequences, sums; Relations and partial ordered sets; Mathematical logic: propositional calculus and predicate calculus;
Mathematical reasoning and proof techniques: induction; Counting: permutations, combinations, principles of inclusion and exclusion,
generating functions; Discrete probability; Recurrence relations and recursive algorithms; Graph theory: graphs, paths, and trees;
Introduction to number theory and algebraic structures.
2. Course Objectives
The students are expected to:

i. study the concept and relevant tools of mathematical logic and reasoning
ii. learn how to apply different proof techniques to prove propositions
iii. learn how to do counting and enumeration through combinatorial analysis
iv. develop problem solving and modeling skills using discrete structures (e.g., graphs)

3. Knowledge required
Technical

COURSE OUTLINE Page 1 of 6

Course No: CSE 103, Level 1/ Term 1, Credit (Contact) Hours: 3 Credits (3hrs/wk)
 Department of Computer Science and Engineering, BUET

• None
Analytical
• Basic Mathematics (HSC Level)
4. Course Outcomes (COs)
CO Statement Domains and
CO Corresponding Delivery Method(s)
Taxonomy Assessment Tool(s)
No. After undergoing this course, students should PO(s)* and Activity(-ies)
be able to: level(s)**

understand and apply the theory, constructs Class Tests or

CO
and concepts of mathematical logic and - C3 Lecture, exercise Assignments and Final
1
reasoning and derive proof using those Exam

Class Tests or
CO Combinatorically analyze various counting
- C5 Lecture, exercise Assignments and Final
2 problems
Exam

Class Tests or
CO Analyze problems and develop models
- C5 Lecture, exercise Assignments and Final
3 thereof using discrete structures
Exam

*Program Outcomes (POs)

PO1: Engineering knowledge; PO2: Problem analysis; PO3: Design/development of solutions; PO4: Investigation; PO5: Modern tool usage; PO6: The engineer and
society; PO7: Environment and sustainability; PO8: Ethics; PO9: Individual work and teamwork; PO10: Communication; PO11: Project management and finance;
PO12: Life-long learning.

**Domains

C-Cognitive: C1: Knowledge; C2: Comprehension; C3: Application; C4: Analysis; C5: Synthesis; C6: Evaluation

COURSE OUTLINE Page 2 of 6

Course No: CSE 103, Level 1/ Term 1, Credit (Contact) Hours: 3 Credits (3hrs/wk)
 Department of Computer Science and Engineering, BUET

A-Affective: A1: Receiving; A2: Responding; A3: Valuing; A4: Organizing; A5: Characterizing
P-Psychomotor: P1: Perception; P2: Set; P3: Guided Response; P4: Mechanism; P5: Complex Overt Response; P6: Adaptation; P7: Organization

5. Mapping of Knowledge Profile, Complex Engineering Problem Solving and Complex Engineering Activities
COs K1 K2 K3 K4 K5 K6 K7 K8 P1 P2 P3 P4 P5 P6 P7 A1 A2 A3 A4 A5

CO1

CO2

CO3

K-Knowledge Profile:
K1: A systematic, theory-based understanding of the natural sciences applicable to the discipline; K2: Conceptually based mathematics, numerical analysis,
statistics and the formal aspects of computer and information science to support analysis and modeling applicable to the discipline; K3: A systematic, theory-
based formulation of engineering fundamentals required in the engineering discipline; K4: Engineering specialist knowledge that provides theoretical
frameworks and bodies of knowledge for the accepted practice areas in the engineering discipline; much is at the forefront of the discipline; K5: Knowledge that
supports engineering design in a practice area; K6: Knowledge of engineering practice (technology) in the practice areas in the engineering discipline;
K7:Comprehension of the role of engineering in society and identified issues in engineering practice in the discipline: ethics and the engineer’s professional
responsibility to public safety; the impacts of engineering activity; economic, social, cultural, environmental and sustainability; K8: Engagement with selected
knowledge in the research literature of the discipline

P-Range of Complex Engineering Problem Solving:

P1: Cannot be resolved without in-depth engineering knowledge at the level of one or more of K3, K4, K5, K6 or K8 which allows a fundamentals-based, first
principles analytical approach; P2: Involve wide-ranging or conflicting technical, engineering and other issues; P3: Have no obvious solution and require
abstract thinking, originality in analysis to formulate suitable models; P4: Involve infrequently encountered issues; P5: Are outside problems encompassed by

COURSE OUTLINE Page 3 of 6

Course No: CSE 103, Level 1/ Term 1, Credit (Contact) Hours: 3 Credits (3hrs/wk)
 Department of Computer Science and Engineering, BUET

standards and codes of practice for professional engineering; P6: Involve diverse groups of stakeholders with widely varying needs; P7: Are high level problems
including many component parts or sub-problems

A-Range of Complex Engineering Activities:

A1: Involve the use of diverse resources (and for this purpose resources include people, money, equipment, materials, information and technologies); A2:
Require resolution of significant problems arising from interactions between wide-ranging or conflicting technical, engineering or other issues; A3: Involve
creative use of engineering principles and research-based knowledge in novel ways; A4: Have significant consequences in a range of contexts, characterized by
difficulty of prediction and mitigation; A5: Can extend beyond previous experiences by applying principles-based approaches

6. Lecture/ Activity Plan

Week Lecture Topics Corresponding CO(s)

Week 1 Introduction, Motivation; Set Theory CO1

Week 2 propositional calculus CO1

Week 3 predicate calculus CO1

Mathematical reasoning and proof techniques

Week 4 CO1
sequences, sums, function

Mathematical reasoning and proof techniques

Week 5 CO1
function, relations

Week 6 sequences, sums, function Mathematical CO1

reasoning and proof techniques

COURSE OUTLINE Page 4 of 6

Course No: CSE 103, Level 1/ Term 1, Credit (Contact) Hours: 3 Credits (3hrs/wk)
 Department of Computer Science and Engineering, BUET

Week Lecture Topics Corresponding CO(s)

function, relations Mathematical reasoning

Week 7 CO1
and proof techniques

Week 8 Number theory and algebraic structures CO1

Week 9 Counting CO2

Week 10 Counting CO2

Week 11 Discrete Probability CO2

Recurrence relations and recursive

Week 12 CO3
algorithms

Week 13 Graph Theory: graphs, paths, and trees CO3

Week 14 Revision CO1, CO2, and CO3

7. Assessment Strategy
● Class Attendance: Class attendance will be recorded in every class.
● Class Tests/Assignments/Projects: There will be a minimum of 4 (four) Class Tests/Assignments/Projects, out of which the best 3 (three)
will be considered in final evaluation.
● Final exam: A comprehensive Final exam will be held at the end of the semester as per the institutional ordinance.

8. Distribution of Marks

COURSE OUTLINE Page 5 of 6

Course No: CSE 103, Level 1/ Term 1, Credit (Contact) Hours: 3 Credits (3hrs/wk)
 Department of Computer Science and Engineering, BUET

Attendance: 10 %
Class Tests/Assignments/Projects: 20%
Final Exam: 70%
Total: 100%

9. Textbook/ Reference
a. Keneth. H. Rosen, “Discrete mathematics and its applications”, Tata McGraw- Hill Publishing Company, New Delhi
b. Susanna S. Epp, “Discrete mathematics and its applications”, Brooks/Cole-Thomas Learning, USA.

COURSE OUTLINE Page 6 of 6

Course No: CSE 103, Level 1/ Term 1, Credit (Contact) Hours: 3 Credits (3hrs/wk)