Home / Semester 6 / MTH265

DISCRETE MATHEMATICS FOR COMPUTING

MTH265 3 Credits L:3 T:0 P:0 Open Minor

This course covers foundational discrete mathematics concepts for computing, including relations, lattices, Boolean algebra, discrete probability, formal languages, and automata.

Study Units

Unit 1

Relations

Unit 2

Ordered Sets and Lattices

Unit 3

Boolean Algebra

Unit 4

Discrete Probability-I

Unit 5

Discrete Probability -II

Unit 6

Languages, Automata, Grammars

Continuous Assessment

2 components

Test 50%

To develop a strong understanding of relations, ordered sets, and lattices, focusing on their properties, visual representations, and practical applications in mathematical reasoning and problem-solvi. Relations : introduction, types of relations, reflexive relations... Ordered Sets and Lattices...

Week 5 / 6
Test- Situation based problem solving 50%

To assess understanding of discrete probability concepts, including probability computation, independence, distributions, Bayes’ theorem, expected values, and variance, with a focus on their applicati. Discrete Probability-I... Discrete Probability -II...

Week 11 / 12

Exams & Practice

Mid Term Examination

Mid-semester comprehensive evaluation

20%
Coming Soon

End Term Examination

Final semester comprehensive evaluation

50%

Type: Examination

Coming Soon

MTH265 - FAQs

How many units are in MTH265?

MTH265 has 6 units. Each unit includes detailed notes and MCQ practice questions.

What exam resources are available for MTH265?

Unit-wise notes and MCQ practice are available. Exam resources coming soon.

How to prepare for MTH265 exams?

Study each unit's notes thoroughly, practice MCQs to test understanding, and attempt mock tests before exams. Focus on important topics and previous year questions.