Your roadmap · आपका रोडमैप
- 1
Admission & first meetingप्रवेश और पहली मुलाकातEnquire at your nearest NDSS centre, meet the teacher, fix the batch time and get your study material.
- 2
Part 1 of the syllabusपाठ्यक्रम भाग 1Unit-wise coaching with notes and doubt classes.
Unit 1: Mathematical LogicUnit 2: CombinatoricsUnit 3: Graph Theory
- 3
Part 2 of the syllabusपाठ्यक्रम भाग 2Unit-wise coaching with notes and doubt classes.
Unit 4: Recurrence RelationsUnit 5: Probability Basics
- 4
Unit tests & assignmentsयूनिट टेस्टRegular tests in the university / board pattern.
- 5
Semester 2 exam (university / board)विश्वविद्यालय / बोर्ड परीक्षाPrevious papers and full revision before the exam.
- 6
Online tests & resultऑनलाइन टेस्ट और रिज़ल्टTake the tests online; your marks and result show in your student login and at the centre.
Syllabus · पाठ्यक्रम
1 subject · 5 chapters · 26 topics
01Unit 1: Mathematical Logic
6 topics+
- Propositions and connectives
- Truth tables
- Tautology and contradiction
- Logical equivalence and laws
- Converse, inverse and contrapositive
- Predicates and quantifiers
02Unit 2: Combinatorics
6 topics+
- Sum and product rules
- Permutations
- Combinations
- Permutations with repetition
- Pigeonhole principle
- Inclusion-exclusion
03Unit 3: Graph Theory
5 topics+
- Graphs - terms and types
- Degree and handshaking lemma
- Paths, circuits and connectivity
- Euler and Hamiltonian graphs
- Trees and spanning trees
04Unit 4: Recurrence Relations
4 topics+
- Formulation of recurrence relations
- Linear homogeneous recurrences with constant coefficients
- Characteristic equation
- Generating functions
05Unit 5: Probability Basics
5 topics+
- Sample space and events
- Classical definition of probability
- Addition and multiplication theorems
- Conditional probability
- Bayes' theorem
About this course
You will be able to
- Write propositions in symbolic logic and test them with truth tables
- Solve counting problems using permutations, combinations and the pigeonhole principle
- Apply graph theory concepts - degree, paths, Euler and Hamiltonian graphs and trees
- Form and solve linear recurrence relations
- Compute probabilities using addition, multiplication and conditional probability rules
Who it is for
- BCA students of Semester 2 (UP state universities, Lucknow University pattern)
- Students preparing for discrete mathematics sections of MCA entrance (NIMCET, CUET-PG)
What you need
- Mathematics-I (BCA Semester 1)
Online tests & result
Practice and unit tests online; marks and result show in your student login and at the centre.
Student login →
Questions
Which syllabus does this Mathematics-II course follow?
It follows the common UP state university BCA syllabus (University of Lucknow pattern) for BCA Semester 2. If your own university's syllabus differs, the centre follows your university's syllabus and unit order.
Why is discrete mathematics taught in BCA?
Logic, counting and graphs are the base of programming, databases, networks and algorithms.
Is this useful for MCA entrance?
Yes. NIMCET and similar exams ask sets, logic, combinatorics and probability questions at this level.
