diff --git a/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/InvertedBar.cpp b/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/InvertedBar.cpp
new file mode 100644
index 00000000..7c00bc21
--- /dev/null
+++ b/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/InvertedBar.cpp
@@ -0,0 +1,23 @@
+#include <iostream>
+using namespace std;
+int main() {
+    int n, m=0;
+    cin>>n;
+    int a[n];
+    for(int i=0;i<n;i++){
+        cin>>a[i];
+        if(a[i]>m)
+            m=a[i];
+    }
+    for(int i=0;i<m;i++){
+    for(int i=0;i<n;i++){
+        if(a[i]==0)
+            cout<<" ";
+        else{
+            cout<<"*";
+            a[i]--;
+        }
+    }
+    cout<<"\n";
+    }
+}
diff --git a/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/grading_system.cpp b/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/grading_system.cpp
new file mode 100644
index 00000000..b76d87eb
--- /dev/null
+++ b/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/grading_system.cpp
@@ -0,0 +1,22 @@
+#include <iostream>
+#include<string.h>
+using namespace std;
+int main() {
+    int n;
+    cin>>n;
+    if(n>90){
+        cout<<"excellent";
+    }
+    else if(n>80 && n<=90){
+        cout<<"good";
+    }
+    else if(n>70 && n<=80){
+        cout<<"fair";
+    }
+    else if(n>60 && n<=70){
+        cout<<"meets expectations";
+    }
+    else if(n<=60){
+        cout<<"below par";
+    }    
+}
diff --git a/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/patterns1.cpp b/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/patterns1.cpp
new file mode 100644
index 00000000..cb1d75cc
--- /dev/null
+++ b/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/patterns1.cpp
@@ -0,0 +1,10 @@
+#include<iostream>
+int main(){
+    int n;
+    std::cin>>n;
+   for(int j=0;j<n;j++){
+    for(int i=0;i<=j;i++)
+       std::cout<<"*";
+   std::cout<<"\n";
+}
+}
diff --git a/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/reverse_an_array.cpp b/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/reverse_an_array.cpp
new file mode 100644
index 00000000..15cbbbbc
--- /dev/null
+++ b/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/reverse_an_array.cpp
@@ -0,0 +1,13 @@
+#include <iostream>
+using namespace std;
+int main() {
+    int n;
+    cin>>n;
+    int a[n], b[n];
+    for(int i=0;i<n;i++)
+        cin>>a[i];
+    for(int i=0;i<n;i++)
+        b[i]=a[n-1-i];
+    for(int i=0;i<n;i++)
+        cout<<b[i]<<" ";
+}
diff --git a/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/span_of_array.cpp b/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/span_of_array.cpp
new file mode 100644
index 00000000..01c0cd97
--- /dev/null
+++ b/IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/span_of_array.cpp
@@ -0,0 +1,14 @@
+#include <iostream>
+using namespace std;
+int main() {
+    int n,a,m=0,k=2147483647;
+    cin>>n;
+    for(int i=0;i<n;i++){
+        cin>>a;
+        if(a>m)
+          m=a;
+        if(a<k)
+          k=a;
+    }
+    cout<<m-k;
+}