diff --git a/.DS_Store b/.DS_Store
new file mode 100644
index 0000000..ae55d15
Binary files /dev/null and b/.DS_Store differ
diff --git a/Suriya/.DS_Store b/Suriya/.DS_Store
new file mode 100644
index 0000000..41019dd
Binary files /dev/null and b/Suriya/.DS_Store differ
diff --git a/Suriya/Assignment1/.DS_Store b/Suriya/Assignment1/.DS_Store
new file mode 100644
index 0000000..2b93ed7
Binary files /dev/null and b/Suriya/Assignment1/.DS_Store differ
diff --git a/Suriya/Assignment1/Account.cpp b/Suriya/Assignment1/Account.cpp
new file mode 100644
index 0000000..43e056b
--- /dev/null
+++ b/Suriya/Assignment1/Account.cpp
@@ -0,0 +1,34 @@
+//Exercise 3.12 - Class Source File
+//ex3_12-Account.cpp
+
+#include <iostream>
+#include "Account.h"
+using namespace std;
+
+Account::Account(int number) {
+    setBalance(number);
+}
+
+void Account::setBalance(int number) {
+    if (number>=0)
+        balance = number;
+    if (number<0) {
+        balance = 0;
+        cout << "Error: Invalid value. Balance set to 0." << endl;
+    }
+}
+
+int Account::getBalance() {
+    return balance;
+}
+
+void Account::credit(int cred) {
+    setBalance(getBalance()+cred);
+}
+
+void Account::debit(int deb) {
+    if (deb<=getBalance())
+        setBalance(getBalance()-deb);
+    if (deb>getBalance())
+        cout<<"Debit amount exceeded account balance."<<endl;
+}
\ No newline at end of file
diff --git a/Suriya/Assignment1/Account.h b/Suriya/Assignment1/Account.h
new file mode 100644
index 0000000..fa312ee
--- /dev/null
+++ b/Suriya/Assignment1/Account.h
@@ -0,0 +1,14 @@
+//Exercise 3.12 - Header File
+//ex3_12-Account.h
+
+class Account{
+    public:
+        Account(int);
+        void setBalance(int);
+        int getBalance();
+        void credit(int);
+        void debit(int);
+
+    private:
+        int balance;
+};
\ No newline at end of file
diff --git a/Suriya/Assignment1/CMakeLists.txt b/Suriya/Assignment1/CMakeLists.txt
new file mode 100644
index 0000000..7410c40
--- /dev/null
+++ b/Suriya/Assignment1/CMakeLists.txt
@@ -0,0 +1,22 @@
+cmake_minimum_required(VERSION 3.23)
+project(Assignment1)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(ex2_19 ex2_19_main.cpp)
+add_executable(ex2_24 ex2_24_main.cpp)
+add_executable(ex2_25 ex2_25_main.cpp)
+add_executable(ex2_28 ex2_28_main.cpp)
+add_executable(ex3_11 ex3_11_main_GradeBook.cpp GradeBook.cpp GradeBook.h)
+add_executable(ex3_12 ex3_12_main_Account.cpp Account.cpp Account.h)
+add_executable(ex3_13 ex3_13_main_Invoice.cpp Invoice.cpp Invoice.h)
+add_executable(ex3_14 ex3_14_main_Employee.cpp Employee.cpp Employee.h)
+add_executable(ex3_15 ex3_15_main_Date.cpp Date.cpp Date.h)
+add_executable(ex4_13 ex4_13_main.cpp)
+add_executable(ex4_26 ex4_26_main.cpp)
+add_executable(ex4_27 ex4_27_main.cpp)
+add_executable(ex4_34 ex4_34_main.cpp)
+add_executable(ex4_35d ex4_35_decrypt_main.cpp)
+add_executable(ex4_35e ex4_35_encrypt_main.cpp)
+
+
diff --git a/Suriya/Assignment1/Date.cpp b/Suriya/Assignment1/Date.cpp
new file mode 100644
index 0000000..411e17e
--- /dev/null
+++ b/Suriya/Assignment1/Date.cpp
@@ -0,0 +1,33 @@
+//Exercise 3.15 - Class Source File
+//ex3_15-Date.cpp
+
+#include <iostream>
+#include "Date.h"
+using namespace std;
+
+Date::Date(int month1, int day1, int year1) {
+    setDay(day1);
+    setMonth(month1);
+    setYear(year1);
+}
+
+void Date::setDay(int day1) {
+    day = day1;
+}
+
+void Date::setMonth(int month1) {
+    if (month1<1 || month1>12){
+        month = 1;
+        cout<<"Invalid month input. Month set to January"<<endl;
+    }
+    if (month1>=1 && month1<=12)
+        month = month1;
+}
+
+void Date::setYear(int year1) {
+    year = year1;
+}
+
+void Date::displayDate() {
+    cout<<"Recorded date is: "<<month<<"/"<<day<<"/"<<year<<endl;
+}
\ No newline at end of file
diff --git a/Suriya/Assignment1/Date.h b/Suriya/Assignment1/Date.h
new file mode 100644
index 0000000..4feeefe
--- /dev/null
+++ b/Suriya/Assignment1/Date.h
@@ -0,0 +1,17 @@
+//Exercise 3.15 - Header File
+//ex3_15-Date.h
+
+#include <string>
+using namespace std;
+
+class Date{
+    public:
+        Date(int, int, int);
+        void setDay(int);
+        void setMonth(int);
+        void setYear(int);
+        void displayDate();
+
+    private:
+        int day,month,year;
+};
\ No newline at end of file
diff --git a/Suriya/Assignment1/Employee.cpp b/Suriya/Assignment1/Employee.cpp
new file mode 100644
index 0000000..3ec78fb
--- /dev/null
+++ b/Suriya/Assignment1/Employee.cpp
@@ -0,0 +1,43 @@
+//Exercise 3.14 - Class Source File
+//ex3_14-Employee.cpp
+
+#include<iostream>
+#include<string>
+#include "Employee.h"
+using namespace std;
+
+Employee::Employee(string f_name, string l_name, int pay){
+    setFirstName(f_name);
+    setLastName(l_name);
+    setSalary(pay);
+}
+
+void Employee::setFirstName(string f_name) {
+    fname = f_name;
+}
+
+void Employee::setLastName(string l_name) {
+    lname = l_name;
+}
+
+void Employee::setSalary(int pay) {
+    if (pay>=0)
+        salary = pay;
+    if (pay<0){
+        cout<<"Invalid value. Salary set to 0."<<endl;
+        salary = 0;
+    }
+}
+
+string Employee::getEmployeeName() {
+    return fname+" "+lname;
+}
+
+int Employee::getEmployeeSalary() {
+    return salary;
+}
+
+void Employee::displayAnnualSalary(){
+    cout<<getEmployeeName()<<"'s annual salary is: $ "<<getEmployeeSalary()*12<<endl;
+}
+
diff --git a/Suriya/Assignment1/Employee.h b/Suriya/Assignment1/Employee.h
new file mode 100644
index 0000000..3dd8327
--- /dev/null
+++ b/Suriya/Assignment1/Employee.h
@@ -0,0 +1,20 @@
+//Exercise 3.14 - Header File
+//ex3_14-Employee.h
+
+#include<string>
+using namespace std;
+
+class Employee{
+    public:
+        Employee(string, string, int);
+        void setFirstName(string);
+        void setLastName(string);
+        void setSalary(int);
+        string getEmployeeName();
+        int getEmployeeSalary();
+        void displayAnnualSalary();
+
+    private:
+        string fname, lname;
+        int salary;
+};
\ No newline at end of file
diff --git a/Suriya/Assignment1/GradeBook.cpp b/Suriya/Assignment1/GradeBook.cpp
new file mode 100644
index 0000000..e5d4133
--- /dev/null
+++ b/Suriya/Assignment1/GradeBook.cpp
@@ -0,0 +1,34 @@
+//Exercise 3.11 - Class Source File
+//ex3_11-GradeBook.cpp
+
+#include <iostream>
+#include <string>
+#include "GradeBook.h"
+
+using namespace std;
+
+GradeBook::GradeBook( string name, string instr ) {
+    setCourseName( name );
+    setCourseInstr( instr );
+}
+
+void GradeBook::setCourseName( string name ) {
+    courseName = name;
+}
+
+void GradeBook::setCourseInstr( string instr) {
+    courseInstr = instr;
+}
+
+string GradeBook::getCourseName() {
+    return courseName;
+}
+
+string GradeBook::getCourseInstr() {
+    return courseInstr;
+}
+
+void GradeBook::displayMessage() {
+    cout << "Welcome to the grade book for\n" << getCourseName() << "!\n"
+        << "This course is presented by: " << getCourseInstr() << ".\n" <<endl;
+}
\ No newline at end of file
diff --git a/Suriya/Assignment1/GradeBook.h b/Suriya/Assignment1/GradeBook.h
new file mode 100644
index 0000000..0a273ca
--- /dev/null
+++ b/Suriya/Assignment1/GradeBook.h
@@ -0,0 +1,19 @@
+//Exercise 3.11 - Header File
+//ex3_11-GradeBook.h
+
+#include <string>
+using namespace std;
+
+class GradeBook
+{
+    public:
+        GradeBook( string, string );
+        void setCourseName( string );
+        void setCourseInstr( string );
+        string getCourseName();
+        string getCourseInstr();
+        void displayMessage();
+
+    private:
+        string courseName,courseInstr;
+};
diff --git a/Suriya/Assignment1/Invoice.cpp b/Suriya/Assignment1/Invoice.cpp
new file mode 100644
index 0000000..3e7e4d0
--- /dev/null
+++ b/Suriya/Assignment1/Invoice.cpp
@@ -0,0 +1,60 @@
+//Exercise 3.13 - Class Source File
+//ex3_13-Invoice.cpp
+
+#include <iostream>
+#include <string>
+#include "Invoice.h"
+using namespace std;
+
+Invoice::Invoice(string partnumb, string partdescript, int quan, int price1){
+    setPartNumber(partnumb);
+    setPartDescript(partdescript);
+    setQuant(quan);
+    setPrice(price1);
+}
+
+void Invoice::setPartNumber(string partnumb){
+    partNumber = partnumb;
+}
+
+void Invoice::setPartDescript(string partdescript){
+    partDescript = partdescript;
+}
+
+void Invoice::setQuant(int quan){
+    if (quan>=0)
+        quant = quan;
+    if (quan<0){
+        cout<<"Invalid input value. Quantity set to 0."<<endl;
+        quant = 0;
+    }
+}
+
+void Invoice::setPrice(int price1){
+    if (price1>=0)
+        price = price1;
+    if (price1<0){
+        cout<<"Invalid input value. Price set to 0."<<endl;
+        price = 0;
+    }
+}
+
+string Invoice::getPartNumber() {
+    return partNumber;
+}
+
+string Invoice::getPartDescript() {
+    return partDescript;
+}
+
+int Invoice::getQuant() {
+    return quant;
+}
+
+int Invoice::getPrice() {
+    return price;
+}
+
+int Invoice::getInvoiceAmount() {
+    return getQuant()*getPrice();
+}
\ No newline at end of file
diff --git a/Suriya/Assignment1/Invoice.h b/Suriya/Assignment1/Invoice.h
new file mode 100644
index 0000000..11762af
--- /dev/null
+++ b/Suriya/Assignment1/Invoice.h
@@ -0,0 +1,24 @@
+//Exercise 3.13 - Header File
+//ex3_12-Invoice.h
+
+#include<string>
+using namespace std;
+
+class Invoice{
+    public:
+        Invoice(string,string,int,int);
+        void setPartNumber(string);
+        void setPartDescript(string);
+        void setQuant(int);
+        void setPrice(int);
+        string getPartNumber();
+        string getPartDescript();
+        int getQuant();
+        int getPrice();
+        int getInvoiceAmount();
+
+    private:
+        string partNumber, partDescript;
+        int quant, price;
+
+};
\ No newline at end of file
diff --git a/Suriya/Assignment1/ex2_19_main.cpp b/Suriya/Assignment1/ex2_19_main.cpp
new file mode 100644
index 0000000..907d19e
--- /dev/null
+++ b/Suriya/Assignment1/ex2_19_main.cpp
@@ -0,0 +1,41 @@
+//Exercise 2.19
+//ex2_19-main.cpp
+
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    int a,b,c;
+    cout << "Input three different integers: ";
+    cin >> a >> b >> c;
+    cout << "Sum is "<< a+b+c <<endl;
+    cout << "Average is "<< (a+b+c)/3 <<endl;
+    cout << "Product is "<< a*b*c <<endl;
+
+    if (a<=b){
+        if (a<=c)
+            cout<<"Smallest is "<<a<<endl;
+        if (a>c)
+            cout<<"Smallest is "<<c<<endl;
+    }
+    if (a>b){
+        if (b<=c)
+            cout<<"Smallest is "<<b<<endl;
+        if (b>c)
+            cout<<"Smallest is "<<c<<endl;
+    }
+
+    if (a>=b){
+        if (a>=c)
+            cout<<"Largest is "<<a<<endl;
+        if (a<c)
+            cout<<"Largest is "<<c<<endl;
+    }
+    if (a<b){
+        if (b>=c)
+            cout<<"Largest is "<<b<<endl;
+        if (b<c)
+            cout<<"Largest is "<<c<<endl;
+    }
+}
diff --git a/Suriya/Assignment1/ex2_24_main.cpp b/Suriya/Assignment1/ex2_24_main.cpp
new file mode 100644
index 0000000..2904891
--- /dev/null
+++ b/Suriya/Assignment1/ex2_24_main.cpp
@@ -0,0 +1,16 @@
+//Exercise 2.24
+//ex2_24-main.cpp
+
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    int a;
+    cout << "Enter an integer: ";
+    cin >> a;
+    if (a%2 == 0)
+        cout << a <<" is even"<<endl;
+    if (a%2 != 0)
+        cout << a <<" is odd"<<endl;
+}
diff --git a/Suriya/Assignment1/ex2_25_main.cpp b/Suriya/Assignment1/ex2_25_main.cpp
new file mode 100644
index 0000000..c4c515f
--- /dev/null
+++ b/Suriya/Assignment1/ex2_25_main.cpp
@@ -0,0 +1,16 @@
+//Exercise 2.25
+//ex2_25-main.cpp
+
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    int a, b;
+    cout << "Enter two integers: ";
+    cin >> a >> b;
+    if (a%b == 0)
+        cout << a <<" is a multiple of "<< b <<endl;
+    if (a%b != 0)
+        cout << a <<" is not a multiple of "<< b <<endl;
+}
diff --git a/Suriya/Assignment1/ex2_28_main.cpp b/Suriya/Assignment1/ex2_28_main.cpp
new file mode 100644
index 0000000..3bdfe4a
--- /dev/null
+++ b/Suriya/Assignment1/ex2_28_main.cpp
@@ -0,0 +1,17 @@
+//Exercise 2.28
+//ex2_28-main.cpp
+
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    int a;
+    cout << "Enter a five-digit integer: ";
+    cin >> a;
+    if (a/10000 > 0)
+        cout<<a/10000<<"   "<<(a%10000)/1000<<"   "<<(a%1000)/100<<"   "<<(a%100)/10<<"   "<<(a%10)<<endl;
+    if (a/10000 <= 0)
+        cout<<"Input error. Enter a five-digit integer"<<endl;
+    return 0;
+}
diff --git a/Suriya/Assignment1/ex3_11_main_GradeBook.cpp b/Suriya/Assignment1/ex3_11_main_GradeBook.cpp
new file mode 100644
index 0000000..e8dfb87
--- /dev/null
+++ b/Suriya/Assignment1/ex3_11_main_GradeBook.cpp
@@ -0,0 +1,17 @@
+//Exercise 3.11 - Main File
+//ex3_11-main.cpp
+
+#include <iostream>
+#include "GradeBook.h"
+
+using namespace std;
+
+int main()
+{
+    GradeBook gradeBook1( "M E 666 Finite Element Methods", "James Rossmanith" );
+    GradeBook gradeBook2( "M E 546 Computational Fluid Dynamics I", "Paul Durbin" );
+    cout << "gradeBook1 created for course: " << gradeBook1.getCourseName()
+        <<"\ngradeBook2 created for course: " << gradeBook2.getCourseName()<< "\n"<<endl;
+    gradeBook1.displayMessage();
+    gradeBook2.displayMessage();
+}
diff --git a/Suriya/Assignment1/ex3_12_main_Account.cpp b/Suriya/Assignment1/ex3_12_main_Account.cpp
new file mode 100644
index 0000000..9287768
--- /dev/null
+++ b/Suriya/Assignment1/ex3_12_main_Account.cpp
@@ -0,0 +1,18 @@
+//Exercise 3.12 - Main File
+//ex3_12-main.cpp
+
+#include <iostream>
+#include "Account.h"
+
+using namespace std;
+
+int main() {
+    Account account1(1750), account2(-20);
+    cout << "Account1 created with balance:" << account1.getBalance()
+         <<"\nAccount2 created with balance: " << account2.getBalance()<< "\n"<<endl;
+    account2.credit(30);
+    cout << "Amount credited successfully. Account2 current balance: " << account2.getBalance()<<endl;
+    account1.debit(67);
+    cout << "Amount debited successfully. Account1 current balance: " << account1.getBalance()<<endl;
+    account2.debit(100);
+}
diff --git a/Suriya/Assignment1/ex3_13_main_Invoice.cpp b/Suriya/Assignment1/ex3_13_main_Invoice.cpp
new file mode 100644
index 0000000..409334f
--- /dev/null
+++ b/Suriya/Assignment1/ex3_13_main_Invoice.cpp
@@ -0,0 +1,20 @@
+//Exercise 3.13 - Main File
+//ex3_13-main.cpp
+
+#include <iostream>
+#include "Invoice.h"
+
+using namespace std;
+
+int main() {
+    Invoice invoice1("17m150","Flash Drive",3,40), invoice2("17m151","Thermometer",-6,15);
+    cout << "Invoice created for product id: " << invoice1.getPartNumber()
+         <<"\nInvoice created for product id: " << invoice2.getPartNumber()<< "\n"<<endl;
+    invoice2.setQuant(6);
+    cout<<"New quantity set for product id: "<< invoice2.getPartNumber()<< "\n"<<endl;
+    invoice1.setPrice(-41);
+    invoice1.setPrice(41);
+    cout<<"New price set for product id: "<< invoice1.getPartNumber()<< "\n"<<endl;
+    cout<<"Invoice amount for "<<invoice1.getPartDescript()<<": $ "<<invoice1.getInvoiceAmount()<<endl;
+    cout<<"Invoice amount for "<<invoice2.getPartDescript()<<": $ "<<invoice2.getInvoiceAmount()<<endl;
+}
diff --git a/Suriya/Assignment1/ex3_14_main_Employee.cpp b/Suriya/Assignment1/ex3_14_main_Employee.cpp
new file mode 100644
index 0000000..230ee44
--- /dev/null
+++ b/Suriya/Assignment1/ex3_14_main_Employee.cpp
@@ -0,0 +1,22 @@
+//Exercise 3.14 - Main File
+//ex3_14-main.cpp
+
+
+#include <iostream>
+#include "Employee.h"
+using namespace std;
+
+int main() {
+    Employee employee1("Sheldon","Cooper",72000), employee2("Leonard","Hofstader",-70000);
+    cout << "Employee record created for: " << employee1.getEmployeeName()
+         <<"\nEmployee record created for: " << employee2.getEmployeeName()<< "\n"<<endl;
+    employee2.setSalary(70000);
+    cout << "New salary set for employee 2.\n"<<endl;
+    employee1.displayAnnualSalary();
+    employee2.displayAnnualSalary();
+    cout<<"\nProgram initiated for 10% increment in salary\n"<<endl;
+    employee1.setSalary(1.1*employee1.getEmployeeSalary());
+    employee2.setSalary(1.1*employee1.getEmployeeSalary());
+    employee1.displayAnnualSalary();
+    employee2.displayAnnualSalary();
+}
diff --git a/Suriya/Assignment1/ex3_15_main_Date.cpp b/Suriya/Assignment1/ex3_15_main_Date.cpp
new file mode 100644
index 0000000..dfc2ce9
--- /dev/null
+++ b/Suriya/Assignment1/ex3_15_main_Date.cpp
@@ -0,0 +1,18 @@
+//Exercise 3.15 - Main File
+//ex3_15-main.cpp
+
+#include <iostream>
+#include "Date.h"
+using namespace std;
+
+int main(){
+    Date date1(13,14,2020), date2(10,21,1999);
+    cout<<"Date record created for date1\n"
+        <<"Date record created for date2"<<endl;
+    date1.displayDate();
+    date2.displayDate();
+    date1.setMonth(3);
+    cout<<"\nNew month set for date1.\n"<<endl;
+    date1.displayDate();
+    date2.displayDate();
+}
diff --git a/Suriya/Assignment1/ex3_5to3_10.pdf b/Suriya/Assignment1/ex3_5to3_10.pdf
new file mode 100755
index 0000000..285ece6
Binary files /dev/null and b/Suriya/Assignment1/ex3_5to3_10.pdf differ
diff --git a/Suriya/Assignment1/ex4_13_main.cpp b/Suriya/Assignment1/ex4_13_main.cpp
new file mode 100644
index 0000000..25286c6
--- /dev/null
+++ b/Suriya/Assignment1/ex4_13_main.cpp
@@ -0,0 +1,27 @@
+//Exercise 4.13
+
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    int miles=0, gallons=1;
+    int totmiles=0, totgallons=0;
+    cout<<"Enter miles driven (-1 to quit): ";
+    cin>>miles;
+    while (miles!=-1){
+        cout<<"Enter gallons used: ";
+        cin>>gallons;
+        if (gallons>0){
+            totmiles+=miles;
+            totgallons+=gallons;
+            cout<<"MPG this trip: "<<static_cast<double>(miles)/gallons;
+            cout<<"\nTotal MPG: "<<static_cast<double>(totmiles)/totgallons<<endl;
+        }
+        else
+            cout<<"\nInvalid input.";
+        cout<<"\nEnter miles driven (-1 to quit): ";
+        cin>>miles;
+    }
+    cout<<"\nEnd of program"<<endl;
+}
diff --git a/Suriya/Assignment1/ex4_26_main.cpp b/Suriya/Assignment1/ex4_26_main.cpp
new file mode 100644
index 0000000..eb08e5a
--- /dev/null
+++ b/Suriya/Assignment1/ex4_26_main.cpp
@@ -0,0 +1,21 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    int a;
+    cout<<"Enter a five digit number: ";
+    cin>>a;
+    if (a/10000>0) {
+        if ((a / 10000) == (a % 10)) {
+            if (((a / 1000) % 10) == ((a % 100) / 10))
+                cout << "It's a Palindrome!" << endl;
+            else
+                cout << "It's not a Palindrome!" << endl;
+        }
+        else
+            cout << "It's not a Palindrome!" << endl;
+    }
+    else
+        cout<<"Invalid input"<<endl;
+}
diff --git a/Suriya/Assignment1/ex4_27_main.cpp b/Suriya/Assignment1/ex4_27_main.cpp
new file mode 100644
index 0000000..e746bd4
--- /dev/null
+++ b/Suriya/Assignment1/ex4_27_main.cpp
@@ -0,0 +1,27 @@
+//Exercise 2.17
+
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    int binary, powertwo=1;
+    int a, decimal = 0, breaker=1;
+    cout<<"Enter a binary number: ";
+    cin>>binary;
+    while (binary!=0 && breaker!=0){
+        a = binary%10;
+        if (a==0 || a==1){
+            decimal = decimal + (a*powertwo);
+            powertwo = 2 * powertwo;
+            binary = binary/10;
+        }
+        else {
+            breaker = 0;
+        }
+    }
+    if (breaker==1)
+        cout<<"Decimal equivalent: "<<decimal;
+    else
+        cout<<"Invalid binary input";
+}
diff --git a/Suriya/Assignment1/ex4_34_main.cpp b/Suriya/Assignment1/ex4_34_main.cpp
new file mode 100644
index 0000000..0106cad
--- /dev/null
+++ b/Suriya/Assignment1/ex4_34_main.cpp
@@ -0,0 +1,57 @@
+#include <iostream>
+using namespace std;
+
+int main(){
+
+    //part(a)
+    int number,i=1, product=1;
+    cout<<"Part (a): Enter an integer calculating its factorial: ";
+    cin>>number;
+    if (number==0)
+        cout<<"Factorial of "<<number<<" is "<<product<<endl;
+    else if (number<0)
+        cout<<"Invalid number. Type a non-negative integer."<<endl;
+    else{
+        while(i<=number){
+            product=product*i;
+            i++;
+        }
+        cout<<"Factorial of "<<number<<" is "<<product<<endl;
+    }
+
+    //part(b)
+    i=1, product=1;
+    double sum=1.0;
+    cout<<"\nPart (b): Enter the number of terms (in the summation) for the estimation of e: ";
+    cin>>number;
+    if (number<=0)
+        cout<<"Invalid input."<<endl;
+    else{
+        while(i<=(number-1)){
+            product=product*i;
+            sum=sum+1.0/product;
+            i++;
+        }
+        cout<<"The value of e approximated to "<<number<<" terms:"<<sum<<endl;
+    }
+
+    //Part(c)
+    i=1, product=1;
+    sum = 1.0;
+    double power = 1.0, x=0.0;
+    cout<<"\nPart (c): Enter the number to calculate exponential: ";
+    cin>>x;
+    cout<<"Enter the number of terms (in the summation) for the estimation of its exponential: ";
+    cin>>number;
+    if (number<=0)
+        cout<<"Invalid input."<<endl;
+    else{
+        while(i<=(number-1)){
+            product=product*i;
+            power = power*x;
+            sum=sum+power/product;
+            i++;
+        }
+        cout<<"The value of exponential of "<<x<<" approximated to "<<number<<" terms: "<<sum<<endl;
+    }
+}
\ No newline at end of file
diff --git a/Suriya/Assignment1/ex4_35_decrypt_main.cpp b/Suriya/Assignment1/ex4_35_decrypt_main.cpp
new file mode 100644
index 0000000..5621796
--- /dev/null
+++ b/Suriya/Assignment1/ex4_35_decrypt_main.cpp
@@ -0,0 +1,22 @@
+//Exercise 4.35 - Decrypter
+
+#include<iostream>
+using namespace std;
+
+int main(){
+    int number;
+    int a, b, c, d, temp;
+    cout<<"Enter the integer to decrypt: ";
+    cin>>number;
+    a = ((number/1000) + 3) - (((number/1000) + 3)/10)*10;
+    b = ((number%1000)/100 + 3) - (((number%1000)/100 + 3)/10)*10;
+    c = ((number%100)/10 + 3) - (((number%100)/10 + 3)/10)*10;
+    d = ((number%10) + 3) - (((number%10) + 3)/10)*10;
+    temp = a;
+    a = c;
+    c = temp;
+    temp = b;
+    b = d;
+    d = temp;
+    cout<<"decrypted data: "<<a*1000+b*100+c*10+d<<endl;
+}
\ No newline at end of file
diff --git a/Suriya/Assignment1/ex4_35_encrypt_main.cpp b/Suriya/Assignment1/ex4_35_encrypt_main.cpp
new file mode 100644
index 0000000..6247ddf
--- /dev/null
+++ b/Suriya/Assignment1/ex4_35_encrypt_main.cpp
@@ -0,0 +1,22 @@
+//Exercise 4.35 - Encrypter
+
+#include <iostream>
+using namespace std;
+
+int main() {
+      int number;
+      int a, b, c, d, temp;
+      cout<<"Enter a four digit integer to encrypt: ";
+      cin>>number;
+      a = ((number/1000) + 7) - (((number/1000) + 7)/10)*10;
+      b = ((number%1000)/100 + 7) - (((number%1000)/100 + 7)/10)*10;
+      c = ((number%100)/10 + 7) - (((number%100)/10 + 7)/10)*10;
+      d = ((number%10) + 7) - (((number%10) + 7)/10)*10;
+      temp = a;
+      a = c;
+      c = temp;
+      temp = b;
+      b = d;
+      d = temp;
+      cout<<"Encrypted data: "<< a*1000+b*100+c*10+d<<endl;
+}
diff --git a/Suriya/Assignment2/CMakeLists.txt b/Suriya/Assignment2/CMakeLists.txt
new file mode 100644
index 0000000..372bb47
--- /dev/null
+++ b/Suriya/Assignment2/CMakeLists.txt
@@ -0,0 +1,9 @@
+cmake_minimum_required(VERSION 3.23)
+project(Assignment2)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(ex5_19 ex5_19.cpp)
+add_executable(ex5_20 ex5_20.cpp)
+add_executable(ex5_22 ex5_22.cpp)
+add_executable(ex5_25 ex5_25.cpp)
diff --git a/Suriya/Assignment2/ex5_19.cpp b/Suriya/Assignment2/ex5_19.cpp
new file mode 100644
index 0000000..ac6f73b
--- /dev/null
+++ b/Suriya/Assignment2/ex5_19.cpp
@@ -0,0 +1,21 @@
+//Exercise 4.19
+
+#include <iostream>
+#include <iomanip>
+#include <cmath>
+
+using namespace std;
+
+int main() {
+    double pi = 4;
+    cout<<setw(12)<<"No.of terms"<<setw(20)<<"Pi's value"<<endl;
+    cout<<fixed<<setprecision(10);
+    for(int i=1; i<=20000; i++){
+        pi = pi + pow(-1,i)*4.0/(2*i+1);
+        if (i%1000==0 && i>=1000){
+            cout<<right<<setw(12)<<i;
+            cout<<right<<setw(20)<<pi<<endl;
+        }
+    }
+    return 0;
+}
diff --git a/Suriya/Assignment2/ex5_20.cpp b/Suriya/Assignment2/ex5_20.cpp
new file mode 100644
index 0000000..9644bdc
--- /dev/null
+++ b/Suriya/Assignment2/ex5_20.cpp
@@ -0,0 +1,22 @@
+//Exercise 4.20
+
+#include<iostream>
+#include<iomanip>
+
+using namespace std;
+
+int main(){
+    cout<<" Pythagorean Triplets "<<endl;
+    int l=1;
+    for (int i=1; i<=500; i++){
+        for (int j=i; j<=500; j++) {
+            for (int k=i; k<=500; k++){
+                if ((i*i+j*j)==k*k) {
+                    cout << setw(5) << i << setw(5) << j << setw(5) << k << endl;
+                }
+            }
+        }
+    }
+
+}
+
diff --git a/Suriya/Assignment2/ex5_22.cpp b/Suriya/Assignment2/ex5_22.cpp
new file mode 100644
index 0000000..e8c5975
--- /dev/null
+++ b/Suriya/Assignment2/ex5_22.cpp
@@ -0,0 +1,126 @@
+//Exercise 4.22
+
+#include<iostream>
+#include<iomanip>
+
+using namespace std;
+
+int main(){
+    //part(a)
+    cout<<right<<setw(5)<<"x"<<setw(5)<<"y"<<setw(10)<<"(x<5)"<<setw(10)<<"(y>=5)"
+        <<setw(20)<<"!(x<5)&&!(y>=5)"<<setw(20)<<"!((x<5)||(y>=5))"<<endl;
+
+    //creates a line
+    for(int i=1; i<=70; i++){
+        cout<<"_";
+        if(i==70)
+            cout<<endl;
+    }
+
+    int x = 6, y = 4;
+    cout<<right<<setw(5)<<x<<setw(5)<<y<<setw(10)<<static_cast<bool>(x<5)<<setw(10)<<static_cast<bool>
+        (y>=5)<<setw(20)<<static_cast<bool>(!(x<5)&&!(y>=5))<<setw(20)<<static_cast<bool>(!((x<5)||(y>=5)))
+        <<endl;
+    x = 4, y = 4;
+    cout<<right<<setw(5)<<x<<setw(5)<<y<<setw(10)<<static_cast<bool>(x<5)<<setw(10)<<static_cast<bool>
+    (y>=5)<<setw(20)<<static_cast<bool>(!(x<5)&&!(y>=5))<<setw(20)<<static_cast<bool>(!((x<5)||(y>=5)))
+        <<endl;
+    x = 6, y = 5;
+    cout<<right<<setw(5)<<x<<setw(5)<<y<<setw(10)<<static_cast<bool>(x<5)<<setw(10)<<static_cast<bool>
+    (y>=5)<<setw(20)<<static_cast<bool>(!(x<5)&&!(y>=5))<<setw(20)<<static_cast<bool>(!((x<5)||(y>=5)))
+        <<endl;
+    x = 4, y = 5;
+    cout<<right<<setw(5)<<x<<setw(5)<<y<<setw(10)<<static_cast<bool>(x<5)<<setw(10)<<static_cast<bool>
+    (y>=5)<<setw(20)<<static_cast<bool>(!(x<5)&&!(y>=5))<<setw(20)<<static_cast<bool>(!((x<5)||(y>=5)))
+        <<endl;
+    cout<<"They are equivalent!\n"<<endl;
+
+    //*************//
+    //part(b)
+    cout<<right<<setw(5)<<"a, b"<<setw(5)<<"g"<<setw(10)<<"(a==b)"<<setw(10)<<"(g!=5)"
+        <<setw(20)<<"!(a==b)||!(g!=5)"<<setw(20)<<"!((a==b)&&(g!=5))"<<endl;
+    //creates a line
+    for(int i=1; i<=70; i++){
+        cout<<"_";
+        if(i==70)
+            cout<<endl;
+    }
+
+    int a=1, b=2, g=5;
+    cout<<right<<setw(2)<<a<<","<<setw(2)<<b<<setw(5)<<g<<setw(10)<<static_cast<bool>(a==b)<<setw(10)
+        <<static_cast<bool>(g!=5)<<setw(20)<<static_cast<bool>(!(a==b)||!(g!=5))<<setw(20)<<static_cast<bool>
+        (!((a==b)&&(g!=5)))<<endl;
+    a=1, b=1, g=5;
+    cout<<right<<setw(2)<<a<<","<<setw(2)<<b<<setw(5)<<g<<setw(10)<<static_cast<bool>(a==b)<<setw(10)
+        <<static_cast<bool>(g!=5)<<setw(20)<<static_cast<bool>(!(a==b)||!(g!=5))<<setw(20)<<static_cast<bool>
+        (!((a==b)&&(g!=5)))<<endl;
+    a=2, b=1, g=6;
+    cout<<right<<setw(2)<<a<<","<<setw(2)<<b<<setw(5)<<g<<setw(10)<<static_cast<bool>(a==b)<<setw(10)
+        <<static_cast<bool>(g!=5)<<setw(20)<<static_cast<bool>(!(a==b)||!(g!=5))<<setw(20)<<static_cast<bool>
+        (!((a==b)&&(g!=5)))<<endl;
+    a=2, b=2, g=6;
+    cout<<right<<setw(2)<<a<<","<<setw(2)<<b<<setw(5)<<g<<setw(10)<<static_cast<bool>(a==b)<<setw(10)
+        <<static_cast<bool>(g!=5)<<setw(20)<<static_cast<bool>(!(a==b)||!(g!=5))<<setw(20)<<static_cast<bool>
+        (!((a==b)&&(g!=5)))<<endl;
+    cout<<"They are equivalent!\n"<<endl;
+
+    //*************//
+    //part(c)
+    cout<<right<<setw(5)<<"x"<<setw(5)<<"y"<<setw(10)<<"(x<=8)"<<setw(10)<<"(y>4)"
+        <<setw(20)<<"!((x<=8)&&(y>4))"<<setw(20)<<"!(x<=8)||!(y>4))"<<endl;
+
+    //creates a line
+    for(int i=1; i<=70; i++) {
+        cout << "_";
+        if (i == 70)
+            cout << endl;
+    }
+
+    x = 10, y = 2;
+    cout<<right<<setw(5)<<x<<setw(5)<<y<<setw(10)<<static_cast<bool>(x<=8)<<setw(10)<<static_cast<bool>
+        (y>4)<<setw(20)<<static_cast<bool>(!((x<=8)&&(y>4)))<<setw(20)<<static_cast<bool>(!(x<=8)||!(y>4))
+        <<endl;
+    x = 7, y = 2;
+    cout<<right<<setw(5)<<x<<setw(5)<<y<<setw(10)<<static_cast<bool>(x<=8)<<setw(10)<<static_cast<bool>
+    (y>4)<<setw(20)<<static_cast<bool>(!((x<=8)&&(y>4)))<<setw(20)<<static_cast<bool>(!(x<=8)||!(y>4))
+        <<endl;
+    x = 10, y = 6;
+    cout<<right<<setw(5)<<x<<setw(5)<<y<<setw(10)<<static_cast<bool>(x<=8)<<setw(10)<<static_cast<bool>
+    (y>4)<<setw(20)<<static_cast<bool>(!((x<=8)&&(y>4)))<<setw(20)<<static_cast<bool>(!(x<=8)||!(y>4))
+        <<endl;
+    x = 8, y = 6;
+    cout<<right<<setw(5)<<x<<setw(5)<<y<<setw(10)<<static_cast<bool>(x<=8)<<setw(10)<<static_cast<bool>
+    (y>4)<<setw(20)<<static_cast<bool>(!((x<=8)&&(y>4)))<<setw(20)<<static_cast<bool>(!(x<=8)||!(y>4))
+        <<endl;
+    cout<<"They are equivalent!\n"<<endl;
+
+    //*************//
+    //part(d)
+    cout<<right<<setw(5)<<"i"<<setw(5)<<"j"<<setw(10)<<"(i>4)"<<setw(10)<<"(j<=6)"
+        <<setw(20)<<"!((i>4)||(j<=6))"<<setw(20)<<"!(i>4)&&!(j<=6)"<<endl;
+
+    //creates a line
+    for(int i=1; i<=70; i++) {
+        cout << "_";
+        if (i == 70)
+            cout << endl;
+    }
+
+    int i=3, j=7;
+    cout<<right<<setw(5)<<i<<setw(5)<<j<<setw(10)<<static_cast<bool>(i>4)<<setw(10)<<static_cast<bool>
+        (j<=6)<<setw(20)<<static_cast<bool>(!((i>4)||(j<=6)))<<setw(20)<<static_cast<bool>(!(i>4)&&!(j<=6))
+        <<endl;
+    i=5, j=7;
+    cout<<right<<setw(5)<<i<<setw(5)<<j<<setw(10)<<static_cast<bool>(i>4)<<setw(10)<<static_cast
+            <bool>(j<=6)<<setw(20)<<static_cast<bool>(!((i>4)||(j<=6)))<<setw(20)<<static_cast<bool>
+        (!(i>4)&&!(j<=6))<<endl;
+    i=3, j=5;
+    cout<<right<<setw(5)<<i<<setw(5)<<j<<setw(10)<<static_cast<bool>(i>4)<<setw(10)<<static_cast
+            <bool>(j<=6)<<setw(20)<<static_cast<bool>(!((i>4)||(j<=6)))<<setw(20)<<static_cast<bool>
+        (!(i>4)&&!(j<=6))<<endl;
+    i=5, j=5;
+    cout<<right<<setw(5)<<i<<setw(5)<<j<<setw(10)<<static_cast<bool>(i>4)<<setw(10)<<static_cast
+            <bool>(j<=6)<<setw(20)<<static_cast<bool>(!((i>4)||(j<=6)))<<setw(20)<<static_cast<bool>
+        (!(i>4)&&!(j<=6))<<endl;
+    cout<<"They are equivalent!\n"<<endl;
+}
diff --git a/Suriya/Assignment2/ex5_25.cpp b/Suriya/Assignment2/ex5_25.cpp
new file mode 100644
index 0000000..85ed1b9
--- /dev/null
+++ b/Suriya/Assignment2/ex5_25.cpp
@@ -0,0 +1,15 @@
+//Exercise 4.25
+
+#include <iostream>
+using namespace std;
+
+int main(){
+    int count;
+    int i=1;
+    for ( count = 1; count <= 10 && i!=0; ++count ) {
+        cout << count << " ";
+        if ( count+1 == 5 ) //calculates for the succeeding group
+            i=0;
+    }
+    cout << "\nBroke out of loop at count = " << count << endl;
+}
\ No newline at end of file
diff --git a/Suriya/Assignment3/CMakeLists.txt b/Suriya/Assignment3/CMakeLists.txt
new file mode 100644
index 0000000..87ebcbe
--- /dev/null
+++ b/Suriya/Assignment3/CMakeLists.txt
@@ -0,0 +1,19 @@
+cmake_minimum_required(VERSION 3.23)
+project(Assignment3)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(ex6_16 ex6_16.cpp)
+add_executable(ex6_17 ex6_17.cpp)
+add_executable(ex6_18 ex6_18.cpp)
+add_executable(ex6_26 ex6_26.cpp)
+add_executable(ex6_28 ex6_28.cpp)
+add_executable(ex6_29 ex6_29.cpp)
+add_executable(ex6_31 ex6_31.cpp)
+add_executable(ex6_36 ex6_36.cpp)
+add_executable(ex6_37 ex6_37.cpp)
+add_executable(ex6_38 ex6_38.cpp)
+add_executable(ex6_39 ex6_39.cpp)
+add_executable(ex6_41 ex6_41.cpp)
+add_executable(ex6_42 ex6_42.cpp)
+add_executable(ex6_50 ex6_50.cpp)
\ No newline at end of file
diff --git a/Suriya/Assignment3/ex6_16.cpp b/Suriya/Assignment3/ex6_16.cpp
new file mode 100644
index 0000000..08df9b6
--- /dev/null
+++ b/Suriya/Assignment3/ex6_16.cpp
@@ -0,0 +1,23 @@
+//Exercise 6.16
+
+#include <iostream>
+#include <cstdlib>
+
+using namespace std;
+
+int main() {
+    int n;
+    srand(time(0));
+    n =  1 + rand()%2;
+    cout<<"Random generation of either 1 or 2: "<< n << endl;
+    n = 1 + rand()%100;
+    cout<<"Random integer generated from 1 to 100: "<< n <<endl;
+    n = rand()%10;
+    cout<<"Random integer generated from 0 to 9: "<< n <<endl;
+    n = 1000 + rand()%113;
+    cout<<"Random integer generated from 1000 to 1112: "<< n <<endl;
+    n = -1 + rand()%3;
+    cout<<"Random integer generated from -1 to 1: "<< n <<endl;
+    n = -3 + rand()%15;
+    cout<<"Random integer generated from -3 to 11: "<< n <<endl;
+}
diff --git a/Suriya/Assignment3/ex6_17.cpp b/Suriya/Assignment3/ex6_17.cpp
new file mode 100644
index 0000000..b419da5
--- /dev/null
+++ b/Suriya/Assignment3/ex6_17.cpp
@@ -0,0 +1,12 @@
+//Exercise 6.17
+#include<iostream>
+#include<cstdlib>
+
+using namespace std;
+
+int main(){
+    srand(time(0));
+    cout<<"Random number generated from {2, 4, 6, 8, 10} = "<< 2 * (1 + rand()%5) << endl;
+    cout<<"Random number generated from {3, 5, 7, 9, 11} = "<< 2 * (1 + rand()%5) + 1 << endl;
+    cout<<"Random number generated from {6, 10, 14, 18, 22} = "<< 4 * (1 + rand()%5) + 2 << endl;
+}
\ No newline at end of file
diff --git a/Suriya/Assignment3/ex6_18.cpp b/Suriya/Assignment3/ex6_18.cpp
new file mode 100644
index 0000000..dbe7ae9
--- /dev/null
+++ b/Suriya/Assignment3/ex6_18.cpp
@@ -0,0 +1,18 @@
+//Exercise 6.18
+#include<iostream>
+using namespace std;
+
+int integerPower(int, unsigned int);
+
+int main(){
+    cout<<"The base 3 raised to the power 10 is "<<integerPower(3, 10)<<endl;
+}
+
+int integerPower(int base, unsigned int exponent){
+    if (exponent == 0)
+        return 1;
+    else if (exponent == 1)
+        return base;
+    else
+        return base * integerPower(base, exponent-1);
+}
\ No newline at end of file
diff --git a/Suriya/Assignment3/ex6_26.cpp b/Suriya/Assignment3/ex6_26.cpp
new file mode 100644
index 0000000..657bd89
--- /dev/null
+++ b/Suriya/Assignment3/ex6_26.cpp
@@ -0,0 +1,32 @@
+//Exercise 6.26
+
+#include<iostream>
+#include<iomanip>
+
+using namespace std;
+
+double celsius (int);
+double fahrenheit (int);
+
+int main() {
+    double cel, fah;
+    cout << left << setw(10) << "CELCIUS" << setw(18) << "FAHRENHEIT" << "|| "
+         << setw(12) << "FAHRENHEIT" << setw(12) << "CELCIUS"<<"| "
+         << setw(12) << "FAHRENHEIT" << setw(10) << "CELCIUS"<<endl;
+    cout << fixed;
+    for (int i = 0; i <= 100; i++) {
+        cout << left << setw(10) << i << setw(18) << setprecision(2) << fahrenheit(i)
+             << "|| " << setw(12) << i + 32 << setw(12) << setprecision(2) << celsius(i + 32);
+        if (i<=79)
+             cout << "| " << setw(12) << i + 133<< setw(10) << setprecision(2)<<celsius(i + 133);
+        cout << endl;
+    }
+}
+
+double celsius (int fah){
+    return 5.0/9.0*(fah - 32.0);
+}
+
+double fahrenheit (int cel){
+    return (9.0/5.0*cel+32.0);
+}
\ No newline at end of file
diff --git a/Suriya/Assignment3/ex6_28.cpp b/Suriya/Assignment3/ex6_28.cpp
new file mode 100644
index 0000000..0b52f2c
--- /dev/null
+++ b/Suriya/Assignment3/ex6_28.cpp
@@ -0,0 +1,38 @@
+//Exercise 6.28
+
+#include<iostream>
+using namespace std;
+
+bool isPerfect(int);
+
+int main(){
+    int sum;
+    for(int j=1; j<=1000; j++){
+        if (isPerfect(j)){
+            sum = 0;
+            cout<<"Number: "<<j<<endl;
+            cout<<"Divisors: ";
+            for(int k=1; k<j; k++) {
+                if (j % k == 0) {
+                    cout << k << ",";
+                    sum+=k;
+                }
+            }
+            cout<<endl;
+            cout<<"Sum of the divisors: "<<sum<<"\n"<<endl;
+        }
+    }
+
+}
+
+bool isPerfect(int num){
+    int sum = 0;
+    for(int i=1; i<num; i++){
+        if (num%i == 0)
+            sum+=i;
+    }
+    if (sum==num)
+        return 1;
+    else
+        return 0;
+}
\ No newline at end of file
diff --git a/Suriya/Assignment3/ex6_29.cpp b/Suriya/Assignment3/ex6_29.cpp
new file mode 100644
index 0000000..ee9ce43
--- /dev/null
+++ b/Suriya/Assignment3/ex6_29.cpp
@@ -0,0 +1,34 @@
+//Exercise 6.29
+
+#include<iostream>
+#include<iomanip>
+#include<cmath>
+
+using namespace std;
+
+bool isPrime(int);
+
+int main(){
+    int rowCounter=0;
+    for(int number=1; number<=10000; number++){
+        if(isPrime(number)){
+            cout<<setw(6)<<number;
+            rowCounter++;
+            if (rowCounter%5==0)
+                cout<<endl;
+        }
+    }
+}
+
+bool isPrime(int num){
+    int breaker=1;
+    for(int i=2; i<sqrt(num) && breaker!=0; i++){
+        if(num%i==0){
+            breaker=0;
+        }
+    }
+    if (breaker==1 && num!=1)
+        return 1;
+    else
+        return 0;
+}
\ No newline at end of file
diff --git a/Suriya/Assignment3/ex6_31.cpp b/Suriya/Assignment3/ex6_31.cpp
new file mode 100644
index 0000000..fe995ab
--- /dev/null
+++ b/Suriya/Assignment3/ex6_31.cpp
@@ -0,0 +1,19 @@
+//Exercise 6.31
+
+#include<iostream>
+using namespace std;
+
+int gcd(int, int);
+
+int main(){
+    cout<<"GCD of 11571 and 1767 is : "<<gcd(11571, 1767)<<endl;
+}
+
+int gcd(int x, int y){
+    int gcdxy=1;
+    for(int i=1; i<=x && i<=y; i++){
+        if(x%i==0 && y%i==0)
+            gcdxy=i;
+    }
+    return gcdxy;
+}
\ No newline at end of file
diff --git a/Suriya/Assignment3/ex6_36.cpp b/Suriya/Assignment3/ex6_36.cpp
new file mode 100644
index 0000000..50aed7c
--- /dev/null
+++ b/Suriya/Assignment3/ex6_36.cpp
@@ -0,0 +1,18 @@
+//Exercise 6.36
+
+#include<iostream>
+using namespace std;
+
+double power(int, int);
+
+int main(){
+    cout<<"The base 30 raised to power 3 is "<<power(30,3)<<endl;
+}
+
+double power(int base, int exponent){
+    if(exponent==0)
+        return 1;
+    else
+        return base * power(base, exponent-1);
+}
+
diff --git a/Suriya/Assignment3/ex6_37.cpp b/Suriya/Assignment3/ex6_37.cpp
new file mode 100644
index 0000000..e703a36
--- /dev/null
+++ b/Suriya/Assignment3/ex6_37.cpp
@@ -0,0 +1,52 @@
+//Exercise 6.37
+
+#include<iostream>
+using namespace std;
+
+int fibonacci(int);
+double fibonacci(double);
+
+int main(){
+    int larIntFib, counter;
+    double larDoubFib, counter2;
+
+    for(int i=1; fibonacci(i+1)>fibonacci(i) ; i++){
+        larIntFib = fibonacci(i);
+        counter=i;
+    }
+    cout<<"The largest int number in the Fibonacci series is the "<<counter<<"th term and is "<<larIntFib<<endl;
+
+    for(double j=1; fibonacci(j+1)>fibonacci(j); j++){
+        larDoubFib = fibonacci(j);
+        counter2=j;
+    }
+    cout<<"The largest double number in the Fibonacci series is the "<<counter2<<"th term and is "<<larDoubFib<<endl;
+}
+
+int fibonacci(int num){
+    int sum = 1;
+    for (int i=3; i<=num; i++){
+        sum+=sum;
+    }
+
+    if(num==1)
+        return 0;
+    else if(num==2)
+        return 1;
+    else
+        return sum;
+}
+
+double fibonacci(double num){
+    double sum = 1;
+    for (int i=3; i<=num; i++){
+        sum+=sum;
+    }
+
+    if(num==1)
+        return 0;
+    else if(num==2)
+        return 1;
+    else
+        return sum;
+}
\ No newline at end of file
diff --git a/Suriya/Assignment3/ex6_38.cpp b/Suriya/Assignment3/ex6_38.cpp
new file mode 100644
index 0000000..63bada1
--- /dev/null
+++ b/Suriya/Assignment3/ex6_38.cpp
@@ -0,0 +1,20 @@
+//Exercise 6.38
+
+#include<iostream>
+using namespace std;
+
+void towerOfHanoi(int, int, int, int);
+
+int main(){
+    towerOfHanoi(4,1,3,2);
+}
+
+void towerOfHanoi(int noOfDisks, int initialPeg, int targetPeg, int tempPeg){
+    if (noOfDisks==1)
+        cout<<"Move disk from peg "<< initialPeg <<" to "<< targetPeg << endl;
+    if (noOfDisks>1){
+        towerOfHanoi(noOfDisks-1,initialPeg,tempPeg,targetPeg);
+        cout<<"Move disk from peg "<< initialPeg <<" to "<< targetPeg << endl;
+        towerOfHanoi(noOfDisks-1,tempPeg,targetPeg,initialPeg);
+    }
+}
\ No newline at end of file
diff --git a/Suriya/Assignment3/ex6_39.cpp b/Suriya/Assignment3/ex6_39.cpp
new file mode 100644
index 0000000..1fa12ab
--- /dev/null
+++ b/Suriya/Assignment3/ex6_39.cpp
@@ -0,0 +1,34 @@
+//Exercise 6.39
+
+#include<iostream>
+
+using namespace std;
+
+void towerOfHanoi(int, int, int, int);
+
+int main(){
+    towerOfHanoi(4,1,3,2);
+}
+
+void towerOfHanoi(int noOfDisks, int initialPeg, int targetPeg, int tempPeg){
+    int noOfMoves=0;
+    for (int i=1; i<=noOfDisks; i++){
+        noOfMoves = 2 * noOfMoves + 1;
+    }
+
+    if(noOfDisks%2==0){
+        int interChanger;
+        interChanger=targetPeg;
+        targetPeg=tempPeg;
+        tempPeg=interChanger;
+    }
+
+    for (int j=1; j<=noOfMoves; j++){
+        if(j%3==1)
+            cout<<"Move disk from peg "<<initialPeg<<" to "<<targetPeg<<endl;
+        if(j%3==2)
+            cout<<"Move disk from peg "<<initialPeg<<" to "<<tempPeg<<endl;
+        if(j%3==0)
+            cout<<"Move disk from peg "<<tempPeg<<" to "<<targetPeg<<endl;
+    }
+}
diff --git a/Suriya/Assignment3/ex6_41.cpp b/Suriya/Assignment3/ex6_41.cpp
new file mode 100644
index 0000000..e472122
--- /dev/null
+++ b/Suriya/Assignment3/ex6_41.cpp
@@ -0,0 +1,23 @@
+//Exercise 6.41
+
+#include<iostream>
+using namespace std;
+
+int gcd(int, int);
+
+int main(){
+    cout<<"The gcd of 11571 and 1767 is "<<gcd(11571, 1767)<<endl;
+}
+
+int gcd(int x, int y){
+    int temp;
+    if (y>x){
+        temp = x;
+        x = y;
+        y = temp;
+    }
+    if (y==0)
+        return x;
+    else
+        return gcd(y,x%y);
+}
\ No newline at end of file
diff --git a/Suriya/Assignment3/ex6_42.cpp b/Suriya/Assignment3/ex6_42.cpp
new file mode 100644
index 0000000..18c64b5
--- /dev/null
+++ b/Suriya/Assignment3/ex6_42.cpp
@@ -0,0 +1,15 @@
+//Exercise 6.42
+
+#include<iostream>
+using namespace std;
+
+int main(){
+    static int i=1;
+    i++;
+    if (i<=100) {
+        cout << i << endl;
+        main();
+    }
+    //comment: the static variable 'i' is only initialised once. everytime the function main() is called, the 'i' holds
+    //its value from the previous iteration.
+}
\ No newline at end of file
diff --git a/Suriya/Assignment3/ex6_50.cpp b/Suriya/Assignment3/ex6_50.cpp
new file mode 100644
index 0000000..aef29ae
--- /dev/null
+++ b/Suriya/Assignment3/ex6_50.cpp
@@ -0,0 +1,16 @@
+//Exercise 6.50
+
+#include<iostream>
+#include<iomanip>
+using namespace std;
+
+inline double circleArea(double radius){
+    return 3.14*radius*radius;
+}
+
+int main(){
+    double rad;
+    cout<<"Enter radius: ";
+    cin>>rad;
+    cout<<"Area of the circle: "<<fixed<<setprecision(3)<<circleArea(rad)<<" sq.units."<<endl;
+}
diff --git a/Suriya/Assignment4/CMakeLists.txt b/Suriya/Assignment4/CMakeLists.txt
new file mode 100644
index 0000000..6e832d5
--- /dev/null
+++ b/Suriya/Assignment4/CMakeLists.txt
@@ -0,0 +1,21 @@
+cmake_minimum_required(VERSION 3.23)
+project(Assignment4)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(ex7_11 ex7_11.cpp)
+add_executable(ex7_12 ex7_12.cpp)
+add_executable(ex7_15 ex7_15.cpp)
+add_executable(ex7_18 ex7_18.cpp)
+add_executable(ex7_24b ex7_24b.cpp)
+add_executable(ex7_24c ex7_24c.cpp)
+add_executable(ex7_25a ex7_25a.cpp)
+add_executable(ex7_25b ex7_25b.cpp)
+add_executable(ex7_25c ex7_25c.cpp)
+add_executable(ex7_29 ex7_29.cpp)
+add_executable(ex7_30 ex7_30.cpp)
+add_executable(ex7_31 ex7_31.cpp)
+add_executable(ex7_33 ex7_33.cpp)
+add_executable(ex7_37 ex7_37.cpp)
+add_executable(ex7_40 ex7_40.cpp)
+
diff --git a/Suriya/Assignment4/ex7_11.cpp b/Suriya/Assignment4/ex7_11.cpp
new file mode 100644
index 0000000..7a177b0
--- /dev/null
+++ b/Suriya/Assignment4/ex7_11.cpp
@@ -0,0 +1,36 @@
+//Exercise 7.11
+
+#include <iostream>
+using namespace std;
+
+int main() {
+    const int arraySize = 10;
+    int temp = 0, noOfSwaps=1;
+    int c[arraySize] = {5, 6,3, 4,3,7,8,1,7,8};
+
+    cout<<"Array before bubble sorting algorithm: "<<endl;
+    for (int i=0; i<arraySize; i++){
+        cout<<c[i]<<" ";
+        if (i==(arraySize-1))
+            cout<<endl;
+    }
+
+    while (noOfSwaps!=0){
+        noOfSwaps=0;
+        for (int j=0; j<(arraySize-1); j++){
+            if (c[j] > c[j+1]){
+                temp = c[j];
+                c[j] = c[j+1];
+                c[j+1] = temp;
+                noOfSwaps++;
+            }
+        }
+    }
+
+    cout<<"Array after bubble sorting algorithm: "<<endl;
+    for (int i=0; i<arraySize; i++){
+        cout<<c[i]<<" ";
+        if (i==(arraySize-1))
+            cout<<endl;
+    }
+}
diff --git a/Suriya/Assignment4/ex7_12.cpp b/Suriya/Assignment4/ex7_12.cpp
new file mode 100644
index 0000000..07ba75e
--- /dev/null
+++ b/Suriya/Assignment4/ex7_12.cpp
@@ -0,0 +1,37 @@
+//Exercise 7.12
+
+#include<iostream>
+using namespace std;
+
+int main() {
+    const int arraySize = 10;
+    int temp = 0, noOfSwaps = 1;
+    int c[arraySize] = {5, 6, 3, 4, 3, 7, 8, 1, 7, 8};
+
+    cout << "Array before bubble sorting algorithm: " << endl;
+    for (int i = 0; i < arraySize; i++) {
+        cout << c[i] << " ";
+        if (i == (arraySize - 1))
+            cout << endl;
+    }
+
+    for (int k=0; k<(arraySize-1) && noOfSwaps!=0; k++){
+        noOfSwaps = 0;
+        for (int j=0; j<(arraySize-1-k); j++){
+            if (c[j] > c[j+1]){
+                temp = c[j];
+                c[j] = c[j+1];
+                c[j+1] = temp;
+                noOfSwaps++;
+            }
+        }
+    }
+
+    cout<<"Array after bubble sorting algorithm: "<<endl;
+    for (int i=0; i<arraySize; i++){
+        cout<<c[i]<<" ";
+        if (i==(arraySize-1))
+            cout<<endl;
+    }
+
+}
\ No newline at end of file
diff --git a/Suriya/Assignment4/ex7_15.cpp b/Suriya/Assignment4/ex7_15.cpp
new file mode 100644
index 0000000..3f368dd
--- /dev/null
+++ b/Suriya/Assignment4/ex7_15.cpp
@@ -0,0 +1,35 @@
+//Exercise 7.15
+
+#include<iostream>
+#include<iomanip>
+
+using namespace std;
+
+int main(){
+    const int arraySize=20;
+    int c[arraySize] = {}, checker=0, counter=0;
+    cout<<"Enter 20 integer values between 10 and 100 inclusive: "<<endl;
+
+    for (int i=0; i<arraySize; i++){
+        cin>>checker;
+        counter=0;
+        for (int j=0; j<i-1; j++){
+            if (checker==c[j])
+                counter++;
+        }
+        if(counter==0)
+            c[i]=checker;
+    }
+
+    counter = 0;
+    cout<<"Unique values entered: "<<endl;
+    for (int i=0; i<arraySize; i++){
+        if (c[i]!=0){
+            cout<<setw(5)<<c[i];
+            counter++;
+            if (counter%5==0)
+                cout<<endl;
+        }
+    }
+
+}
\ No newline at end of file
diff --git a/Suriya/Assignment4/ex7_18.cpp b/Suriya/Assignment4/ex7_18.cpp
new file mode 100644
index 0000000..ac79f0c
--- /dev/null
+++ b/Suriya/Assignment4/ex7_18.cpp
@@ -0,0 +1,22 @@
+//Exercise 7.18
+//Answer: The function in this program returns the sum of all the values in the array and the program prints
+// the value.
+
+#include <iostream>
+using namespace std;
+
+int whatIsThis( int [], int ); // function prototype
+
+int main() {
+    const int arraySize = 10;
+    int a[arraySize] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
+    int result = whatIsThis(a, arraySize);
+    cout << "Result is " << result << endl;
+}
+
+int whatIsThis( int b[], int size ){
+    if ( size == 1 )
+        return b[ 0 ];
+    else
+        return b[ size - 1 ]+whatIsThis( b, size - 1 );
+}
diff --git a/Suriya/Assignment4/ex7_24b.cpp b/Suriya/Assignment4/ex7_24b.cpp
new file mode 100644
index 0000000..9e004f7
--- /dev/null
+++ b/Suriya/Assignment4/ex7_24b.cpp
@@ -0,0 +1,47 @@
+//Exercise 7.24(b)
+
+#include<iostream>
+#include<iomanip>
+using namespace std;
+
+int main(){
+    int chess[8][8] = {};
+    int horizontal[8] = {2, 1, -1, -2, -2, -1, 1, 2};
+    int vertical[8] = {-1, -2, -2, -1, 1, 2, 2, 1};
+    int currentRow=3, currentColumn=3;
+    int expRow=0, expColumn=0;
+    int breaker=1, breaker1=1;
+    int noOfMoves=0;
+
+    for (int i=1; i<=64 && breaker1!=0; i++){
+        breaker1=0;
+        breaker=0;
+        for (int moveNumber=0; moveNumber<8 && breaker==0; moveNumber++){
+            expRow = currentRow+vertical[moveNumber];
+            expColumn = currentColumn+horizontal[moveNumber];
+            if(expRow>7 || expRow<0 || expColumn>7 || expColumn<0 || chess[expRow][expColumn]!=0)
+                continue;
+            else {
+                currentRow = expRow;
+                currentColumn = expColumn;
+                breaker = 1;
+                breaker1++;
+            }
+        }
+
+        if(breaker1==0)
+            break;
+
+        chess[currentRow][currentColumn] = i;
+        noOfMoves = i;
+    }
+
+    for (int i=0; i<8; i++){
+        for (int j=0; j<8; j++){
+            cout<<setw(5)<<chess[i][j];
+        }
+        cout<<endl;
+    }
+
+    cout<<"\nNo of moves: "<<noOfMoves;
+}
diff --git a/Suriya/Assignment4/ex7_24c.cpp b/Suriya/Assignment4/ex7_24c.cpp
new file mode 100644
index 0000000..cf90c01
--- /dev/null
+++ b/Suriya/Assignment4/ex7_24c.cpp
@@ -0,0 +1,62 @@
+//Exercise 7.24(c)
+
+#include<iostream>
+#include<iomanip>
+using namespace std;
+
+int main(){
+    int chess[8][8] = {};
+    int horizontal[8] = {2, 1, -1, -2, -2, -1, 1, 2};
+    int vertical[8] = {-1, -2, -2, -1, 1, 2, 2, 1};
+    int currentRow=3, currentColumn=3;
+    int expRow=0, expColumn=0;
+    int finRow=0, finColumn=0;
+    int breaker=1;
+    int accessMin;
+    int noOfMoves=0;
+
+    int accessibility[8][8] = {{2, 3, 4, 4,4, 4, 3, 2 },
+                               {3, 4, 6, 6,6, 6, 4, 3 },
+                               {4, 6, 8, 8,8, 8, 6, 4 },
+                               {4, 6, 8, 8,8, 8, 6, 4 },
+                               {4, 6, 8, 8,8, 8, 6, 4 },
+                               {4, 6, 8, 8,8, 8, 6, 4 },
+                               {3, 4, 6, 6,6, 6, 4, 4 },
+                               {2, 3, 4, 4,4, 4, 3, 4 },
+    };
+
+    chess[currentRow][currentColumn] = 0;
+    for (int i=1; i<=64; i++){
+        breaker=0;
+        accessMin=9;
+        for (int moveNumber=0; moveNumber<8; moveNumber++){
+            expRow = currentRow+vertical[moveNumber];
+            expColumn = currentColumn+horizontal[moveNumber];
+            if(expRow>7 || expRow<0 || expColumn>7 || expColumn<0 || chess[expRow][expColumn]!=0)
+                continue;
+            else if(accessibility[expRow][expColumn]<accessMin) {
+                accessMin = accessibility[expRow][expColumn];
+                finRow = expRow;
+                finColumn = expColumn;
+                breaker = 1;
+            }
+        }
+
+        if(breaker==0)
+            break;
+
+        currentRow = finRow;
+        currentColumn = finColumn;
+        chess[currentRow][currentColumn] = i;
+        noOfMoves = i;
+    }
+
+    for (int i=0; i<8; i++){
+        for (int j=0; j<8; j++){
+            cout<<setw(5)<<chess[i][j];
+        }
+        cout<<endl;
+    }
+
+    cout<<"\nNo of moves: "<<noOfMoves;
+}
diff --git a/Suriya/Assignment4/ex7_25a.cpp b/Suriya/Assignment4/ex7_25a.cpp
new file mode 100644
index 0000000..029380b
--- /dev/null
+++ b/Suriya/Assignment4/ex7_25a.cpp
@@ -0,0 +1,58 @@
+//Exercise 7.25(a)
+
+#include<iostream>
+#include<iomanip>
+#include<cstdlib>
+#include<ctime>
+
+using namespace std;
+
+int main(){
+    srand(time(0));
+    int chess[8][8] = {};
+    int horizontal[8] = {2, 1, -1, -2, -2, -1, 1, 2};
+    int vertical[8] = {-1, -2, -2, -1, 1, 2, 2, 1};
+    int currentRow=3, currentColumn=3;
+    int expRow=0, expColumn=0;
+    int breaker1=1;
+    int noOfMoves=0;
+    int toMove;
+
+    for (int i = 0; i <= 64; i++) {
+        for (int moveNumber = 0; moveNumber < 8; moveNumber++) {
+            expRow = currentRow + vertical[moveNumber];
+            expColumn = currentColumn + horizontal[moveNumber];
+            if (expRow > 7 || expRow < 0 || expColumn > 7 || expColumn < 0 || chess[expRow][expColumn] != 0)
+                continue;
+            else
+                breaker1 = 1;
+        }
+
+        if (breaker1 == 0)
+            break;
+
+        while (breaker1 != 0) {
+            toMove = rand() % 8;
+            expRow = currentRow + vertical[toMove];
+            expColumn = currentColumn + horizontal[toMove];
+            if (expRow > 7 || expRow < 0 || expColumn > 7 || expColumn < 0 || chess[expRow][expColumn] != 0)
+                continue;
+            else {
+                currentRow = expRow;
+                currentColumn = expColumn;
+                chess[currentRow][currentColumn] = i;
+                noOfMoves = i;
+                breaker1 = 0;
+            }
+        }
+    }
+
+    for (int i=0; i<8; i++){
+        for (int j=0; j<8; j++){
+            cout<<setw(5)<<chess[i][j];
+        }
+        cout<<endl;
+    }
+
+    cout<<"\nNo of moves: "<<noOfMoves;
+}
diff --git a/Suriya/Assignment4/ex7_25b.cpp b/Suriya/Assignment4/ex7_25b.cpp
new file mode 100644
index 0000000..aadf252
--- /dev/null
+++ b/Suriya/Assignment4/ex7_25b.cpp
@@ -0,0 +1,67 @@
+//Exercise 7.25(b)
+
+#include<iostream>
+#include<iomanip>
+#include<cstdlib>
+#include<ctime>
+
+using namespace std;
+
+int main(){
+
+    int horizontal[8] = {2, 1, -1, -2, -2, -1, 1, 2};
+    int vertical[8] = {-1, -2, -2, -1, 1, 2, 2, 1};
+    int currentRow=3, currentColumn=3;
+    int expRow=0, expColumn=0;
+    int breaker1=1;
+    int noOfMoves=0;
+    int toMove;
+
+    int tourArray[1000] = {};
+
+    for(int k=0; k<1000; k++) {
+        srand(time(0));
+        int chess[8][8] = {};
+        noOfMoves = 0;
+        for (int i = 0; i <= 64; i++) {
+            for (int moveNumber = 0; moveNumber < 8; moveNumber++) {
+                expRow = currentRow + vertical[moveNumber];
+                expColumn = currentColumn + horizontal[moveNumber];
+                if (expRow > 7 || expRow < 0 || expColumn > 7 || expColumn < 0 || chess[expRow][expColumn] != 0)
+                    continue;
+                else
+                    breaker1 = 1;
+            }
+
+            if (breaker1 == 0)
+                break;
+
+            while (breaker1 != 0) {
+                toMove = rand() % 8;
+                expRow = currentRow + vertical[toMove];
+                expColumn = currentColumn + horizontal[toMove];
+                if (expRow > 7 || expRow < 0 || expColumn > 7 || expColumn < 0 || chess[expRow][expColumn] != 0)
+                    continue;
+                else {
+                    currentRow = expRow;
+                    currentColumn = expColumn;
+                    chess[currentRow][currentColumn] = i;
+                    noOfMoves = i;
+                    breaker1 = 0;
+                }
+            }
+        }
+
+        tourArray[k]=noOfMoves;
+    }
+
+    cout<<"Length of thousand tours: "<<endl;
+    for (int i=0; i<1000; i++){
+        cout<<setw(5)<<tourArray[i];
+        if (i%10==9)
+            cout<<endl;
+    }
+}
+//
+// Created by Suriya Narayanan on 10/14/22.
+//
diff --git a/Suriya/Assignment4/ex7_25c.cpp b/Suriya/Assignment4/ex7_25c.cpp
new file mode 100644
index 0000000..b9f7d3d
--- /dev/null
+++ b/Suriya/Assignment4/ex7_25c.cpp
@@ -0,0 +1,65 @@
+//Exercise 7.25(c)
+
+#include<iostream>
+#include<iomanip>
+#include<cstdlib>
+#include<ctime>
+
+using namespace std;
+
+int main(){
+
+    int horizontal[8] = {2, 1, -1, -2, -2, -1, 1, 2};
+    int vertical[8] = {-1, -2, -2, -1, 1, 2, 2, 1};
+    int currentRow=3, currentColumn=3;
+    int expRow=0, expColumn=0;
+    int breaker1=1;
+    int noOfMoves=0;
+    int counter=0, toMove;
+
+    while(noOfMoves!=64) {
+        srand(time(0));
+        int chess[8][8] = {};
+        noOfMoves = 0;
+        for (int i = 0; i <= 64; i++) {
+            for (int moveNumber = 0; moveNumber < 8; moveNumber++) {
+                expRow = currentRow + vertical[moveNumber];
+                expColumn = currentColumn + horizontal[moveNumber];
+                if (expRow > 7 || expRow < 0 || expColumn > 7 || expColumn < 0 || chess[expRow][expColumn] != 0)
+                    continue;
+                else
+                    breaker1 = 1;
+            }
+
+            if (breaker1 == 0)
+                break;
+
+            while (breaker1 != 0) {
+                toMove = rand() % 8;
+                expRow = currentRow + vertical[toMove];
+                expColumn = currentColumn + horizontal[toMove];
+                if (expRow > 7 || expRow < 0 || expColumn > 7 || expColumn < 0 || chess[expRow][expColumn] != 0)
+                    continue;
+                else {
+                    currentRow = expRow;
+                    currentColumn = expColumn;
+                    chess[currentRow][currentColumn] = i;
+                    noOfMoves = i;
+                    breaker1 = 0;
+                }
+            }
+        }
+        counter++;
+        if (noOfMoves==64){
+            for (int i=0; i<8; i++){
+                for (int j=0; j<8; j++){
+                    cout<<setw(5)<<chess[i][j];
+                }
+                cout<<endl;
+            }
+        }
+    }
+
+    cout<<"\n No of tours till one full tour is completed: "<<counter<<endl;
+}
+
diff --git a/Suriya/Assignment4/ex7_29.cpp b/Suriya/Assignment4/ex7_29.cpp
new file mode 100644
index 0000000..ec41e87
--- /dev/null
+++ b/Suriya/Assignment4/ex7_29.cpp
@@ -0,0 +1,34 @@
+//Exercise 7.29
+
+#include<iostream>
+#include<iomanip>
+
+using namespace std;
+
+int main(){
+    const int sieveSize = 1000;
+    int sieve[sieveSize] = {};
+    for (int i=2; i<sieveSize; i++)
+        sieve[i]=1;
+    for (int j=2; j<sieveSize; j++){
+        if(j==0)
+            continue;
+        else{
+            for(int k=2*j; k<sieveSize; k=k+j)
+                sieve[k]=0;
+        }
+    }
+
+    int printCounter = 0;
+    cout<<"Prime Numbers between 2 and 999"<<endl;
+    for (int l=0; l<sieveSize; l++){
+        if (sieve[l]==0)
+            continue;
+        else {
+            cout<<setw(5)<<l;
+            printCounter++;
+            if (printCounter%10==0)
+                cout<<endl;
+        }
+    }
+}
\ No newline at end of file
diff --git a/Suriya/Assignment4/ex7_30.cpp b/Suriya/Assignment4/ex7_30.cpp
new file mode 100644
index 0000000..c5e9bc7
--- /dev/null
+++ b/Suriya/Assignment4/ex7_30.cpp
@@ -0,0 +1,74 @@
+//Exercise 7.30
+
+#include<iostream>
+#include<cmath>
+
+using namespace std;
+
+void bucketSort(int [], int);
+
+int main(){
+    const int sortSize = 10;
+    int toSort[sortSize] = {94, 3, 76, 35, 100, 1009, 45, 25, 701, 54};
+
+    cout<<"Array before sorting: "<<endl;
+    for (int p=0; p<sortSize; p++)
+        cout<<toSort[p]<<" ";
+    cout<<endl;
+
+    int largestNumber=-1;
+    for (int p=0; p<sortSize; p++){
+        if (toSort[p]>largestNumber)
+            largestNumber=toSort[p];
+    }
+
+    int dummy=largestNumber, noOfDigits = 0;
+    do{
+        noOfDigits++;
+        dummy = dummy/10;
+    }while (dummy!=0);
+
+    for (int i=1; i<=noOfDigits; i++)
+        bucketSort(toSort, sortSize);
+
+    cout<<"Array after sorting: "<<endl;
+    for (int p=0; p<sortSize; p++)
+        cout<<toSort[p]<<" ";
+    cout<<endl;
+
+}
+
+void bucketSort(int toSort[], int sortSize){
+    static int passNumber = 1;
+    const int bucketSize = sortSize;
+    int** bucket = new int*[10];
+    for(int j = 0; j < 10; j++){
+        bucket[j] = new int[bucketSize];
+        for (int k = 0; k<bucketSize; k++)
+            bucket[j][k]=-1;
+    }
+
+    int row, column;
+
+    int modOperator = pow(10,passNumber);
+    int divider = pow(10,passNumber-1);
+
+    for(int i=0; i<bucketSize; i++){
+        column = i;
+        row = toSort[i]%modOperator;
+        row = row/divider;
+        bucket[row][column]=toSort[i];
+    }
+
+    int counter1=-1;
+    for(int l=0; l<10 && counter1<bucketSize; l++){
+        for(int m=0; m<bucketSize && counter1<bucketSize; m++){
+            if(bucket[l][m]!=-1){
+                counter1++;
+                toSort[counter1]=bucket[l][m];
+            }
+        }
+    }
+
+    passNumber++;
+}
\ No newline at end of file
diff --git a/Suriya/Assignment4/ex7_31.cpp b/Suriya/Assignment4/ex7_31.cpp
new file mode 100644
index 0000000..4e8777b
--- /dev/null
+++ b/Suriya/Assignment4/ex7_31.cpp
@@ -0,0 +1,49 @@
+#include<iostream>
+
+using namespace std;
+
+void selectionSort(int [], int);
+
+int main(){
+    const int sortSize = 10;
+    int toSort[sortSize] = {94, 3, 76, 35, 100, 1009, 45, 25, 701, 54};
+
+    cout<<"Array before sorting: "<<endl;
+    for (int p=0; p<sortSize; p++)
+        cout<<toSort[p]<<" ";
+    cout<<endl;
+
+    selectionSort(toSort, sortSize);
+
+    cout<<"Array after sorting: "<<endl;
+    for (int p=0; p<sortSize; p++)
+        cout<<toSort[p]<<" ";
+    cout<<endl;
+}
+
+void selectionSort(int toSort[], int sortSize){
+    if (sortSize==1);
+    else {
+        int smallest = toSort[0], temp, position=0;
+        for (int i=0; i<sortSize; i++){
+            if (toSort[i]<smallest) {
+                smallest = toSort[i];
+                position = i;
+            }
+        }
+
+        temp = toSort[0];
+        toSort[0] = smallest;
+        toSort[position]=temp;
+
+        const int newSize = sortSize-1;
+        int* newArray = new int[newSize];
+        for (int q=0; q<newSize; q++)
+            newArray[q]=toSort[q+1];
+
+        selectionSort(newArray, newSize);
+
+        for (int r=1; r<sortSize; r++)
+            toSort[r]=newArray[r-1];
+    }
+}
\ No newline at end of file
diff --git a/Suriya/Assignment4/ex7_33.cpp b/Suriya/Assignment4/ex7_33.cpp
new file mode 100644
index 0000000..edf63db
--- /dev/null
+++ b/Suriya/Assignment4/ex7_33.cpp
@@ -0,0 +1,40 @@
+//Exercise 7.33
+
+#include <iostream>
+using namespace std;
+
+int linearSearch( const int [], int, int );
+
+int main()
+{
+    const int arraySize = 100;
+    int a[ arraySize ];
+    int searchKey;
+
+    for ( int i = 0; i < arraySize; ++i )
+        a[ i ] = 2 * i; //
+
+    cout << "Enter integer search key: ";
+    cin >> searchKey;
+
+    int element = linearSearch( a, searchKey, arraySize );
+
+    if ( element != -1 )
+        cout << "Found value in element " << element << endl;
+    else
+        cout << "Value not found" << endl;
+}
+
+int linearSearch( const int array[], int key, int sizeOfArray)
+{
+    if (sizeOfArray==0){
+        if (array[sizeOfArray]==key)
+            return 0;
+        else
+            return -1;
+    }
+    if (array[sizeOfArray-1]==key)
+        return sizeOfArray-1;
+    else
+        return linearSearch(array, key, sizeOfArray-1);
+}
\ No newline at end of file
diff --git a/Suriya/Assignment4/ex7_37.cpp b/Suriya/Assignment4/ex7_37.cpp
new file mode 100644
index 0000000..e78f6ee
--- /dev/null
+++ b/Suriya/Assignment4/ex7_37.cpp
@@ -0,0 +1,27 @@
+//Exercise 7.37
+
+#include<iostream>
+using namespace std;
+
+int recursiveMinimum(const int[], int, int);
+
+int main(){
+    const int arraySize = 10;
+    int array[arraySize] = {94, 3, 76, 35, 100, 1009, 45, 1, 701, 54};
+
+    cout<<"The minimum value found in the array: "<<recursiveMinimum(array,0,arraySize-1);
+}
+
+int recursiveMinimum(const int array[], int start, int end){
+    if (start==end){
+        return array[start];
+    }
+
+    else{
+        if(array[start]>=array[end])
+            return recursiveMinimum(array, start+1, end);
+        if(array[start]<array[end])
+            return recursiveMinimum(array, start, end-1);
+    }
+}
+
diff --git a/Suriya/Assignment4/ex7_40.cpp b/Suriya/Assignment4/ex7_40.cpp
new file mode 100644
index 0000000..98597c9
--- /dev/null
+++ b/Suriya/Assignment4/ex7_40.cpp
@@ -0,0 +1,27 @@
+//Exercise 7.40
+
+#include<iostream>
+#include<vector>
+
+using namespace std;
+
+int recursiveMinimum(const vector<int>&, int, int);
+
+int main(){
+    vector <int> array{94, 3, 76, 35, 100, 1009, 45, 1, 701, 54};
+
+    cout<<"The minimum value found in the array: "<<recursiveMinimum(array,0,array.size()-1);
+}
+
+int recursiveMinimum(const vector<int>&array, int start, int end){
+    if (start==end){
+        return array[start];
+    }
+
+    else{
+        if(array[start]>=array[end])
+            return recursiveMinimum(array, start+1, end);
+        if(array[start]<array[end])
+            return recursiveMinimum(array, start, end-1);
+    }
+}
\ No newline at end of file
diff --git a/Suriya/Assignment5/CMakeLists.txt b/Suriya/Assignment5/CMakeLists.txt
new file mode 100644
index 0000000..70ecc75
--- /dev/null
+++ b/Suriya/Assignment5/CMakeLists.txt
@@ -0,0 +1,12 @@
+cmake_minimum_required(VERSION 3.23)
+project(Assignment5)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(ex8_8 ex8_8.cpp)
+add_executable(ex8_10 ex8_10.cpp)
+add_executable(ex8_11 ex8_11.cpp)
+add_executable(ex8_13 ex8_13.cpp)
+add_executable(ex8_14 ex8_14.cpp)
+add_executable(ex8_15 ex8_15.cpp)
+add_executable(ex8_16 ex8_16.cpp)
diff --git a/Suriya/Assignment5/ex8_10.cpp b/Suriya/Assignment5/ex8_10.cpp
new file mode 100644
index 0000000..d1050a1
--- /dev/null
+++ b/Suriya/Assignment5/ex8_10.cpp
@@ -0,0 +1,16 @@
+//Exercise 8.8
+
+void zero(long int []);
+int add1AndSum(int );
+
+int main(){
+
+}
+
+void zero(long int bigIntegers[]){
+
+}
+
+int add1AndSum(int oneTooSmall){
+
+}
diff --git a/Suriya/Assignment5/ex8_11.cpp b/Suriya/Assignment5/ex8_11.cpp
new file mode 100644
index 0000000..f5d657a
--- /dev/null
+++ b/Suriya/Assignment5/ex8_11.cpp
@@ -0,0 +1,35 @@
+//Exercise 8.11
+
+#include<iostream>
+using namespace std;
+
+int main(){
+    //a) the pointer variable 'number' points towards an arbitrary variable.
+    //it has to be initialised to zero or some variable of 'int' data type
+
+    int *number=0;
+    cout << *number <<endl;
+
+    //b) 'double' data type realPtr in assigned to a pointer pointing a variable of 'long' data type.
+    //it is an error
+
+    double *realPtr;
+    double *integerPtr;
+    integerPtr = realPtr;
+
+    //c) assigns a non-pointer variable to a pointer variable
+    int *x, y;
+    x = &y;
+
+    //d) result is a short data type variable whereas genericPtr points to address of numPtr
+    // while numPtr is a ptr variable itself. assigning address to a variable is an error
+    //short *numPtr, result;
+    //void *genericPtr = &numPtr;
+    //result = *genericPtr + 7;
+
+    //e) xPtr is not declared as a pointer variable
+    double x1 = 19.34;
+    double *x1Ptr = &x1;
+    cout << x1Ptr << endl;
+
+}
diff --git a/Suriya/Assignment5/ex8_13.cpp b/Suriya/Assignment5/ex8_13.cpp
new file mode 100644
index 0000000..3d5cc1d
--- /dev/null
+++ b/Suriya/Assignment5/ex8_13.cpp
@@ -0,0 +1,27 @@
+//Exercise 8.13
+
+#include<iostream>
+
+using namespace std;
+
+void mystery1( char *, const char * );
+
+int main(){
+    char string1[ 80 ];
+    char string2[ 80 ];
+    cout << "Enter two strings: ";
+    cin >> string1 >> string2;
+    mystery1( string1, string2 );
+    cout << string1 << endl;
+}
+
+//The function appends string 2 to the end of string 1
+//Two pointers pointing to the first elements of each string are initialised here
+void mystery1( char *s1, const char *s2 ){
+    //the while loop increments the pointer s1 till it points the last non-'/0' element of the first string
+    while ( *s1 != '\0' )
+    ++s1;
+
+    //the for loop copies each element from s2 to the tail of s1
+    for ( ; *s1 = *s2; ++s1, ++s2 );
+}
diff --git a/Suriya/Assignment5/ex8_14.cpp b/Suriya/Assignment5/ex8_14.cpp
new file mode 100644
index 0000000..d3f1f5b
--- /dev/null
+++ b/Suriya/Assignment5/ex8_14.cpp
@@ -0,0 +1,22 @@
+#include <iostream>
+using namespace std;
+
+int mystery2( const char * );
+
+int main()
+{
+    char string1[ 80 ];
+    cout << "Enter a string: ";
+    cin >> string1;
+    cout << mystery2( string1 ) << endl;
+}
+
+// The function returns the length of the string
+int mystery2( const char *s ){
+    int x;
+    //for loop increments x till it encounters '/0' character
+    for ( x = 0; *s != '\0'; ++s )
+        ++x;
+
+    return x;
+}
diff --git a/Suriya/Assignment5/ex8_15.cpp b/Suriya/Assignment5/ex8_15.cpp
new file mode 100644
index 0000000..15c2ec8
--- /dev/null
+++ b/Suriya/Assignment5/ex8_15.cpp
@@ -0,0 +1,58 @@
+//Exercise 8.15
+
+#include<iostream>
+using namespace std;
+
+void swapElements (int * , int *);
+void quickSort(int [], const int, const int);
+
+int main(){
+    const int arraySize = 10;
+    int toSort[arraySize] = {37, 2, 6, 4, 89, 8, 10, 12, 68, 45 };
+
+    cout<<"Array before sorting: "<<endl;
+    for ( int i=0; i<arraySize; i++)
+        cout<< toSort[i] <<" ";
+    cout<<endl;
+
+    quickSort(toSort, 0, arraySize-1);
+
+    cout<<"Array after sorting: "<<endl;
+    for ( int i=0; i<arraySize; i++)
+        cout<< toSort[i] <<" ";
+    cout<<endl;
+}
+
+void quickSort(int toSort[],const int start, const int end){
+
+    if ((end - start) >=2) {
+        int j = start;
+        int k = end + 1;
+        int currentPosition = j;
+
+        while (j <= k + 1 && k >= j + 1) {
+            for (k = k - 1; k > j; k--) {
+                if (toSort[k] < toSort[j]) {
+                    swapElements(&toSort[k], &toSort[j]);
+                    currentPosition = k;
+                    break;
+                }
+            }
+            for (j = j + 1; j < k; j++) {
+                if (toSort[j] > toSort[k]) {
+                    swapElements(&toSort[j], &toSort[k]);
+                    currentPosition = j;
+                    break;
+                }
+            }
+        }
+        quickSort(toSort, start, currentPosition - 1);
+        quickSort(toSort, currentPosition + 1, end);
+    }
+}
+
+void swapElements(int *const location1, int *const location2){
+    int temp = *location1;
+    *location1 = *location2;
+    *location2 = temp;
+}
\ No newline at end of file
diff --git a/Suriya/Assignment5/ex8_16.cpp b/Suriya/Assignment5/ex8_16.cpp
new file mode 100644
index 0000000..bf2a714
--- /dev/null
+++ b/Suriya/Assignment5/ex8_16.cpp
@@ -0,0 +1,56 @@
+//Exercise 8.16
+
+#include <iostream>
+#include <iomanip>
+using namespace std;
+
+void mazeGenerator(char [12][12], int row, int column);
+
+int main(){
+    char maze[12][12] = { {'#','#','#','#','#','#','#','#','#','#','#','#'},
+                          {'#','.','.','.','#','.','.','.','.','.','.','#'},
+                          {'.','.','#','.','#','.','#','#','#','#','.','#'},
+                          {'#','#','#','.','#','.','.','.','.','#','.','#'},
+                          {'#','.','.','.','.','#','#','#','.','#','.','o'},
+                          {'#','#','#','#','.','#','.','#','.','#','.','#'},
+                          {'#','.','.','#','.','#','.','#','.','#','.','#'},
+                          {'#','#','.','#','.','#','.','#','.','#','.','#'},
+                          {'#','.','.','.','.','.','.','.','.','#','.','#'},
+                          {'#','#','#','#','#','#','.','#','#','#','.','#'},
+                          {'#','.','.','.','.','.','.','#','.','.','.','#'},
+                          {'#','#','#','#','#','#','#','#','#','#','#','#'},
+    };
+
+    mazeGenerator(maze, 2, 0);
+
+}
+
+void mazeGenerator(char maze[12][12], int row, int column){
+    if (maze[row][column] == 'o')
+        cout<<"\n The maze is solved!"<<endl;
+
+    else{
+        maze[row][column] = 'x';
+        for (int i=0; i<12; i++) {
+            for (int j = 0; j < 12; j++)
+                cout << setw(3) << maze[i][j];
+            cout << endl;
+        }
+
+        cout<<"\n"<<endl;
+
+        if (maze[row][column+1] == '.' || maze[row][column+1] == 'o')
+            mazeGenerator(maze, row, column+1);
+
+        else if(maze[row][column+1] == '#' || maze[row][column+1] == 'x'){
+            if(maze[row+1][column] == '.' || maze[row][column+1] == 'o')
+                mazeGenerator(maze, row+1, column);
+
+            else if(maze[row-1][column] == '.' || maze[row][column+1] == 'o')
+                mazeGenerator(maze, row-1, column);
+
+            else if(maze[row][column-1] == '.' || maze[row][column+1] == 'o')
+                mazeGenerator(maze, row, column-1);
+        }
+    }
+}
\ No newline at end of file
diff --git a/Suriya/Assignment5/ex8_8.cpp b/Suriya/Assignment5/ex8_8.cpp
new file mode 100644
index 0000000..ac0e2f5
--- /dev/null
+++ b/Suriya/Assignment5/ex8_8.cpp
@@ -0,0 +1,49 @@
+//Exercise 8.8
+
+#include <iostream>
+#include <iomanip>
+
+using namespace std;
+
+int main(){
+    unsigned int values[5] = { 2, 4, 6, 8, 10};
+    unsigned int *vPtr;
+
+    cout<<"Array elements printed using index notation"<<endl;
+    for (int i=0; i<5; i++)
+        cout<<values[i]<<" ";
+    cout<<endl;
+
+    vPtr = values;
+
+    cout<<"Array elements printed using pointer notation"<<endl;
+    for (int i=0; i<5; i++)
+        cout<<*(vPtr + i)<<" ";
+    cout<<endl;
+
+    cout<<"Array elements printed using pointer notation with array name as pointer"<<endl;
+    for (int i=0; i<5; i++)
+        cout<<*(values + i)<<" ";
+    cout<<endl;
+
+    cout<<"Array elements printed using pointer notation with pointer indexing"<<endl;
+    for (int i=0; i<5; i++)
+        cout<<vPtr[i]<<" ";
+    cout<<endl;
+
+    cout<<"Referencing the 5th element using various methods: "<<endl;
+    cout<<setw(15)<<left<<"values[4]"<<" = "<<values[4]<<endl;
+    cout<<setw(15)<<left<<"*(values + 4)"<<" = "<<*(values + 4)<<endl;
+    cout<<setw(15)<<left<<"vPtr[4]"<<" = "<<vPtr[4]<<endl;
+    cout<<setw(15)<<left<<"*(vPtr + 4)"<<" = "<<*(vPtr + 4)<<endl;
+
+    cout<<"\nAddress referenced by vPtr+3 is "<< vPtr+3 <<endl;
+    cout<<"The value stored in vPtr+3 is "<< *(vPtr+3) <<endl;
+
+    vPtr = &values[4];
+    vPtr -= 4;
+
+    cout<<"\nAddress referenced by vPtr-=4 is " << vPtr <<endl;
+    cout<<"The value stored in vPtr-=4 is " << *vPtr <<endl;
+
+}
diff --git a/Suriya/MidtermProject/.DS_Store b/Suriya/MidtermProject/.DS_Store
new file mode 100644
index 0000000..5d6ebff
Binary files /dev/null and b/Suriya/MidtermProject/.DS_Store differ
diff --git a/Suriya/MidtermProject/DenArray Class/CMakeLists.txt b/Suriya/MidtermProject/DenArray Class/CMakeLists.txt
new file mode 100644
index 0000000..43b5053
--- /dev/null
+++ b/Suriya/MidtermProject/DenArray Class/CMakeLists.txt	
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.23)
+project(MidtermProject)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(MidtermProject main.cpp denArray.h denArray.cpp denArrayProd.cpp GaussSolver.cpp IterSolver.cpp)
diff --git a/Suriya/MidtermProject/DenArray Class/GaussSolver.cpp b/Suriya/MidtermProject/DenArray Class/GaussSolver.cpp
new file mode 100644
index 0000000..b1e4972
--- /dev/null
+++ b/Suriya/MidtermProject/DenArray Class/GaussSolver.cpp	
@@ -0,0 +1,114 @@
+#include "denArray.h"
+#include <iostream>
+#include <cmath>
+using namespace std;
+
+GaussSolver::GaussSolver(denArray A, denArray b){
+    if ((A.getRowDim() == b.getRowDim()) && (b.getColDim() == 1) ){
+        soln = denArray(A.getColDim(),1);
+        K = denArray(A.getRowDim(),A.getColDim());
+        copy(A,K);
+        f = denArray(b.getRowDim(),b.getColDim());
+        copy(b,f);
+        solve(K,f);
+    }
+
+    else
+        cout<<"Invalid matrix dimensions"<<endl;
+}
+
+void GaussSolver::copy(denArray P, denArray Q){
+    if((P.getRowDim()==Q.getRowDim()) && (P.getColDim()==Q.getColDim())){
+        double * pPtr = P.getArray();
+        double * qPtr = Q.getArray();
+        int row = P.getRowDim();
+        int column = P.getColDim();
+        for (int i = 0; i < row; i++) {
+            for (int j = 0; j < column; j++) {
+                 *(qPtr + i * column + j) = *(pPtr + i * column + j);
+            }
+        }
+    }
+
+    else
+        cout<<"Matrices' dimensions do not match"<<endl;
+}
+
+void GaussSolver::solve(denArray K, denArray f){
+    int row = K.getRowDim();
+    int column = K.getColDim();
+    double multiplier;
+    double *kPtr = K.getArray();
+    double *fPtr = f.getArray();
+
+    //forward elimination
+    for (int i=0; i < column-1; i++){
+        for (int k=i+1; k<row; k++) {
+            if (abs(*(kPtr + k * column + i)) >= 1e-6) {
+                multiplier = *(kPtr + i * column + i) / *(kPtr + k * column + i);
+                for (int j = i; j < column; j++) {
+                    *(kPtr + k * column + j) = (*(kPtr + k * column + j)) * multiplier
+                                                   - *(kPtr + i * column + j);
+                }
+                *(fPtr + k) = (*(fPtr + k)) * multiplier - (*(fPtr + i));
+            }
+
+            else {
+                *(kPtr + k * column + i) = 0;
+                continue;
+            }
+        }
+    }
+
+    //backward substitution
+    for (int i = (column-1); i>0; i--){
+        for (int k = i-1; k>=0; k--){
+            if (abs(*(kPtr + k * column + i)) >= 1e-6) {
+                multiplier = *(kPtr + k * column + i) / *(kPtr + i * column + i);
+                *(kPtr + k * column + i) = 0;
+                *(fPtr + k) = (*(fPtr + k)) - (*(fPtr + i)) * multiplier;
+            }
+            else {
+                *(kPtr + k * column + i) = 0;
+                continue;
+            }
+        }
+    }
+
+    double * solnPtr = soln.getArray();
+    for (int l = 0; l<column; l++)
+        *(solnPtr + l) = *(fPtr + l) / *(kPtr + l * column + l);
+
+}
+
+int GaussSolver::getRowDim(){
+    return soln.getRowDim();
+}
+
+int GaussSolver::getColDim(){
+    return soln.getColDim();
+};
+
+int GaussSolver::getLength(){
+    return soln.getLength();
+};
+
+double * GaussSolver::getArray(){
+    return soln.getArray();
+};
+
+double GaussSolver::lNorm(int base){
+    return soln.lNorm(base);
+};
+
+double GaussSolver::l2Norm(){
+    return soln.l2Norm();
+};
+
+double GaussSolver::infNorm(){
+    return soln.infNorm();
+};
+
+void GaussSolver::printArray() {
+    soln.printArray();
+}
diff --git a/Suriya/MidtermProject/DenArray Class/IterSolver.cpp b/Suriya/MidtermProject/DenArray Class/IterSolver.cpp
new file mode 100644
index 0000000..ed24f36
--- /dev/null
+++ b/Suriya/MidtermProject/DenArray Class/IterSolver.cpp	
@@ -0,0 +1,162 @@
+#include "denArray.h"
+#include<iostream>
+#include<iomanip>
+#include<cmath>
+
+using namespace std;
+
+IterSolver::IterSolver(denArray A, denArray b, double tol){
+    if ((A.getRowDim() == b.getRowDim()) && (b.getColDim() == 1) ){
+        tolerance = tol;
+        soln = denArray(A.getColDim(),1);
+        residual = denArray(b.getRowDim(),1);
+        direction = denArray(b.getRowDim(),1);
+        K = denArray(A.getRowDim(),A.getColDim());
+        copy(A,K);
+        f = denArray(b.getRowDim(),b.getColDim());
+        copy(b,f);
+        solve(K,f);
+    }
+
+    else
+        cout<<"Invalid matrix dimensions"<<endl;
+}
+
+void IterSolver::copy(denArray P, denArray Q) {
+    if((P.getRowDim()==Q.getRowDim()) && (P.getColDim()==Q.getColDim())){
+        double * pPtr = P.getArray();
+        double * qPtr = Q.getArray();
+        int row = P.getRowDim();
+        int column = P.getColDim();
+        for (int i = 0; i < row; i++) {
+            for (int j = 0; j < column; j++) {
+                *(qPtr + i * column + j) = *(pPtr + i * column + j);
+            }
+        }
+    }
+
+    else
+        cout<<"Matrices' dimensions do not match"<<endl;
+}
+
+void IterSolver::transpose(denArray H, denArray H_trans) {
+    if (H.getRowDim()==H_trans.getColDim() && H.getColDim()==H_trans.getRowDim()){
+        double * htrPtr = H_trans.getArray();
+        double * hPtr = H.getArray();
+        int row = H_trans.getRowDim();
+        int column = H_trans.getColDim();
+        for (int i=0; i<row; i++){
+            for (int j=0; j<column; j++)
+                *(htrPtr + i * column + j) = *(hPtr + j * row + i);
+        }
+    }
+
+    else
+        cout<<"Matrices' dimensions do not match"<<endl;
+}
+
+void IterSolver::solve(denArray K , denArray f) {
+    double * const fPtr = f.getArray();
+    double * const resPtr = residual.getArray();
+    double * const dirPtr = direction.getArray();
+    double * const solPtr = soln.getArray();
+    int row = residual.getRowDim();
+    int column = K.getColDim();
+    double rNrN = 0;
+    double rNrN_prev = 0;
+    double dKd = 0;
+    denArray k_dir = denArray(row,1);
+    denArrayProd k_dirr = denArrayProd(K,direction);
+    denArray dirTrans = denArray(1,row);
+
+    
+    //initialise
+    double a[1] = {1};
+    soln.declareArray(a,1);
+    denArrayProd k_soln = denArrayProd(K,soln);
+    double *k_solnPtr = k_soln.getArray();
+    for (int j=0; j<row; j++) {
+        *(resPtr + j) = *(fPtr + j) - *(k_solnPtr + j);
+        *(dirPtr + j) = *(resPtr + j);
+    }
+
+
+    epsilon = residual.l2Norm();
+    denArray residualTrans = denArray(1, row);
+    transpose(residual, residualTrans);
+    denArrayProd rTr = denArrayProd(residualTrans, residual);
+    rNrN = *(rTr.getArray());
+
+    int loopCounter = 0;
+    cout<<endl;
+    cout<<"Convergence chart: "<<endl;
+    cout<<setw(15)<<"iteration#"<<setw(15)<<"error"<<endl;
+    while(epsilon>=tolerance){
+        loopCounter++;
+
+        //Calculation of beta
+        rNrN_prev = rNrN;
+        transpose(residual, residualTrans);
+        rTr = denArrayProd(residualTrans, residual);
+        rNrN = *(rTr.getArray());
+        beta = rNrN / rNrN_prev;
+
+        //Search direction
+        for (int j=0; j<row; j++)
+            *(dirPtr + j) = *(resPtr + j) + beta * (*(dirPtr + j));
+
+        //alpha calculation
+        transpose(direction, dirTrans);
+        k_dirr = denArrayProd(K,direction);
+        k_dir.declareArray(k_dirr.getArray(),k_dirr.getLength());
+        k_dirr = denArrayProd(dirTrans,k_dir);
+        dKd = *(k_dirr.getArray());
+        alpha = rNrN / dKd;
+
+        //solution updation
+        for (int i=0; i<column; i++)
+            *(solPtr + i) = *(solPtr + i) + alpha * (*(dirPtr + i));
+
+        //residual calculation
+        for (int j=0; j<row; j++)
+            *(resPtr + j) = *(resPtr + j) - alpha * (*(k_dir.getArray() + j));
+
+        epsilon = abs(alpha) * direction.l2Norm();
+
+        if(loopCounter%5 == 0)
+            cout<<setw(15)<<loopCounter<<setw(15)<<epsilon<<endl;
+    }
+
+}
+
+void IterSolver::printArray() {
+    soln.printArray();
+}
+
+int IterSolver::getRowDim() {
+    return soln.getRowDim();
+}
+
+int IterSolver::getColDim(){
+    return soln.getColDim();
+}
+
+int IterSolver::getLength() {
+    return soln.getRowDim() * soln.getColDim();
+}
+
+double * IterSolver::getArray() {
+    return soln.getArray();
+}
+
+double IterSolver::lNorm(int base){
+    return soln.lNorm(base);
+}
+
+double IterSolver::l2Norm() {
+    return soln.l2Norm();
+}
+
+double IterSolver::infNorm() {
+    return soln.infNorm();
+}
\ No newline at end of file
diff --git a/Suriya/MidtermProject/DenArray Class/denArray.cpp b/Suriya/MidtermProject/DenArray Class/denArray.cpp
new file mode 100644
index 0000000..0dccc0d
--- /dev/null
+++ b/Suriya/MidtermProject/DenArray Class/denArray.cpp	
@@ -0,0 +1,90 @@
+#include <iostream>
+#include <iomanip>
+#include <cmath>
+#include "denArray.h"
+
+using namespace std;
+
+denArray::denArray (int row, int column){
+        setArrayDim(row,column);
+}
+
+void denArray::setArrayDim(int row,int column){
+        row_dim = row;
+        column_dim = column;
+        arr = new double[row_dim * column_dim];
+}
+
+int denArray::getRowDim(){
+    return row_dim;
+}
+
+int denArray::getColDim(){
+    return column_dim;
+}
+
+int denArray::getLength(){
+    return row_dim * column_dim;
+}
+
+double * denArray::getArray(){
+    return arr;
+}
+
+void denArray::setArray(){
+    cout<<"Enter "<< row_dim*column_dim << " numbers:" << endl;
+    for (int i = 0; i < row_dim; i++) {
+        for (int j = 0; j < column_dim; j++) {
+            cin >> *(arr + i * column_dim + j);
+        }
+    }
+}
+
+void denArray::declareArray(const double *declare, const int size) {
+    int counter = 0;
+    for (int i = 0; i < row_dim; i++) {
+        for (int j = 0; j < column_dim; j++) {
+            if (counter<size) {
+                *(arr + i * column_dim + j) = *(declare + counter);
+                counter++;
+            }
+            else
+                *(arr + i * column_dim + j) = 0;
+        }
+    }
+}
+
+
+void denArray::printArray(){
+    for (int i = 0; i < row_dim; i++) {
+        for (int j = 0; j < column_dim; j++) {
+            cout<<setw(5)<<*(arr + i * column_dim + j);
+        }
+    cout<<endl;
+    }
+}
+
+double denArray::lNorm(int base){
+    double norm = 0;
+    for (int i = 0; i < row_dim; i++) {
+        for (int j = 0; j < column_dim; j++) {
+            norm = norm + pow(abs(*(arr + i * column_dim + j)),base);
+        }
+    }
+    return pow(norm, 1.0/base);
+}
+
+double denArray::l2Norm(){
+    return lNorm(2);
+}
+
+double denArray::infNorm() {
+    double max = 0;
+    for (int i = 0; i < row_dim; i++) {
+        for (int j = 0; j < column_dim; j++) {
+            if(abs(*(arr + i * column_dim + j))>max)
+                max = abs(*(arr + i * column_dim + j));
+        }
+    }
+    return max;
+}
\ No newline at end of file
diff --git a/Suriya/MidtermProject/DenArray Class/denArray.h b/Suriya/MidtermProject/DenArray Class/denArray.h
new file mode 100644
index 0000000..28eac79
--- /dev/null
+++ b/Suriya/MidtermProject/DenArray Class/denArray.h	
@@ -0,0 +1,88 @@
+
+
+class denArray{
+    public:
+        denArray(int, int);
+        void setArrayDim(int, int);
+        int getRowDim();
+        int getColDim();
+        int getLength();
+        double * getArray();
+        void setArray();
+        void declareArray(const double *,const int);
+        void printArray();
+        double lNorm(int);
+        double l2Norm();
+        double infNorm();
+
+    private:
+        int row_dim;
+        int column_dim;
+        double * arr;
+};
+
+class denArrayProd {
+public:
+    denArrayProd(denArray, denArray);
+    void product(denArray, denArray);
+    void printArray();
+    int getRowDim();
+    int getColDim();
+    int getLength();
+    double * getArray();
+    double lNorm(int);
+    double l2Norm();
+    double infNorm();
+
+
+private:
+    denArray prod = denArray(0,0);
+};
+
+class GaussSolver {
+public:
+    GaussSolver(denArray, denArray);
+    void solve(denArray, denArray);
+    void copy(denArray, denArray);
+    void printArray();
+    int getRowDim();
+    int getColDim();
+    int getLength();
+    double * getArray();
+    double lNorm(int);
+    double l2Norm();
+    double infNorm();
+
+private:
+    denArray K = denArray(0,0);
+    denArray f = denArray(0,0);
+    denArray soln = denArray(0,0);
+};
+
+class IterSolver {
+public:
+    IterSolver(denArray, denArray, double);
+    void solve(denArray, denArray);
+    void copy(denArray, denArray);
+    void transpose(denArray, denArray);
+    void printArray();
+    int getRowDim();
+    int getColDim();
+    int getLength();
+    double * getArray();
+    double lNorm(int);
+    double l2Norm();
+    double infNorm();
+
+private:
+    denArray soln = denArray(0,0);
+    denArray residual = denArray(0,0);
+    denArray K = denArray(0,0);
+    denArray f = denArray(0,0);
+    denArray direction = denArray(0,0);
+    double tolerance;
+    double epsilon;
+    double alpha;
+    double beta;
+
+};
\ No newline at end of file
diff --git a/Suriya/MidtermProject/DenArray Class/denArrayProd.cpp b/Suriya/MidtermProject/DenArray Class/denArrayProd.cpp
new file mode 100644
index 0000000..dc2fe97
--- /dev/null
+++ b/Suriya/MidtermProject/DenArray Class/denArrayProd.cpp	
@@ -0,0 +1,66 @@
+#include "denArray.h"
+#include <iostream>
+using namespace std;
+
+denArrayProd::denArrayProd(denArray A, denArray B) {
+    if (A.getColDim() == B.getRowDim()){
+        prod = denArray(A.getRowDim(), B.getColDim());
+        product(A,B);
+    }
+
+    else
+        cout<<"Array dimensions do not conform for matrix multiplication"<<endl;
+}
+
+void denArrayProd::product(denArray A, denArray B){
+    int rowA = A.getRowDim();
+    int columnA = A.getColDim();
+    int columnB = B.getColDim();
+
+    double *arrayA = A.getArray();
+    double *arrayB = B.getArray();
+    double sum = 0;
+    double * arrayC = new double [rowA*columnB];
+    for (int i = 0; i < rowA; i++) {
+        for (int j = 0; j < columnB; j++) {
+            sum = 0;
+            for (int k = 0; k < columnA; k++)
+                sum = sum + (*(arrayA + i * columnA  + k)) * (*(arrayB + k * columnB + j));
+            *(arrayC + i * columnB + j) = sum;
+        }
+    }
+    prod.declareArray(arrayC,rowA*columnB);
+}
+
+void denArrayProd::printArray() {
+    prod.printArray();
+}
+
+int denArrayProd::getRowDim() {
+    return prod.getRowDim();
+}
+
+int denArrayProd::getColDim() {
+    return prod.getColDim();
+}
+
+int denArrayProd::getLength() {
+    return prod.getLength();
+}
+
+double * denArrayProd::getArray() {
+    return prod.getArray();
+}
+
+double denArrayProd::lNorm(int base){
+    return prod.lNorm(base);
+}
+
+double denArrayProd::l2Norm(){
+    return prod.l2Norm();
+}
+
+double denArrayProd::infNorm(){
+    return prod.infNorm();
+}
+
diff --git a/Suriya/MidtermProject/DenArray Class/main.cpp b/Suriya/MidtermProject/DenArray Class/main.cpp
new file mode 100644
index 0000000..d1c3fb4
--- /dev/null
+++ b/Suriya/MidtermProject/DenArray Class/main.cpp	
@@ -0,0 +1,59 @@
+#include <iostream>
+#include "denArray.h"
+
+using namespace std;
+
+int main() {
+
+    denArray A = denArray(3,2);
+    double a[6] = {1, 0, 3, 0, 5, 0};
+    A.declareArray(a,6);
+    cout<<"Matrix A is: "<<endl;
+    A.printArray();
+    cout<<endl;
+    cout<<"The inf norm of Matrix A is "<<A.infNorm()<<endl;
+
+    denArray B = denArray(2,3);
+    double b[6] = {7, 0, 9, 0, 11, 0};
+    B.declareArray(b,6);
+    cout<<"Matrix B is: "<<endl;
+    B.printArray();
+    cout<<endl;
+    cout<<"The L2 norm of Matrix A is "<<B.l2Norm()<<endl;
+
+    denArrayProd C = denArrayProd(A,B);
+    cout<<"The product of matrices A and B is: "<<endl;
+    C.printArray();
+    cout<<endl;
+
+    cout<<"The Matrix A is: "<<endl;
+    double u[9] = {2, -1, 0, -1, 2, -1, 0, -1, 2};
+    denArray U = denArray(3,3);
+    U.declareArray(u,9);
+    U.printArray();
+    cout<<endl;
+
+    //manufactured solution
+    double p[3] = {1, 2, 2};
+    denArray P = denArray(3,1);
+    P.declareArray(p,3);
+
+    cout<<"The RHS is: "<<endl;
+    denArrayProd UP = denArrayProd(U,P);
+    UP.printArray();
+
+    denArray Q = denArray(3,1);
+    Q.declareArray(UP.getArray(),UP.getLength());
+
+    IterSolver soln = IterSolver(U,Q,1e-5);
+    cout<<endl;
+    cout<<"The Solution from Conjugate Gradient is: "<<endl;
+    soln.printArray();
+
+    GaussSolver soln1 = GaussSolver(U,Q);
+    cout<<endl;
+    cout<<"The Solution from Gaussian Elimination is: "<<endl;
+    soln1.printArray();
+
+}
+
diff --git a/Suriya/MidtermProject/SparArray Class/CMakeLists.txt b/Suriya/MidtermProject/SparArray Class/CMakeLists.txt
new file mode 100644
index 0000000..6348d3b
--- /dev/null
+++ b/Suriya/MidtermProject/SparArray Class/CMakeLists.txt	
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.23)
+project(MidtermProject_2)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(MidtermProject_2 main.cpp SparArray.cpp SparArray.h SparArrayProd.cpp GaussSolver.cpp IterSolver.cpp)
diff --git a/Suriya/MidtermProject/SparArray Class/GaussSolver.cpp b/Suriya/MidtermProject/SparArray Class/GaussSolver.cpp
new file mode 100644
index 0000000..180b471
--- /dev/null
+++ b/Suriya/MidtermProject/SparArray Class/GaussSolver.cpp	
@@ -0,0 +1,118 @@
+#include "SparArray.h"
+#include <iostream>
+using namespace std;
+
+GaussSolver::GaussSolver(SparArray A, SparArray b){
+    if ((A.getRowDim() == b.getRowDim()) && (b.getColDim() == 1) ){
+        soln = SparArray(A.getColDim(),1);
+        solve(A,b);
+    }
+
+    else
+        cout<<"Invalid matrix dimensions"<<endl;
+}
+
+void GaussSolver::solve(SparArray A, SparArray b) {
+    int row = A.getRowDim();
+    int col = A.getColDim();
+    double * aNew = new double [row * col];
+    double * bNew = new double [row];
+    double * sNew = new double [col];
+    for (int i=0; i<row; i++){
+        * (bNew + i) = b.getValue(i,0);
+        for (int j=0; j<col; j++)
+            * (aNew + i * A.getColDim() + j) = A.getValue(i,j);
+    }
+
+    double multiplier;
+    //forward elimination
+    for (int i=0; i < col-1; i++){
+        for (int k=i+1; k<row; k++) {
+            if (abs(*(aNew + k * col + i)) >= 1e-6) {
+                multiplier = *(aNew + i * col + i) / *(aNew + k * col + i);
+                for (int j = i; j < col; j++) {
+                    *(aNew + k * col + j) = (*(aNew + k * col + j)) * multiplier
+                                               - *(aNew + i * col + j);
+                }
+                *(bNew + k) = (*(bNew + k)) * multiplier - (*(bNew + i));
+            }
+
+            else {
+                *(aNew + k * col + i) = 0;
+                continue;
+            }
+        }
+    }
+
+    //backward substitution
+    for (int i = (col-1); i>0; i--){
+        for (int k = i-1; k>=0; k--){
+            if (abs(*(aNew + k * col + i)) >= 1e-6) {
+                multiplier = *(aNew + k * col + i) / *(aNew + i * col + i);
+                *(aNew + k * col + i) = 0;
+                *(bNew + k) = (*(bNew + k)) - (*(bNew + i)) * multiplier;
+            }
+            else {
+                *(aNew + k * col + i) = 0;
+                continue;
+            }
+        }
+    }
+
+    for (int l = 0; l<col; l++)
+        *(sNew + l) = *(bNew + l) / *(aNew + l * col + l);
+
+    soln.declareArray(sNew, col);
+
+    delete [] aNew;
+    delete [] bNew;
+    delete [] sNew;
+}
+
+void GaussSolver::printArray(){
+    soln.printArray();
+}
+
+void GaussSolver::printCompact(){
+    soln.printCompact();
+}
+
+double GaussSolver::getSparsity() {
+    return soln.getSparsity();
+}
+
+double GaussSolver::getDensity() {
+    return soln.getDensity();
+}
+
+double GaussSolver::getValue(int row_index, int col_index){
+    return soln.getValue(row_index, col_index);
+}
+
+int GaussSolver::getRowDim() {
+    return soln.getRowDim();
+}
+
+int GaussSolver::getColDim() {
+    return soln.getColDim();
+}
+
+int GaussSolver::getSize() {
+    return soln.getSize();
+}
+
+void ** GaussSolver::getArray() {
+    return soln.getArray();
+}
+
+double GaussSolver::lNorm(int base) {
+    return soln.lNorm(base);
+}
+
+double GaussSolver::l2Norm() {
+    return soln.l2Norm();
+}
+
+double GaussSolver::infNorm() {
+    return soln.infNorm();
+}
\ No newline at end of file
diff --git a/Suriya/MidtermProject/SparArray Class/IterSolver.cpp b/Suriya/MidtermProject/SparArray Class/IterSolver.cpp
new file mode 100644
index 0000000..812aa47
--- /dev/null
+++ b/Suriya/MidtermProject/SparArray Class/IterSolver.cpp	
@@ -0,0 +1,151 @@
+#include "SparArray.h"
+#include <iostream>
+#include <cmath>
+#include <iomanip>
+using namespace std;
+
+IterSolver::IterSolver(SparArray A, SparArray b, double tol){
+    if ((A.getRowDim() == b.getRowDim()) && (b.getColDim() == 1) ){
+        tolerance = tol;
+        soln = SparArray(A.getColDim(),1);
+        solve(A,b,tolerance);
+    }
+
+    else
+        cout<<"Invalid matrix dimensions"<<endl;
+}
+
+void IterSolver::solve(SparArray A, SparArray b, double tol) {
+    int row = A.getRowDim();
+    int col = A.getColDim();
+    SparArray l2Cal = SparArray(row,1);
+    double * residual = new double [row];
+    double * direction = new double [row];
+    double * k_dir = new double [row];
+
+    double rNrN = 0;
+    double rNrN_prev = 0;
+    double dKd = 0;
+    double epsilon = 0;
+    double alpha = 0;
+    double beta = 0;
+
+    double sum = 0;
+    //initialise
+    double * solnDup = new double [col];
+    for (int i=0; i<col; i++){
+        * (solnDup + i) = 0;
+    }
+    * (solnDup) = 1;
+    for (int i=0; i<row; i++){
+        sum = 0;
+        for (int k=0; k<col; k++)
+            sum = sum + A.getValue(i,k) * (*(solnDup + k));
+        * (residual + i) = b.getValue(i,0) - sum;
+        * (direction + i) = * (residual + i);
+    }
+
+    l2Cal.declareArray(residual,row);
+    epsilon = l2Cal.l2Norm();
+    rNrN = pow(l2Cal.l2Norm(),2);
+
+    int loopCounter = 0;
+    cout<<endl;
+    cout<<"Convergence chart: "<<endl;
+
+    cout<<setw(15)<<"iteration#"<<setw(15)<<"error"<<endl;
+
+    while(epsilon>=tolerance) {
+        loopCounter++;
+
+        //Calculation of beta
+        rNrN_prev = rNrN;
+        l2Cal.declareArray(residual,row);
+        rNrN = pow(l2Cal.l2Norm(),2);
+        beta = rNrN / rNrN_prev;
+
+        //Search Direction
+        for (int j=0; j<row; j++)
+            * (direction + j) = *(residual + j) + beta * (*(direction + j));
+
+        dKd = 0;
+        //alpha calculation
+        for (int i=0; i<row; i++) {
+            sum = 0;
+            for (int k = 0; k < col; k++)
+                sum = sum + A.getValue(i, k) * (*(direction + k));
+            *(k_dir + i) = sum;
+            dKd = dKd + (*(direction + i) * sum);
+        }
+        alpha = rNrN / dKd;
+
+        //solution updation
+        for (int i=0; i<col; i++)
+            *(solnDup + i) = *(solnDup + i) + alpha * (*(direction + i));
+
+        //residual calculation
+        for (int j=0; j<row; j++)
+            *(residual + j) = *(residual + j) - alpha * (*(k_dir + j));
+
+        l2Cal.declareArray(k_dir,row);
+        epsilon = abs (alpha) * l2Cal.l2Norm();
+
+        if(loopCounter%5 == 0)
+            cout<<setw(15)<<loopCounter<<setw(15)<<epsilon<<endl;
+    }
+
+    soln.declareArray(solnDup,col);
+
+    delete [] solnDup;
+    delete [] residual;
+    delete [] direction;
+    delete [] k_dir;
+}
+
+void IterSolver::printArray(){
+    soln.printArray();
+}
+
+void IterSolver::printCompact(){
+    soln.printCompact();
+}
+
+double IterSolver::getSparsity() {
+    return soln.getSparsity();
+}
+
+double IterSolver::getDensity() {
+    return soln.getDensity();
+}
+
+double IterSolver::getValue(int row_index, int col_index){
+    return soln.getValue(row_index, col_index);
+}
+
+int IterSolver::getRowDim() {
+    return soln.getRowDim();
+}
+
+int IterSolver::getColDim() {
+    return soln.getColDim();
+}
+
+int IterSolver::getSize() {
+    return soln.getSize();
+}
+
+void ** IterSolver::getArray() {
+    return soln.getArray();
+}
+
+double IterSolver::lNorm(int base) {
+    return soln.lNorm(base);
+}
+
+double IterSolver::l2Norm() {
+    return soln.l2Norm();
+}
+
+double IterSolver::infNorm() {
+    return soln.infNorm();
+}
\ No newline at end of file
diff --git a/Suriya/MidtermProject/SparArray Class/SparArray.cpp b/Suriya/MidtermProject/SparArray Class/SparArray.cpp
new file mode 100644
index 0000000..ae2d019
--- /dev/null
+++ b/Suriya/MidtermProject/SparArray Class/SparArray.cpp	
@@ -0,0 +1,197 @@
+#include "SparArray.h"
+#include <iostream>
+#include <iomanip>
+#include <cmath>
+
+using namespace std;
+
+SparArray::SparArray(int row, int column){
+    setArrayDim(row, column);
+}
+
+void SparArray::setArrayDim(int row, int column) {
+    row_dim = row;
+    column_dim = column;
+    size = 0;
+}
+
+void SparArray::setArray() {
+    size = 0;
+    cout<<"Enter "<< row_dim*column_dim << " numbers:" << endl;
+    double *tempArr = new double [row_dim * column_dim];
+    for (int i = 0; i < row_dim; i++) {
+        for (int j = 0; j < column_dim; j++) {
+            cin >> *(tempArr + i * column_dim + j);
+            if (*(tempArr + i * column_dim + j)!=0)
+                size++;
+        }
+    }
+
+    if (size>0) {
+        rowPtr = new int[size];
+        columnPtr = new int[size];
+        valuePtr = new double[size];
+
+        *spar = rowPtr;
+        *(spar+1) = columnPtr;
+        *(spar+2) = valuePtr;
+
+        int counter = 0;
+        for (int i = 0; i < row_dim; i++) {
+            for (int j = 0; j < column_dim; j++) {
+                if (*(tempArr + i * column_dim + j) != 0) {
+                    *(rowPtr + counter) = i;
+                    *(columnPtr + counter) = j;
+                    *(valuePtr + counter) = *(tempArr + i * column_dim + j);
+                    counter++;
+                }
+            }
+        }
+    }
+
+    if (size==0){
+        size = 1;
+        rowPtr = new int [size];
+        columnPtr = new int [size];
+        valuePtr = new double [size];
+        *(rowPtr) = 0;
+        *(columnPtr) = 0;
+        *(valuePtr) = *(tempArr);
+    }
+
+    delete [] tempArr;
+}
+
+void SparArray::declareArray(const double * declare, int arrSize) {
+    if (arrSize>1)
+    {
+        size = 0;
+        for (int i = 0; i < arrSize; i++) {
+            if (*(declare + i) != 0)
+                size++;
+        }
+
+        rowPtr = new int[size];
+        columnPtr = new int[size];
+        valuePtr = new double[size];
+
+        *spar = rowPtr;
+        *(spar+1) = columnPtr;
+        *(spar+2) = valuePtr;
+
+        int counter = 0;
+        int counter2 = 0;
+        for (int i = 0; i < row_dim && counter2 < arrSize; i++) {
+            for (int j = 0; j < column_dim && counter2 < arrSize; j++) {
+                if (*(declare + i * column_dim + j) != 0) {
+                    *(rowPtr + counter) = i;
+                    *(columnPtr + counter) = j;
+                    *(valuePtr + counter) = *(declare + i * column_dim + j);
+                    counter++;
+                }
+                counter2++;
+            }
+        }
+    }
+
+    else if(arrSize == 1){
+            size = 1;
+            rowPtr = new int [size];
+            columnPtr = new int [size];
+            valuePtr = new double [size];
+            *(rowPtr) = 0;
+            *(columnPtr) = 0;
+            *(valuePtr) = *(declare);
+    }
+}
+
+void SparArray::printArray(){
+
+    int counter = 0;
+    for (int i=0; i < row_dim; i++){
+        for (int j=0; j < column_dim; j++){
+            if (*(rowPtr + counter)==i && *(columnPtr + counter)==j){
+                    cout<<setw(5)<<*(valuePtr+counter);
+                    counter++;
+                }
+
+            else
+                cout<<setw(5)<<0;
+        }
+        cout<<endl;
+    }
+}
+
+void SparArray::printCompact(){
+    cout<<setw(5)<<"row"<<setw(5)<<"col"<<setw(10)<<"value"<<endl;
+    for (int i=0; i<size; i++){
+        cout<<setw(5)<<*(rowPtr+i)<<setw(5)<<*(columnPtr+i)<<setw(10)<<*(valuePtr+i)<<endl;
+    }
+}
+
+double SparArray::getSparsity() {
+    return 1.0 - getDensity();
+}
+
+double SparArray::getDensity() {
+    return size/(row_dim*column_dim);
+}
+
+int SparArray::getRowDim() {
+    return row_dim;
+}
+
+int SparArray::getColDim() {
+    return column_dim;
+}
+
+int SparArray::getSize() {
+    return size;
+}
+
+void ** SparArray::getArray() {
+    return spar;
+}
+
+double SparArray::lNorm(int base) {
+    double sum=0;
+    for (int i=0; i<size; i++)
+        sum = sum + pow(abs(*(valuePtr+i)),base);
+    return pow(sum, 1.0/base);
+}
+
+double SparArray::l2Norm(){
+    return lNorm(2);
+}
+
+double SparArray::infNorm() {
+    double max = abs(*(valuePtr));
+    for (int i=1; i<size; i++){
+        if (abs((*valuePtr + i)) > max)
+            max = abs(*(valuePtr + i));
+    }
+    return max;
+}
+
+double SparArray::getValue(int row_index, int col_index) {
+    if (row_index<row_dim && col_index<column_dim){
+        int temp = 0;
+        for (int counter = 0; counter < size; counter++){
+            if (*(rowPtr + counter) == row_index && *(columnPtr + counter) == col_index) {
+                temp = *(valuePtr + counter);
+                break;
+            }
+
+            if (*(rowPtr+counter) == row_index && *(columnPtr + counter) > col_index)
+                break;
+
+            if (*(rowPtr+counter) > row_index)
+                break;
+        }
+
+        return temp;
+    }
+
+    else
+        cout<<"Atleast one of the indices exceeds the matrix limit"<<endl;
+}
\ No newline at end of file
diff --git a/Suriya/MidtermProject/SparArray Class/SparArray.h b/Suriya/MidtermProject/SparArray Class/SparArray.h
new file mode 100644
index 0000000..d50b967
--- /dev/null
+++ b/Suriya/MidtermProject/SparArray Class/SparArray.h	
@@ -0,0 +1,95 @@
+
+class SparArray {
+public:
+    SparArray(int, int);
+    void setArrayDim(int, int);
+    void setArray();
+    void declareArray(const double *, int);
+    void printArray();
+    void printCompact();
+    double getSparsity();
+    double getDensity();
+    double getValue(int, int);
+    int getRowDim();
+    int getColDim();
+    int getSize();
+    void ** getArray();
+    double lNorm(int);
+    double l2Norm();
+    double infNorm();
+
+
+private:
+    int row_dim = 1;
+    int column_dim = 1;
+    int size;
+    int *rowPtr;
+    int *columnPtr;
+    double *valuePtr;
+    void **spar = new void * [3];
+
+};
+
+class SparArrayProd{
+public:
+    SparArrayProd(SparArray, SparArray);
+    void product(SparArray, SparArray);
+    void printArray();
+    void printCompact();
+    double getSparsity();
+    double getDensity();
+    double getValue(int, int);
+    int getRowDim();
+    int getColDim();
+    int getSize();
+    void ** getArray();
+    double lNorm(int);
+    double l2Norm();
+    double infNorm();
+
+private:
+    SparArray prod = SparArray(0,0);
+};
+
+class GaussSolver{
+public:
+    GaussSolver(SparArray, SparArray);
+    void solve(SparArray, SparArray);
+    void printArray();
+    void printCompact();
+    double getSparsity();
+    double getDensity();
+    double getValue(int, int);
+    int getRowDim();
+    int getColDim();
+    int getSize();
+    void ** getArray();
+    double lNorm(int);
+    double l2Norm();
+    double infNorm();
+
+private:
+    SparArray soln = SparArray(0,0);
+};
+
+class IterSolver{
+public:
+    IterSolver(SparArray, SparArray, double);
+    void solve(SparArray, SparArray, double);
+    void printArray();
+    void printCompact();
+    double getSparsity();
+    double getDensity();
+    double getValue(int, int);
+    int getRowDim();
+    int getColDim();
+    int getSize();
+    void ** getArray();
+    double lNorm(int);
+    double l2Norm();
+    double infNorm();
+
+private:
+    SparArray soln = SparArray(0,0);
+    double tolerance;
+};
\ No newline at end of file
diff --git a/Suriya/MidtermProject/SparArray Class/SparArrayProd.cpp b/Suriya/MidtermProject/SparArray Class/SparArrayProd.cpp
new file mode 100644
index 0000000..4245060
--- /dev/null
+++ b/Suriya/MidtermProject/SparArray Class/SparArrayProd.cpp	
@@ -0,0 +1,83 @@
+#include "SparArray.h"
+#include <iostream>
+using namespace std;
+
+SparArrayProd::SparArrayProd(SparArray A, SparArray B) {
+    if (A.getColDim() == B.getRowDim()){
+        prod = SparArray(A.getRowDim(), B.getColDim());
+        product(A,B);
+    }
+
+    else
+        cout<<"Array dimensions do not conform for matrix multiplication"<<endl;
+}
+
+void SparArrayProd::product(SparArray A, SparArray B){
+    int rowA = A.getRowDim();
+    int columnA = A.getColDim();
+    int columnB = B.getColDim();
+
+    double sum = 0;
+    double * arrayC = new double [rowA*columnB];
+
+    for (int i = 0; i < rowA; i++) {
+        for (int j = 0; j < columnB; j++) {
+            sum = 0;
+            for (int k = 0; k < columnA; k++)
+                sum = sum + A.getValue(i,k) * B.getValue(k,j);
+            *(arrayC + i * columnB + j) = sum;
+        }
+    }
+
+    prod.declareArray(arrayC,rowA*columnB);
+
+    delete [] arrayC;
+}
+
+void SparArrayProd::printArray(){
+    prod.printArray();
+}
+
+void SparArrayProd::printCompact(){
+    prod.printCompact();
+}
+
+double SparArrayProd::getSparsity() {
+    return prod.getSparsity();
+}
+
+double SparArrayProd::getDensity() {
+    return prod.getDensity();
+}
+
+double SparArrayProd::getValue(int row_index, int col_index){
+    return prod.getValue(row_index, col_index);
+}
+
+int SparArrayProd::getRowDim() {
+    return prod.getRowDim();
+}
+
+int SparArrayProd::getColDim() {
+    return prod.getColDim();
+}
+
+int SparArrayProd::getSize() {
+    return prod.getSize();
+}
+
+void ** SparArrayProd::getArray() {
+    return prod.getArray();
+}
+
+double SparArrayProd::lNorm(int base) {
+    return prod.lNorm(base);
+}
+
+double SparArrayProd::l2Norm() {
+    return prod.l2Norm();
+}
+
+double SparArrayProd::infNorm() {
+    return prod.infNorm();
+}
\ No newline at end of file
diff --git a/Suriya/MidtermProject/SparArray Class/main.cpp b/Suriya/MidtermProject/SparArray Class/main.cpp
new file mode 100644
index 0000000..163ae80
--- /dev/null
+++ b/Suriya/MidtermProject/SparArray Class/main.cpp	
@@ -0,0 +1,64 @@
+#include <iostream>
+#include "SparArray.h"
+using namespace std;
+
+int main() {
+    SparArray A = SparArray(3, 2);
+    double a[6] = {1, 0, 3, 0, 5, 0};
+    A.declareArray(a, 6);
+    cout << "Matrix A is: " << endl;
+    A.printArray();
+    cout<<endl;
+    A.printCompact();
+    cout << endl;
+    cout << "The inf norm of Matrix A is " << A.infNorm() << endl;
+
+    SparArray B = SparArray(2, 3);
+    double b[6] = {7, 0, 9, 0, 11, 0};
+    B.declareArray(b, 6);
+    cout << "Matrix B is: " << endl;
+    B.printArray();
+    cout<<endl;
+    B.printCompact();
+    cout << endl;
+    cout << "The L2 norm of Matrix B is " << B.l2Norm() << endl;
+
+    SparArrayProd C = SparArrayProd(A, B);
+    cout<<endl;
+    cout << "The product of matrices A and B is: " << endl;
+    C.printArray();
+    cout<<endl;
+    C.printCompact();
+    cout << endl;
+
+    cout<<"The Matrix A is: "<<endl;
+    double u[9] = {2, -1, 0, -1, 2, -1, 0, -1, 2};
+    SparArray U = SparArray(3,3);
+    U.declareArray(u,9);
+    U.printArray();
+    cout<<endl;
+
+    //manufactured solution
+    double p[3] = {1, 2, 2};
+    SparArray P = SparArray(3,1);
+    P.declareArray(p,3);
+
+    cout<<"The RHS is: "<<endl;
+    SparArrayProd UP = SparArrayProd(U,P);
+    UP.printArray();
+
+    SparArray Q = SparArray(3,1);
+    double q[3] = {0, 1, 2};
+    Q.declareArray(q,3);
+
+    GaussSolver soln1 = GaussSolver(U,Q);
+    cout<<endl;
+    cout<<"The Solution from Gaussian Elimination is: "<<endl;
+    soln1.printArray();
+
+    IterSolver soln2 = IterSolver(U,Q,1e-5);
+    cout<<endl;
+    cout<<"The Solution from CG method is: "<<endl;
+    soln2.printArray();
+
+}
\ No newline at end of file