IGNOU MCS-013 Assignment 2026-27
Discrete Mathematics
Last updated by IGNOU: 06 Aug 2026. Guide written from the official PDF on 23 Oct 2026, 01:24 pm.
| Course code | MCS-013 |
|---|---|
| Course title | Discrete Mathematics |
| Programme | Bachelor of Computer Applications (BCA) (Revised Syllabus)BCAOL |
| School | School of Computer and Information Sciences |
| Assignment code | BCA (II)/013/Assignment/2026-27 |
| Session | July 2026 and January 2027 |
| Maximum marks | 100 |
| Weightage | 30% |
| Last date (June exam) | 30 Apr 2027 |
| Last date (December exam) | 31 Oct 2026 |
| Medium |
About the MCS-013 assignment
The MCS-013 assignment covers sets, propositional logic, relations, functions, Boolean algebra, counting methods and probability. Tasks include mathematical proofs, truth tables, Venn diagrams, logic circuits and problems involving arrangements, selections and distributions.
There are eight compulsory written questions carrying 80 marks, with another 20 marks allocated to viva-voce. Each question has several parts. Illustrations and diagrams may be used to support explanations, and presentation should follow the assignment guidelines in the Programme Guide.
What the assignment asks
| Question | Marks | Topic |
|---|---|---|
| Q1 | 3, 4, 3 | Explain sets and their uses, construct truth tables for two logical expressions, and give geometric representations of two Cartesian products. |
| Q2 | 3, 4, 3 | Draw Venn diagrams for set expressions, translate quantified symbolic forms into mathematical statements, and establish whether the square root of 13 is rational. |
| Q3 | 2, 4, 4 | Explain the inclusion-exclusion principle, draw circuits for Boolean expressions, and discuss tautology while proving a logical equivalence involving a biconditional. |
| Q4 | 2, 5, 3 | Count arrangements using the letters of SUCCESS under two conditions, explain relations and equivalence relations, and prove the formula for the sum of the first n squares. |
| Q5 | 4, 2, 2, 2 | Count committees subject to professional-group requirements, calculate a probability for mutually exclusive events, count odd three-digit numbers, and test a function for injectivity. |
| Q6 | 2, 3, 3, 2 | Count item distributions under box-occupancy conditions and four-digit multiples of five, evaluate expressions involving three sets, and distinguish functions from relations. |
| Q7 | 2, 3, 2, 3 | Explain the probability addition theorem, construct Pascal's triangle through n = 7, describe Boolean duality, and find the inverse of the given function. |
Assignment details and PDFs come from IGNOU's official website; the guide is a summary of the official PDF. Always check the latest instructions and last dates on ignou.ac.in or with your Regional Centre before submitting.