Discrete Mathematics (Course Code: MCS-13)

A vital course delving into fundamental mathematical structures crucial for computer science and engineering. Explore propositional calculus, Boolean algebra, combinatorics, and more. Gain problem-solving prowess through interactive lectures and assignments.

Live Course

Live Class: Sunday, 31 Mar

Duration: 10 Hours

Enrolled: 8

Offered by: IGNOU Guidance


Live Course

About Course

Welcome to Discrete Mathematics, (BCA Second Semester - IGNOU) an essential course designed to equip students with fundamental concepts in mathematical structures crucial for computer science and engineering applications. Discrete mathematics, often referred to as finite mathematics, focuses on structures that are inherently discrete, devoid of continuity notions. In today's digital age, the study of discrete sets has become indispensable, especially in computer science, where concepts from discrete mathematics are utilized to express and solve problems in algorithm development and programming languages.

Course Objectives:

This course aims to provide students with a solid foundation in discrete mathematics, enhancing their ability to tackle algorithmic challenges and problem-solving tasks efficiently. By the end of this course, students will:

  • Understand basic concepts such as propositions, predicates, Boolean algebra, logic circuits, sets, relations, functions, combinatorics, partitions, and distributions.

  • Develop proficiency in elementary logic, methods of proof, Boolean algebra, logic circuits, and basic combinatorial principles.

  • Gain insights into combinatorial techniques including permutations, combinations, counting principles, and their applications in various domains.
  • Master the art of partitioning and distributing objects into containers, both distinguishable and indistinguishable.

Key Topics Covered:

  • Propositional calculus
  • Logical connectives
  • Methods of proof: direct, indirect, induction
  • Boolean algebra
  • Logic circuits and Boolean functions
  • Sets, relations, and functions
  • Combinatorial principles: permutations, combinations, binomial coefficients
  • Counting principles: pigeonhole principle, inclusion-exclusion principle
  • Partitions and distributions of objects into containers

Delivery Method:

This online course employs interactive lectures, practical examples, quizzes, and assignments to ensure active engagement and comprehension. Students will have access to resources such as video lectures, readings, and supplementary materials to reinforce learning. Additionally, discussion forums will facilitate peer-to-peer interaction and problem-solving collaboration.

Embark on your journey into the fascinating realm of discrete mathematics, and enhance your problem-solving skills essential for success in computer science and engineering domains. Join us in exploring the discrete world of logic, sets, and combinatorial wonders!

Course Offerings

  • Prepare You for the Examination
  • Assignment Preparation Guidance
  • Last Year Exam Questions Discussion
  • Study Learning Material (Soft Copy)
  • Provision of Notes if Required
  • Interactive Classes Led by Teachers
  • Clarification of Doubts During Class
  • Access Recordings of Live Classes
  • Accessible on all Devices
  • Community Based Discussion Forum
  • Topics
  • Instructor (1)
  • Reviews
  • Prepositional Calculus
  • Methods of Proof
  • Boolean Algebra and Circuits
  • Sets, Relations and Functions
  • Combinatorics – An Introduction
  • Some More Counting Principles
  • Partitions and Distributions


Discrete Mathematics (Course Code: MCS-13) students also learn