Integrated B.Sc. - B.Ed.

The department offers disciplinary/interdisciplinary 4-years integrated B.Sc. - B.Ed. program from the academic year 2024-25. The current students’ strength is 7. Admission to B.Sc. - B.Ed. Program through your score in the National Common Entrance Test (NCET). Click the Link for details.

B.Sc. - B.Ed. Course Structure

Semester - I

Responsive Course Table
Sr. Course Code Course Name Credits L-T-P-S-C
1. MB101 Calculus 4 4-0-0-8
2. MB102 Discrete Mathematics 4 4-0-0-8
3. MB103 Matrices & Linear Algebra 5 4-0-2-10
4. MB104 Coordinate geometry and Trigonometry 4 4-0-0-8
Total Credits: 16.5

Semester-II

Responsive Course Table
Sr. Course Code Course Name Credits L-T-P-S-C
1. MB201 Algebra 4 4-0-0-8
2. MB202 Advanced Calculus 4 4-0-0-8
3. MB203 Differential Equations 4 4-0-0-8
Total Credits: 12

Semester-III

Responsive Course Table
Sr. Course Code Course Name Credits L-T-P-S-C
Courses will be updated soon . . .

Semester-IV

Responsive Course Table
Sr. Course Code Course Name Credits L-T-P-S-C
Courses will be updated soon . . .

B.Sc. - B.Ed. Courses

Real numbers, Functions and their graphs, Limits and continuity of single variable functions, Differentiation and applications of derivatives, Rolle’s theorem, Cauchy’s mean value theorem, Indeterminate forms, Taylor’s and Maclaurin‘s theorems with remainders, Maxima and Minima, Concavity and convexity of a curve, Points of inflexion, Asymptotes and Curvature, Definite integrals, Fundamental theorem of calculus, Mean value theorems, Applications to length, Moments and center of mass, Surfaces of revolutions, Sequences, Series and their convergence, Absolute and Conditional convergence, Power series, Taylor’s and Maclaurin’s series, Convergence of improper integrals, Tests of convergence,Convergence of Beta and Gamma functions.Differentiation under integral sign, differentiation of integrals with variable limits – Leibnitz rule, Conic section and polar coordinates.

Logic and Proofs: Propositional Logic Predicates and Quantifiers, Proof Methods.

Set Theory: Basic Set Structure, Cardinality of a Set.

Relations, Induction and Recurrences: Relations and Their Properties, Closure of Relations, Equivalence Relations, Partial Orderings, Induction, Strong Induction, Recursive Definitions. Counting Techniques: Pigeonhole Principle, Permutations and Combinations, Binomial Coefficients, Recurrence Relations, Generating Functions, Inclusion-exclusion principle.

Number Theory and Cryptography: Modular arithmetic, Euclid’s Algorithm, Primes, Solving Congruences; Public key Cryptography. Graph Theory: Basic terminology and Special type of graphs, Connectivity, Eulerian and Hamiltonian graphs, Planar graphs, Graph Coloring, Shortest Path, Minimum Spanning Trees.

Boolean Algebra: Boolean Functions, Logic Gates.

Content to Update.

Content to update

Content to update.

Content to update.

Content to update.

Scroll to Top