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: Sets, Relations & FunctionsUnit 2: LogicUnit 3: Combinatorics & Recurrence Relations
- 3
Part 2 of the syllabusपाठ्यक्रम भाग 2Unit-wise coaching with notes and doubt classes.
Unit 4: Graphs & TreesUnit 5: Algebraic Structures & Lattices
- 4
Unit tests & assignmentsयूनिट टेस्टRegular tests in the university / board pattern.
- 5
Semester 1 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: Sets, Relations & Functions
5 topics+
- Sets, operations and Venn diagrams
- Power set and Cartesian product
- Relations: reflexive, symmetric, antisymmetric, transitive
- Equivalence relations and partitions
- Functions: one-one, onto, bijection, inverse and composition
02Unit 2: Logic
5 topics+
- Propositions and logical connectives
- Truth tables, tautology and contradiction
- Logical equivalence; converse, inverse and contrapositive
- Rules of inference
- Predicates and quantifiers
03Unit 3: Combinatorics & Recurrence Relations
6 topics+
- Sum and product rules
- Permutations and combinations
- Pigeonhole principle
- Inclusion-exclusion principle
- Linear recurrence relations with constant coefficients
- Generating functions
04Unit 4: Graphs & Trees
5 topics+
- Graph terminology and types
- Degree and handshaking theorem
- Paths, circuits, Euler and Hamiltonian graphs
- Graph representation: adjacency matrix and list
- Trees, spanning trees and minimum spanning tree
05Unit 5: Algebraic Structures & Lattices
5 topics+
- Partial order relations and Hasse diagrams
- Lattices
- Boolean algebra and its laws
- Groups, subgroups and cyclic groups
- Rings and fields
About this course
You will be able to
- Use sets, relations and functions, and test properties of relations
- Apply propositional and predicate logic and rules of inference
- Solve counting problems using permutations, combinations and the pigeonhole principle
- Solve linear recurrence relations
- Use graph and tree concepts: degree, paths, Euler and Hamilton graphs, spanning trees
- Explain posets, lattices, Boolean algebra and algebraic structures such as groups
Who it is for
- MCA students of Semester 1 (AKTU)
- Students who need the mathematical base for data structures, algorithms and theory of computation
What you need
- Graduation (BCA / B.Sc / B.Com / B.A) with Mathematics at 10+2 or graduation level (MCA admission)
- Class 12 level algebra
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 is followed?
The AKTU (Dr. A.P.J. Abdul Kalam Technical University, Lucknow) MCA syllabus of Discrete Mathematics (Semester 1). If your own university's syllabus differs, the centre follows your university syllabus and units.
Is Discrete Mathematics difficult for non-maths graduates?
With regular practice it is manageable; the trainer solves many examples from each unit and previous AKTU papers.
How will I be tested?
Unit-wise MCQ tests and a final paper at semester level, plus practice on short and long answer questions from previous university papers.
