Modular arithmetic, linear congruences, queueing theory, and optimization
Course notes and previous year questions for Mathematical Analysis for Computer Science (CSE-3102), 3rd Year 1st Semester of the JnU B.Sc. in CSE curriculum — covering modular arithmetic, linear congruences, queueing theory (M/M/1, M/M/∞), gradient descent, differential calculus, and constrained optimization (Lagrange multipliers).
No chapters have been added for this course yet.
4 questions with worked solutions from past exams.