Assignment for Note book (Marks-05)
Course Title: Computer Science Lab-II Course Code-Math 211
Write the C++ programming to Solve the following Problems
1. Complex Number Class
• Description: Create a class for complex numbers with methods for addition, subtraction,
multiplication, division, and finding the magnitude and argument.
• Concepts: Complex numbers, operators overloading, methods, constructors.
2. Matrix Operations
• Description: Implement a class to handle basic matrix operations such as addition,
subtraction, multiplication, and determinant calculation.
• Concepts: Matrices, operators overloading, methods, loops.
3. Polynomial Class
• Description: Design a class to represent polynomials and implement methods for addition,
multiplication, and evaluation at a given point.
• Concepts: Polynomials, arrays, methods, loops.
4. Quadratic Equation Solver
• Description: Implement a class to solve quadratic equations of the form ax² + bx + c = 0
and return the roots.
• Concepts: Quadratic equations, discriminant, methods.
5. Vector Operations
• Description: Create a class to represent 2D or 3D vectors and implement methods for dot
product, cross product (for 3D), and calculating the magnitude of the vector.
• Concepts: Vectors, operators overloading, methods, geometry.
6. Prime Number Checker
• Description: Implement a class that can check whether a given number is prime and
generate a list of prime numbers up to a given limit.
• Concepts: Prime numbers, loops, conditionals, methods.
7. Rational Number Class
• Description: Create a class for rational numbers (fractions) and implement methods for
addition, subtraction, multiplication, division, and simplification.
• Concepts: Rational numbers, operators overloading, greatest common divisor (GCD),
methods.
8. GCD and LCM Calculator
• Description: Implement a class to calculate the greatest common divisor (GCD) and least
common multiple (LCM) of two numbers.
• Concepts: GCD, LCM, methods, recursion.
9. Distance Between Two Points
• Description: Create a class that calculates the distance between two points in a 2D or 3D
space using the distance formula.
• Concepts: Geometry, distance formula, methods.
10. Fibonacci Sequence Generator
• Description: Implement a class to generate Fibonacci numbers up to a given position in
the sequence.
• Concepts: Recursion, sequences, methods.
11. Binomial Coefficient Calculator
• Description: Create a class to compute the binomial coefficient (n choose k), using both
iterative and recursive methods.
• Concepts: Binomial theorem, combinatorics, recursion.
12. Statistics Calculator (Mean, Median, Mode)
• Description: Implement a class that computes the mean, median, and mode of a given set
of data.
• Concepts: Arrays, sorting, statistics, methods.
13. Simple Interest and Compound Interest
• Description: Design a class that calculates both simple interest and compound interest for
a given principal, rate, and time.
• Concepts: Financial mathematics, formulas, methods.
14. Pythagorean Triplets
• Description: Implement a class that checks whether three given numbers form a
Pythagorean triplet (a² + b² = c²).
• Concepts: Pythagorean theorem, conditionals, methods.
15. Roots of a Polynomial
• Description: Create a class that can find the real roots of a quadratic polynomial and
approximate the roots of higher degree polynomials using numerical methods like Newton-
Raphson.
• Concepts: Polynomials, numerical methods, root-finding algorithms.
16. Numerical Integration (Trapezoidal Rule)
• Description: Implement a class to calculate the numerical integration of a function using
the trapezoidal rule.
• Concepts: Numerical methods, integration, loops, function pointers.
17. Linear Equation Solver (Gaussian Elimination)
• Description: Implement a class that solves a system of linear equations using the Gaussian
elimination method.
• Concepts: Linear algebra, matrices, solving systems of equations, loops.
18. Sine and Cosine Approximations
• Description: Create a class that approximates the sine and cosine of an angle using their
Taylor series expansions.
• Concepts: Taylor series, trigonometry, loops, recursion.
19. Solving System of Equations (Cramer's Rule)
• Description: Implement a class to solve a system of linear equations using Cramer's Rule.
• Concepts: Linear algebra, determinants, matrices, methods.
20. Euler’s Method for Differential Equations
• Description: Implement a class that uses Euler’s method to numerically solve first-order
differential equations.
• Concepts: Numerical methods, differential equations, loops, approximation.
