Goseeko covers the entire spectrum of student’s journey from Academics to Career. From helping them to ace their academics with our personalized study material to providing them with career development resources, our students meet their academic and professional goals.

Company

Testimonials

About Us Certifications Blog Rewards Points Media Release Site Map

Courses

B.E.

B.Com

B.A.

BBA

BMS

BSC

Resources

Notes

MCQ

Question bank

Audio bites

Express Class

Reference Videos

Solved Question Papers

Support

support@goseeko.com

Terms & Conditions | Cancellation & Refund policy |

Utkal University, Odisha, General Semester 4, Business Mathematics Syllabus

Business Mathematics Lecture notes | Videos | Free pdf Download | Previous years solved question papers | MCQs | Question Banks| Syllabus

Unit - 1 Matrices and Determinants

1.1 Algebra of matrices

1.2 Inverse of a matrix

1.3 Matrix Operation – Business Application Solution of system of linear equations having unique solution and involving not more than three variables using matrix inversion Method and Cremer’s Rule.

Unit - 2 Calculus

2.1 Mathematical functions and their types linear quadratic polynomial exponential logarithmic and logistic function.

2.2 Concepts of limit and continuity of a function Concept and rules of differentiation Maxima and Minima involving second order

Unit - 3 Calculus II

3.1 Integration Standard forms Methods of integration – by substitution by parts and by use of partial fractions definite integration finding areas in simple cases

Unit - 4 Mathematics of Finance

4.1 Compounding and discounting of a sum using different types of rates.

4.2 Types of annuities like ordinary due deferred continuous perpetual and their future and present values using different types of rates of interest Depreciation of Assets. General annuities to be excluded

Unit - 5 Linear Programming

5.1 Formulation of linear programming problems LPP Graphical solution to LPPs. Cases of unique and multiple optimal solutions Unbounded solutions and infeasibility and redundant constraints Solution to LPPs using Simplex method – maximization and minimization cases.