Mathematics-II (BCA)

Discrete mathematics: logic, combinatorics, graph theory, recurrence relations and probability basics.

6 MonthsDuration 5Chapters26Topics

Syllabus · पाठ्यक्रम

Download PDF
01Unit 1: Mathematical Logic 6 topics
  1. Propositions and connectives
  2. Truth tables
  3. Tautology and contradiction
  4. Logical equivalence and laws
  5. Converse, inverse and contrapositive
  6. Predicates and quantifiers
02Unit 2: Combinatorics 6 topics
  1. Sum and product rules
  2. Permutations
  3. Combinations
  4. Permutations with repetition
  5. Pigeonhole principle
  6. Inclusion-exclusion
03Unit 3: Graph Theory 5 topics
  1. Graphs - terms and types
  2. Degree and handshaking lemma
  3. Paths, circuits and connectivity
  4. Euler and Hamiltonian graphs
  5. Trees and spanning trees
04Unit 4: Recurrence Relations 4 topics
  1. Formulation of recurrence relations
  2. Linear homogeneous recurrences with constant coefficients
  3. Characteristic equation
  4. Generating functions
05Unit 5: Probability Basics 5 topics
  1. Sample space and events
  2. Classical definition of probability
  3. Addition and multiplication theorems
  4. Conditional probability
  5. Bayes' theorem

About

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)

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.

Download the syllabus (PDF)

Tell us who you are — your copy is made with your name, and our counsellor can help you choose the right course and centre.

Want to join right away? Enquire now — our centre will call you.