diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q1.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q1.cpp
new file mode 100644
index 0000000..2c4d88c
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q1.cpp	
@@ -0,0 +1,116 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int n,x;
+    int a,b,c;
+    int pos;
+    int key;
+    int array[100];
+    int ch = 0;
+    int flag = 0;
+    int choice;
+    while(true)
+    {
+        cout<<"--MENU--"<<endl;
+        cout<<"1.CREATE"<<endl;
+        cout<<"2.DISPLAY"<<endl;
+        cout<<"3.INSERT"<<endl;
+        cout<<"4.DELETE"<<endl;
+        cout<<"5.SEARCH"<<endl;
+        cout<<"6.EXIT"<<endl;
+        cout<<"Enter Your choice "<<endl;
+        cin>>choice;
+        switch(choice)
+        {
+
+
+           case 1:
+           {
+           cout<<"Enter the size of an array "<<endl;
+           cin>>n;
+           cout<<"Enter the elements of the array "<<endl;
+           for(int i=0; i<n; i++)
+           {
+               cin>>array[i];
+           }
+           break;
+           }
+
+
+
+           case 2:
+           {
+           cout<<"The Elements of the array are "<<endl;
+           for(int i=0; i<n; i++)
+           {
+               cout<<array[i]<<" ";
+           }
+           cout<<endl;
+           break;
+           }
+
+
+
+           case 3:
+           {
+           cout<<"REnter the element to be inserted "<<endl;
+           cin>>a;
+           cout<<"Enter the position at which element to be inserted "<<endl;
+           cin>>b;
+           for(int i = n; i>=b; i--)
+           {
+               array[i+1] = array[i];
+           }
+           array[b] = a;
+           break;
+           }
+
+
+           case 4:
+           {
+           cout<<"Enter the position of the element to be deleted "<<endl;
+           cin>>pos;
+           while(pos-1<n)
+           {
+               array[pos-1] = array[pos];
+               pos++;
+           }
+           n--;
+           break;
+           }
+
+           case 5:
+           {
+           cout<<"Enter the element to be searched "<<endl;
+           cin>>key;
+           for(int i=0;i<n;i++)
+           {
+               if(array[i] == key)
+               {
+                   flag = 1;
+                   c = i;
+                   break;
+               }
+           }
+           if(flag == 0)
+           cout<<"Element not found "<<endl;
+           else
+           {
+           cout<<"Element is found at index "<<c<<endl;
+           }
+           break;
+           }
+
+           case 6:
+           {
+               exit(0);
+           }
+
+           default:
+           cout<<"Invalid choice"<<endl;
+        }
+    }
+    return 0;
+}
+
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q2.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q2.cpp
new file mode 100644
index 0000000..f77c415
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q2.cpp	
@@ -0,0 +1,36 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n;
+    cout<<"Enter the size of the array "<<endl;
+    cin>>n;
+    int array[n];
+    cout<<"Enter the elements of the array "<<endl;
+    for(int i=0;i<n; i++)
+    {
+        cin>>array[i];
+    }
+    for(int i=0; i<n; i++)
+    {
+        int num = array[i];
+       for(int j=i+1; j<n; j++)
+       {
+           if(num == array[j])
+           {
+               while(j<n)
+               {
+                   array[j-1] = array[j];
+                   j++;
+               }
+               n--;
+           }
+       }
+    }
+cout<<"Final Array: "<<endl;
+for(int i=0; i<n; i++)
+{
+    cout<<array[i]<<" ";
+}
+return 0;
+}
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q4a.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q4a.cpp
new file mode 100644
index 0000000..039b9ee
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q4a.cpp	
@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int n;
+    cout<<"Enter the size of an array "<<endl;
+    cin>>n;
+    int array[n];
+    cout<<"Enter the elements of the array "<<endl;
+    for(int i=0;i<n;i++)
+    {
+        cin>>array[i];
+    }
+    cout<<"Array before reversing: "<<endl;
+    for(int i=0;i<n;i++)
+    {
+        cout<<array[i]<<" ";
+    }
+    cout<<endl;
+    cout<<"Array after reversing: "<<endl;
+    for(int i=n-1;i>=0; i--)
+    {
+        cout<<array[i]<<" ";
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q4b.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q4b.cpp
new file mode 100644
index 0000000..e9e87f2
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q4b.cpp	
@@ -0,0 +1,55 @@
+#include <iostream>
+using namespace std;
+int main()
+{
+    int n1, n2, n3;
+    cin>>n1>>n2>>n3;
+
+    int m1[n1][n2];
+    int m2[n2][n3];
+
+    for(int i=0;i<n1;i++)
+    {
+        for(int j=0;j<n2;j++)
+        {
+            cin>>m1[i][j];
+        }
+    }
+
+     for(int i=0;i<n2;i++)
+    {
+        for(int j=0;j<n3;j++)
+        {
+            cin>>m2[i][j];
+        }
+    }
+
+    int ans[n1][n3];
+     for(int i=0;i<n2;i++)
+    {
+        for(int j=0;j<n3;j++)
+        {
+            ans[i][j] = 0;
+        }
+    }
+
+    for(int i=0;i<n1;i++)
+    {
+        for(int j=0;j<n3;j++)
+        {
+           for(int k=0; k<n2;k++)
+           {
+               ans[i][j] += m1[i][k] * m2[k][j];
+           }
+        }
+    }
+    for(int i=0;i<n1; i++)
+    {
+        for(int j=0; j<n3; j++)
+        {
+            cout<<ans[i][j]<<" ";
+        }
+        cout<<endl;
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q4c.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q4c.cpp
new file mode 100644
index 0000000..6f20fc7
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q4c.cpp	
@@ -0,0 +1,36 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int i,j,m,n;
+    cout<<"Enter the number of rows "<<endl;
+    cin>>n;
+    cout<<"enter the number of columns "<<endl;
+    cin>>m;
+    int array[n][m];
+    for(int i=0;i<n;i++)
+    {
+        for(int j=0;j<m;j++)
+        {
+            cin>>array[i][j];
+        }
+    }
+    for(int i=0;i<n;i++)
+    {
+        for(int j=0;j<m;j++)
+        {
+            int temp = array[i][j];
+            array[i][j] = array[j][i];
+            array[j][i] = temp;
+        }
+    }
+    for(int i=0;i<n;i++)
+    {
+        for(int j=0; j<m;j++)
+        {
+          cout<<array[j][i]<<" ";
+        }
+        cout<<endl;
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q5.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q5.cpp
new file mode 100644
index 0000000..f3638dd
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q5.cpp	
@@ -0,0 +1,43 @@
+#include<iostream>
+using namespace std;
+int binarysearch(int n, int array[], int key)
+{
+    int s =0;
+    int e=n;
+    while(s<=e)
+    {
+        int mid = (s+e)/2;
+
+        if(array[mid] == key)
+        {
+            return mid;
+        }
+        else if(array[mid] > key)
+        {
+            e = mid - 1;
+        }
+        else
+        {
+            s = mid + 1;
+        }
+    }
+    return -1;
+}
+int main()
+{
+    int n;
+    cout<<"Enter the size of an array "<<endl;
+    cin>>n;
+    int array[n];
+    cout<<"Enter the elements in an array "<<endl;
+    for(int i=0; i<n; i++)
+    {
+        cin>>array[i];
+    }
+    int key;
+    cout<<"Enter the key to be searched "<<endl;
+    cin>>key;
+    cout<<binarysearch(n, array, key)<<endl;
+}
+
+
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q6.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q6.cpp
new file mode 100644
index 0000000..81dcae2
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q6.cpp	
@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int array[7] = {64,34,25,12,22,11,90};
+    int counter = 1;
+    while(counter < 7)
+    {
+       for(int i=0;i<7-counter;i++)
+       {
+           if(array[i]>array[i+1])
+           {
+               int temp;
+               temp = array[i];
+               array[i] = array[i+1];
+               array[i+1] = temp;
+           }
+       }
+       counter++;
+    }
+    for(int i=0;i<7;i++)
+    {
+        cout<<array[i]<<" ";
+    }
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q7.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q7.cpp
new file mode 100644
index 0000000..3d50884
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1/Q7.cpp	
@@ -0,0 +1,37 @@
+#include <iostream>
+using namespace std;
+int main()
+{
+    int n;
+    cout<<"Enter the size of an array "<<endl;
+    cin>>n;
+    int array[n];
+    cout<<"Enter the elements of the array "<<endl;
+    for(int i=0;i<n;i++)
+    {
+        cin>>array[i];
+    }
+    for(int i=0;i<n-1;i++)
+    {
+        for(int j=i+1;j<n;j++)
+        {
+            if(array[j] < array[i])
+            {
+                int temp;
+                temp = array[j];
+                array[j] = array[i];
+                array[i] = array[j];
+            }
+        }
+    }
+    for(int i=0; i<n; i++)
+    {
+        if(array[i+1] - array[i] == 2)
+        {
+            cout<<"The missing element of the sorted array is "<<array[i+1] - 1<<endl;
+        }
+    }
+    return 0;
+}
+
+
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_1_a.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_1_a.cpp
new file mode 100644
index 0000000..2a24ed4
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_1_a.cpp	
@@ -0,0 +1,25 @@
+#include <iostream>
+using namespace std;
+int main() {
+    int n;
+    cout<<"Enter the size of the matrix row "<<endl;
+    cin>>n;
+    int array[n];
+    cout<<"Enter the row majors now "<<endl;
+    for(int i=0; i<n; i++) {
+        cin>>array[i];
+    }
+    cout<<"The Diagnol Matrix is "<<endl;
+    for(int i=0; i<n; i++) {
+        for(int j=0; j<n; j++) {
+            if(i==j) {
+                cout<<array[i];
+            }
+            else {
+                cout<< 0;
+            }
+        }
+        cout<<endl;
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_1_b.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_1_b.cpp
new file mode 100644
index 0000000..773ec80
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_1_b.cpp	
@@ -0,0 +1,26 @@
+#include <iostream>
+using namespace std;
+int main() {
+    int n,k=0;
+    cout<<"Enter the diagnols "<<endl;
+    cin>>n;
+    int array[n];
+    cout<<"Enter the elements of the diagnol "<<endl;
+    for(int i=0; i<n; i++) {
+        cin>>array[i];
+    }
+    cout<<"The tridiagnol matrix is: "<<endl;
+    for(int i=0; i<4; i++) {
+        for(int j=0; j<4; j++) {
+            if(i == j || i-j == 1 || i-j == -1) {
+                cout<<array[k];
+                k++;
+            }
+            else {
+                cout<<0;
+            }
+        }
+        cout<<endl;
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_1_c.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_1_c.cpp
new file mode 100644
index 0000000..2ce117c
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_1_c.cpp	
@@ -0,0 +1,27 @@
+#include <iostream>
+using namespace std;
+int main () {
+    int n;
+    cout<<"Enter the size of the array "<<endl;
+    cin>>n;
+    int array[n][n];
+    cout<<"Enter the elements of the array "<<endl;
+    for(int i=0; i<n; i++) {
+        for(int j=0; j<n; j++) {
+            if(i<j) {
+                array[i][j] = 0;
+            }
+            else {
+                cin>>array[i][j];
+            }
+        }
+    }
+    cout<<"The Lower triangular matrix is "<<endl;
+    for(int i=0; i<n; i++) {
+        for(int j=0; j<n; j++) {
+            cout<<array[i][j]<<" ";
+        }
+        cout<<endl;
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_1_d.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_1_d.cpp
new file mode 100644
index 0000000..1ca8d0f
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_1_d.cpp	
@@ -0,0 +1,27 @@
+#include <iostream>
+using namespace std;
+int main() {
+    int n;
+    cout<<"Enter the size of the array "<<endl;
+    cin>>n;
+    int array[n][n];
+    cout<<"Enter the no of elemets of the array "<<endl;
+    for(int i=0; i<n; i++) {
+        for(int j=0; j<n; j++) {
+            if(i>j) {
+                array[i][j] = 0;
+            }
+            else {
+                cin>>array[i][j];
+            }
+        }
+    }
+    cout<<"The Upper triangular matrix is "<<endl;
+    for(int i=0; i<n; i++) {
+        for(int j=0; j<n; j++) {
+            cout<<array[i][j] <<" ";
+        }
+        cout<<endl;
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_3.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_3.cpp
new file mode 100644
index 0000000..a768662
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_3.cpp	
@@ -0,0 +1,31 @@
+#include <iostream>
+using namespace std;
+int main() {
+    int n,m,sum = 0;
+    cout<<"Enter the no of rows of the matrix "<<endl;
+    cin>>n;
+    cout<<"Enter the no of columns of the matrix "<<endl;
+    cin>>m;
+    int array[n][m];
+    cout<<"Enter the elements of the array "<<endl;
+    for(int i=0; i<n; i++) {
+        for(int j=0; j<m; j++) {
+            cin>>array[i][j];
+        }
+    }
+    for(int i=0; i<n; i++) {
+        for(int j=0; j<m; j++) {
+          sum = sum + array[i][j];
+    }
+    cout<<"The sum of "<< i <<" row = "<<sum<<endl;
+    sum =0;
+}
+    for(int i=0; i<n; i++) {
+        for(int j=0; j<m; j++) {
+            sum = sum + array[j][i];
+        }
+    cout<<"The sum of "<< i <<" column = "<<sum<<endl;
+    sum = 0;
+    }
+    return 0;
+}
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_4.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_4.cpp
new file mode 100644
index 0000000..699ce97
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_4.cpp	
@@ -0,0 +1,40 @@
+#include <iostream>
+using namespace std;
+int main() {
+    int n,m,k;
+    cout<<"Enter the no of rows in the 2-D matrix "<<endl;
+    cin>>n;
+    cout<<"Enter the no of columns in the 2-D array "<<endl;
+    cin>>m;
+    int array[n][m];
+    cout<<"Enter the elements of the 2-D array: "<<endl;
+    for(int i=0; i<n; i++) {
+        for(int j=0; j<m; j++) {
+            cin>>array[i][j];
+        }
+    }
+    
+    for(int i=0; i<n; i++) {
+
+        int row_min = array[i][0], col_index = 0;
+        for(int j=1; j<n; j++) {
+
+            if(row_min > array[i][j]) {
+
+                row_min = array[i][j];
+                col_index = j;
+            }
+        }
+
+        for(k=0; k<n; k++) {
+            if(row_min < array[k][col_index]){
+                break;
+            }
+        }
+        if(k == n) {
+            cout<<"The saddle point if found at "<<row_min<<endl;
+        }
+    }
+        cout<<"Saddle point is not found in the 2-D array "<<endl;
+   return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_5.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_5.cpp
new file mode 100644
index 0000000..5d48bba
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_5.cpp	
@@ -0,0 +1,47 @@
+#include <iostream>
+using namespace std;
+int main(){
+  int m,n;
+  cout<<"Enter the number of rows "<<endl;
+  cin>>m;
+  cout<<"Enter the number of columns "<<endl;
+  cin>>n;
+  int array[n][m];
+  cout<<"Enter the elements of the array "<<endl;
+  for(int i=0; i<n; i++) {
+      for(int j=0; j<m; j++) {
+          cin>>array[i][j];
+      }
+  }
+  // spiral order print
+
+  int row_start = 0, row_end = n-1, column_start = 0, column_end = m-1;
+  while(row_start <= row_end && column_start<= column_end) {
+
+      // for row start
+    for(int col = column_start; col<=column_end; col++) {
+        cout<< array[row_start][col]<<" ";
+    }
+    
+    row_start++;
+
+     // for column end
+    for(int row = row_start; row<=row_end; row++) {
+        cout<< array[row][column_end]<<" ";
+    }
+    column_end--;
+    
+    // for row end
+    for(int col= column_end; col>=column_start; col--) {
+        cout<< array[row_end][col]<<" ";
+    }
+    row_end--;
+
+    //for column start
+    for(int row=row_end; row>=row_start; row--) {
+        cout<< array[row][column_start]<<" ";
+    }
+    column_start++;
+  }
+  return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_e.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_e.cpp
new file mode 100644
index 0000000..856dd20
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_1a/assignment_e.cpp	
@@ -0,0 +1,44 @@
+#include <iostream>
+using namespace std;
+int main() {
+    int n,m;
+    bool flag = false;
+    cout<<"Enter the no of rows in the array "<<endl;
+    cin>>n;
+    cout<<"Enter the no of columns in the array "<<endl;
+    cin>>m;
+    int array1[n][m];
+    int array2[n][m];
+    cout<<"Enter the elements of the array "<<endl;
+    for(int i=0; i<n; i++) {
+        for(int j=0; j<n; j++) {
+            cin>>array1[i][j];
+        }
+    }
+     for(int i=0; i<n; i++) {
+        for(int j=0; j<n; j++) {
+            array2[i][j] = array1[i][j];
+        }
+    }
+    for(int i=0; i<n; i++) {
+        for(int j=i; j<m; j++) {
+            int temp = array1[i][j];
+            array1[i][j] = array1[j][i];
+            array1[j][i] = temp;
+        }
+    }
+    for(int i=0; i<n; i++) {
+        for(int j=0; j<m; j++) {
+           if(array1[i][j] != array2[i][j]) {
+               flag = true;
+               break;
+           }
+        }
+    }
+    if(flag) {
+        cout<<"No It is not symmetric matrix";
+    }
+    else {
+        cout<<"Yes it is symmetric matrix";
+    }
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_2/Q1.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_2/Q1.cpp
new file mode 100644
index 0000000..d6f9ca7
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_2/Q1.cpp	
@@ -0,0 +1,185 @@
+#include <bits/stdc++.h>
+using namespace std;
+class Node
+{
+    public:
+    int data;
+    Node *next;
+
+    Node(int data) {
+        this -> data = data;
+        next = NULL;
+    }
+};
+
+Node* takeInput_better() {
+ cout<<"Enter the data of your inked List: "<<endl;
+ int data;
+ cin>>data;
+ Node *head = NULL;
+ Node *tail = NULL;
+ while(data!= -1){
+    Node *newNode = new Node(data);
+    if(head == NULL){
+        head = newNode;
+        tail = newNode;
+    }
+    else {
+     tail -> next = newNode;
+     tail = tail -> next; 
+    }
+   cin>>data;
+ }
+ return head;
+}
+Node* begininsert(Node* head, int data) {
+
+    Node* newNode = new Node(data);
+    newNode -> next = head;
+    head = newNode;
+    return head;
+}
+Node* lastinsertion(Node* head, int data) {
+    Node* temp = head;
+    Node* newNode = new Node(data);
+    while(temp -> next != NULL) {
+        temp = temp -> next;
+    }
+    temp -> next = newNode;
+    return head;
+}
+Node* insertionbetween(Node* head, int data, int i){
+    Node* temp = head;
+    Node* newNode = new Node(data);
+    int count = 0;
+    while(count < i-1) {
+        temp = temp -> next;
+        count++;
+    }
+    newNode -> next = temp -> next;
+    temp -> next = newNode;
+    return head;
+}
+Node* deletefromBegin(Node* head) {
+    head = head -> next;
+    return head;
+}
+Node* deleteFromEnd(Node* head) {
+    Node* temp = head;
+    while(temp -> next -> next != NULL) {
+        temp = temp -> next;
+    }
+    temp -> next = NULL;
+    return head;
+}
+Node* deleteSpecific(Node* head, int i) {
+
+    Node* temp = head;
+    int count = 0;
+    while(count < i-1 && temp!= NULL) {
+        temp = temp -> next;
+        count ++;
+    }
+    if(temp != NULL){
+      Node* a = temp -> next;
+      Node* b = a -> next;
+      temp -> next = b;
+    }
+    return head;
+}
+Node* searchindex(Node* head, int x) {
+    Node* temp = head;
+    int count = 0;
+    while(temp != NULL) {
+       if(temp -> data == x) {
+          cout<<"The element is found at index: "<<count<<endl;
+          break;
+       }
+       else {
+           temp = temp -> next;
+           count++;
+       }
+    }
+}
+void print(Node *head){
+    Node *temp = head;
+
+    while(temp!=NULL){
+        cout<< temp -> data <<" ";
+        temp = temp -> next;
+    }
+    cout<<endl;
+}
+int main()
+{
+    cout<<"a) Insertion at the beginning "<<endl;
+    cout<<"b) Insertion at the end. "<<endl;
+    cout<<"c) Insertion in between. "<<endl;
+    cout<<"d) Deletion from the beginning. "<<endl;
+    cout<<"e) Deletion from the end. "<<endl;
+    cout<<"f) Deletion of a specific node, say 'Delete Node 60'). "<<endl;
+    cout<<"g) Search for a node and display its position from head. "<<endl;
+    cout<<"h) Display all the node values. "<<endl;
+    cout<<"Enter the linked list: "<<endl;
+    Node *head = takeInput_better();
+    int m = 1;
+    while(m == 1) {
+    char ch;
+    cout<<"Enter the operation you want to perform : "<<endl;
+    cin>>ch;
+    switch(ch) {
+      case 'a': {
+          int data;
+          cout<<"Enter the data you want to insert in beginning: "<<endl;
+          cin>>data;
+          head = begininsert(head, data);
+          break;
+      }
+      case 'b': {
+          int data;
+          cout<<"Enter the data you want to insert at the end: "<<endl;
+          cin>>data;
+          head = lastinsertion(head, data);
+          break;
+      }
+      case 'c' : {
+          int data, i;
+          cout<<"Enter the data and the index: "<<endl;
+          cin>>data>>i;
+          head = insertionbetween(head, data, i);
+          break;
+      }
+      case 'd' : {
+          head = deletefromBegin(head);
+          break;
+      }
+      case 'e' : {
+          head = deleteFromEnd(head);
+          break;
+      }
+      case 'f' : {
+          int i;
+          cout<<"Enter the index you want to get deleted: "<<endl;
+          cin>>i;
+          head = deleteSpecific(head, i);
+          break;
+      }
+      case 'g' : {
+          int x;
+          cout<<"Enter the key you want to search in linked list: "<<endl;
+          cin>>x;
+          head = searchindex(head, x);
+          break;
+      }
+      case 'h' : {
+          print(head);
+          break;
+      }
+      default:
+      cout<<"You entered wrong choice "<<endl;
+    }
+   cout<<"Do you want to perform more operation: "<<endl;
+   cin>>m;
+}
+return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_2/Q2.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_2/Q2.cpp
new file mode 100644
index 0000000..589aa35
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_2/Q2.cpp	
@@ -0,0 +1,75 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Node
+{
+    public:
+    int data;
+    Node *next;
+
+    Node(int data) {
+        this -> data = data;
+        next = NULL;
+    }
+};
+
+Node* takeInput_better() {
+ cout<<"Enter the data of your inked List: "<<endl;
+ int data;
+ cin>>data;
+ Node *head = NULL;
+ Node *tail = NULL;
+ while(data!= -1){
+    Node *newNode = new Node(data);
+    if(head == NULL){
+        head = newNode;
+        tail = newNode;
+    }
+    else {
+     tail -> next = newNode;
+     tail = tail -> next; 
+    }
+   cin>>data;
+ }
+ return head;
+}
+
+Node* repeat(Node* head, int x) {
+
+    Node* temp = head;
+    while(head -> data == x) {
+        head = head -> next;
+    }
+    while(temp -> next != NULL) {
+
+        if(temp -> next -> data == x) {
+            temp -> next = temp -> next -> next;
+        }
+        else {
+            temp = temp -> next;
+        }
+    }
+    return head;
+}
+
+void print(Node *head){
+    Node *temp = head;
+
+    while(temp!=NULL){
+        cout<< temp -> data <<" ";
+        temp = temp -> next;
+    }
+    cout<<endl;
+}
+int main()
+{
+    Node *head = takeInput_better();
+    print(head);
+    int x;
+    cout<<"Enter the key to be removed from linked list: "<<endl;
+    cin>>x;
+    head = repeat(head, x);
+    cout<<"The updated linked list is: "<<endl;
+    print(head);
+    return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_2/Q3.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_2/Q3.cpp
new file mode 100644
index 0000000..20c6c7e
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_2/Q3.cpp	
@@ -0,0 +1,69 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+class Node {
+
+    public:
+    int data;
+    Node* next;
+
+    Node(int data) {
+        this -> data = data;
+        next = NULL;
+    }
+};
+
+Node* takeinput_better() {
+    cout<<"Enter the data in your linked list: "<<endl;
+    int data;
+    cin>>data;
+    Node* head = NULL;
+    Node* tail = NULL;
+    while(data!= -1) {
+
+       Node* newNode = new Node(data);
+       if(head == NULL) {
+           head = newNode;
+           tail = newNode;
+       } 
+       else {
+           tail -> next = newNode;
+           tail = tail -> next;
+       }
+       cin>>data;
+    }
+    return head;
+}
+
+int length(Node* head) {
+    Node* temp = head;
+    int length = 0;
+    while(temp != NULL) {
+      temp = temp -> next;
+      length++;
+    }
+    temp = head;
+    int mid = (length -1)/2;
+    for(int i=0; i<mid; i++){
+        temp = temp -> next;
+    }
+    int curl = temp -> data;
+    return curl;
+}
+
+void print(Node* head) {
+
+    Node* temp = head;
+    while(temp != NULL) {
+        cout<< temp -> data <<" ";
+        temp = temp -> next;
+    }
+    cout<<endl;
+}
+
+int main() {
+   Node* head = takeinput_better();
+   print(head);
+   cout<<"The mid of the given linked list is: "<< length(head) <<endl;
+   return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_2/Q4.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_2/Q4.cpp
new file mode 100644
index 0000000..7bad9fa
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_2/Q4.cpp	
@@ -0,0 +1,68 @@
+#include <bits/stdc++.h>
+using namespace std;
+class Node
+{
+    public:
+    int data;
+    Node *next;
+
+    Node(int data) {
+        this -> data = data;
+        next = NULL;
+    }
+};
+
+Node* takeInput_better() {
+ cout<<"Enter the data of your inked List: "<<endl;
+ int data;
+ cin>>data;
+ Node *head = NULL;
+ Node *tail = NULL;
+ while(data!= -1){
+    Node *newNode = new Node(data);
+    if(head == NULL){
+        head = newNode;
+        tail = newNode;
+    }
+    else {
+     tail -> next = newNode;
+     tail = tail -> next; 
+    }
+   cin>>data;
+ }
+ return head;
+}
+
+Node* reverse(Node* head) {
+    if(head == NULL || head -> next == NULL) {
+        return head;
+    }
+    Node* smalloutput = reverse(head -> next);
+    Node* temp = smalloutput;
+    while(temp -> next !=NULL) {
+      temp = temp -> next;
+    }
+    temp -> next = head;
+    head -> next = NULL;
+    return smalloutput;
+}
+
+void print(Node *head){
+    Node *temp = head;
+
+    while(temp!=NULL){
+        cout<< temp -> data <<" ";
+        temp = temp -> next;
+    }
+    cout<<endl;
+}
+int main()
+{
+    Node *head = takeInput_better();
+    head = reverse(head);
+    cout<<"The reverse linked list is: "<<endl;
+    print(head);
+    return 0;
+}
+
+
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q1.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q1.cpp
new file mode 100644
index 0000000..ce2cc65
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q1.cpp	
@@ -0,0 +1,114 @@
+#include <iostream>
+#include <climits>
+using namespace std;
+template <typename T>
+class stackusingArray {
+   private:
+   T *data;
+   int nextIndex;
+   int capacity;
+
+   public:
+   stackusingArray() {
+       data = new T[4];
+       nextIndex = 0;
+       capacity = 4;
+   }
+
+   // return the no of elements present in my stack
+   int size () {
+       return nextIndex;
+   }
+
+   bool isEmpty() {
+       if(nextIndex == 0) {
+           return true;
+       }
+       else {
+           return false;
+       }
+   }
+   //insert element
+
+   void push(T element) {
+     if(nextIndex == capacity) {
+        T *newData = new T[2 * capacity];
+        for(int i=0; i<capacity; i++) {
+            newData[i] = data[i];
+        }
+        capacity *= 2;
+        delete []data;
+        data = newData;
+        
+        //  cout<<"Stack is Full "<<endl;
+        //  return;
+     }
+     data[nextIndex] = element;
+     nextIndex++;
+   }
+
+   //delete the element
+
+   T pop() {
+       if(isEmpty()) {
+           cout<< "Stack is empty "<<endl;
+           return 0;
+       }
+       nextIndex--;
+       return data[nextIndex];
+   }
+   // display the top most element
+
+   T peek() {
+        if(isEmpty()) {
+           cout<< "Stack is empty "<<endl;
+           return 0;
+       }
+       return data[nextIndex-1];
+   }
+};
+
+int main() {
+    stackusingArray<int> s;
+    int n;
+    int choice;
+    cout<<"Enter the optin from the given menu "<<endl;
+    cout<<"1.push() "<<endl;
+    cout<<"2.peek() "<<endl;
+    cout<<"3.pop() "<<endl;
+    cout<<"4.size() "<<endl;
+    cout<<"5.isEmpty() "<<endl;
+    do {
+    cout<<"enter your choice "<<endl;
+    cin>>choice;
+    switch(choice)
+    {
+    case 1: {
+    cout<<"Enter the element you want to push in the given stack "<<endl;
+    cin>>n;
+    s.push(n);
+    break;
+    }
+    case 2: {
+    cout<<"The top element of the stack is: "<< s.peek() <<endl;
+    break;
+    }
+    case 3: {
+    cout<<"The popped element of the stack is: "<< s.pop() <<endl;
+    break;
+    }
+    case 4: {
+    cout<<"The size of the stack is: "<< s.size() <<endl;
+    break;
+    }
+    case 5: {
+    cout<< s.isEmpty() <<endl;
+    break;
+    }
+    default: {
+        cout<<"Invalid choice "<<endl;
+    }
+    } 
+  } while(choice!=4);
+  return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q2.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q2.cpp
new file mode 100644
index 0000000..2f1ca13
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q2.cpp	
@@ -0,0 +1,35 @@
+#include <iostream>
+#include <climits>
+#include <stack>
+using namespace std;
+
+void reverseString(string s) {
+
+    stack <string> str;
+    for(int i=0; i<s.length(); i++) {
+        
+        string word = "";
+        string reverseWord = "";
+        while(s[i]!=' ' && i<=s.length()) {
+            word += s[i];
+            i++;
+        }
+        for(int j=word.length(); j>=0; j--) {
+            reverseWord += word[j];
+        }
+        str.push(reverseWord);
+    }
+    while(!str.empty()) {
+        cout<<str.top();
+        str.pop();
+    } 
+}
+
+int main() {
+   cout<<"Enter any string "<<endl;
+   string s;
+   getline(cin, s);
+   cout<<"The reversed string is: "<<endl;
+   reverseString(s);
+   return 0;
+}
\ No newline at end of file
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q3.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q3.cpp
new file mode 100644
index 0000000..afc579c
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q3.cpp	
@@ -0,0 +1,119 @@
+#include <iostream>
+#include <stack>
+#include <climits>
+using namespace std;
+
+bool isValid(string S) {
+
+    stack <char> st;
+    bool ans = true;
+    for(int i=0; i<S.size(); i++) {
+        if(S[i] == '(' || S[i] == '{' || S[i] == '[') {
+            st.push(S[i]);
+        }
+        else if(S[i] == ')') 
+        {
+            if(!st.empty() && st.top() == '(') {
+                st.pop();
+            } 
+            else {
+                ans = false;
+                break;
+            }
+        }
+        else if(S[i] == ']') 
+        {
+            if(!st.empty() && st.top() == '[') {
+                st.pop();
+            }
+            else {
+                ans = false;
+                break;
+            }
+        }
+        else if(S[i] == '}')
+        {
+            if(!st.empty() && st.top() == '{') {
+                st.pop();
+            }
+            else {
+                ans = false;
+                break;
+            }
+        }
+    }
+    if(!st.empty()) {
+        return false;
+    } 
+    else {
+        return ans;
+    }   
+}
+
+int main() {
+   string str;
+   cout<< "Enter the paranthesis to be checked "<<endl;
+   cin>>str;
+   if(isValid(str)) {
+       cout<< "The paranthesis expression are balanced "<< endl;
+   } 
+   else {
+       cout<< "The paranthesis expression are unbalanced "<<endl;
+   }
+   return 0;
+}
+
+
+// #include <iostream>
+// #include <stack>
+// #include <climits>
+// using namespace std;
+
+// bool checkValidString(string s) {
+//     stack <char> open;
+//     stack <char> star;
+//   for(int i=0; i<s.length(); i++)
+//    {
+//       if(s[i] == '(') {
+//           open.push(s[i]);
+//       }
+//       else if(s[i] == '*') {
+//           star.push(s[i]);
+//       }
+//       else 
+//         {
+//           if(!open.empty()) {
+//               open.pop();
+//           } 
+//           else if(!star.empty()) {
+//              star.pop();
+//           }
+//           else {
+//               return false;
+//           }
+//         }
+//     }
+//       while(!open.empty()) 
+//         {
+//           if(star.empty()) {
+//               return false;
+//           }
+//           else if(open.top() < star.top()) {
+//              open.pop();
+//              star.pop();
+//           }
+//           else {
+//               return false;
+//           }
+//         }
+//       return true;
+//   }
+
+
+
+
+
+
+// int main() {
+
+// }
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q4.cpp b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q4.cpp
new file mode 100644
index 0000000..2d0c3bf
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q4.cpp	
@@ -0,0 +1,66 @@
+#include <iostream>
+#include <math.h>
+#include <string>
+#include <stack>
+using namespace std;
+
+int prec(char c) {
+
+    if(c == '^') {
+        return 3;
+    }
+    else if(c == '*' || c=='/') {
+        return 2;
+    }
+    else if(c == '+' || c == '-') {
+        return 1;
+    }
+    else {
+        return -1;
+    }
+}
+
+string infixtoPostfix(string s) {
+    stack <char> st;
+    string res;
+
+    for(int i=0; i<s.length(); i++) {
+        if((s[i]>='a' && s[i]<='z') || (s[i]>='A' && s[i]<='Z')) {
+            res = res + s[i];
+        }
+        else if(s[i] == '(') {
+            st.push(s[i]);
+        }
+        else if(s[i] == ')') {
+            while(!st.empty() && st.top() != '(') {
+                    res = res + st.top();
+                    st.pop();
+            }
+            if(!st.empty()) {
+                st.pop();
+            }
+        }
+        else {
+            while(!st.empty() && prec(st.top())>prec(s[i])) {
+                res = res + st.top();
+                st.pop();
+            }
+            st.push(s[i]);
+        }
+    }
+    while(!st.empty()) {
+        res = res + st.top();
+        st.pop();
+    }
+    return res;
+}
+
+int main() {
+    string s;
+    cout<<"Enter the string in infix "<<endl;
+    cin>>s;
+    cout<<"The postfix string is "<<endl;
+    cout<<infixtoPostfix(s)<<endl;
+    return 0;
+}
+
diff --git a/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q5.CPP b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q5.CPP
new file mode 100644
index 0000000..d46606c
--- /dev/null
+++ b/Computer Science - BE/Sem 5/Sem 3/UCS301/Assignment_4/Q5.CPP	
@@ -0,0 +1,44 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int postfixEvaluation(string s) {
+  stack <int> st;
+  for(int i=0; i<s.size(); i++) {
+    if(s[i]>='0' && s[i]<='9') {
+        st.push(s[i] - '0');
+    }
+    else {
+        int op2 = st.top();
+        st.pop();
+        int op1 = st.top();
+        st.pop();
+
+        switch (s[i])
+        {
+        case '+':
+            st.push(op1+op2);
+            break;
+        case '-':
+            st.push(op1-op2);
+            break;
+        case '*':
+            st.push(op1*op2);
+            break;
+        case '/':
+            st.push(op1/op2);
+            break;
+        case '^':
+            st.push(pow(op1,op2));
+            break;    
+        }
+     }
+   }
+   return st.top();
+}
+int main() {
+  string s;
+  cout<<"Enter the string "<<endl;
+  getline(cin, s);
+  cout<<"The postfix evaluation comes out to be "<<postfixEvaluation(s)<<endl;
+  return 0;
+}
\ No newline at end of file