BitsPleaseMSI · vineetmishra2451 · Oct 10, 2019 · Oct 10, 2019 · Oct 10, 2019 · Oct 10, 2019
diff --git a/e1.cpp b/e1.cpp
@@ -0,0 +1,14 @@
+#include<iostream>
+using namespace std;
+main()
+{
+    int a;
+    cout<<"enter a number"<<endl;
+    cin>>a;
+    if(a%2==0)
+    {
+        cout<<"Even"
+    }
+    else
+    cout<<"Odd";
+}
diff --git a/e1.c → e10.cpp b/e1.c → e10.cpp
diff --git a/e2.cpp b/e2.cpp
@@ -0,0 +1,16 @@
+
+
+
+
+#include<iostream> 
+using namespace std; 
+int main() 
+{ 
+    int num; 
+    cout<<"Enter the number:"<<endl; 
+    cin>>num; 
+    if(num>0) cout<<"Number is Positive"<<endl; 
+    else if(num==0) cout<<"Number is '0'"<<endl; 
+    else cout<<"Number is Negative"; 
+
+}
diff --git a/e10.c → e3.cpp b/e10.c → e3.cpp
diff --git a/e2.c → e4.cpp b/e2.c → e4.cpp
diff --git a/e3.c → e5.cpp b/e3.c → e5.cpp
diff --git a/e4.c → e6.cpp b/e4.c → e6.cpp
diff --git a/e5.c → e7.cpp b/e5.c → e7.cpp
diff --git a/e6.c → e8.cpp b/e6.c → e8.cpp
diff --git a/e7.c → e9.cpp b/e7.c → e9.cpp
diff --git a/h1.cpp b/h1.cpp
@@ -0,0 +1,26 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n=8,num=5,pattern[9][9];
+    //for first diogonal triangle
+    for(int i=0;i<=n/2;i++,num--)
+     for(int j=i;j<=n-i;j++)
+     {
+         pattern[i][j]=pattern[j][i]=num;          
+     }
+     num=5;
+     //for second diogonal triangle
+    for( int i=n;i>=n/2;i--,num--) 
+     for(int j=i;j>=n-i;j--)
+     {
+         pattern[i][j]=pattern[j][i]=num;
+     }
+     for(int i=0;i<=n;i++)
+     {
+       for(int j=0;j<=n;j++)
+       cout<<pattern[i][j]<<" ";
+     cout<<endl;
+     } 
+
+}  
diff --git a/e8.c → h2.cpp b/e8.c → h2.cpp
diff --git a/e9.c → h3.cpp b/e9.c → h3.cpp
diff --git a/m1.c → h4.cpp b/m1.c → h4.cpp
diff --git a/m10.c → h5.cpp b/m10.c → h5.cpp
diff --git a/m2.c → m1.cpp b/m2.c → m1.cpp
diff --git a/m3.c → m10.cpp b/m3.c → m10.cpp
diff --git a/m4.c → m11.cpp b/m4.c → m11.cpp
diff --git a/m5.c → m12.cpp b/m5.c → m12.cpp
diff --git a/m6.c → m13.cpp b/m6.c → m13.cpp
diff --git a/m7.c → m14.cpp b/m7.c → m14.cpp
diff --git a/m8.c → m15.cpp b/m8.c → m15.cpp
diff --git a/m9.c → m16.cpp b/m9.c → m16.cpp
diff --git a/p1.c → m17.cpp b/p1.c → m17.cpp
diff --git a/p2.c → m18.cpp b/p2.c → m18.cpp
diff --git a/p3_i.c → m19.cpp b/p3_i.c → m19.cpp
diff --git a/p3_ii.c → m2.cpp b/p3_ii.c → m2.cpp
diff --git a/p3_iii.c → m20.cpp b/p3_iii.c → m20.cpp
diff --git a/p3_iv.c → m21.cpp b/p3_iv.c → m21.cpp
diff --git a/p3_v.c → m22.cpp b/p3_v.c → m22.cpp
diff --git a/p4.c → m3.cpp b/p4.c → m3.cpp
diff --git a/p5.c → m4.cpp b/p5.c → m4.cpp
diff --git a/p6.c → m5.cpp b/p6.c → m5.cpp
diff --git a/p7.c → m6.cpp b/p7.c → m6.cpp
diff --git a/m7.cpp b/m7.cpp
diff --git a/m8.cpp b/m8.cpp
diff --git a/m9.cpp b/m9.cpp
diff --git a/p1.cpp b/p1.cpp
diff --git a/p2.cpp b/p2.cpp
diff --git a/p3_i.cpp b/p3_i.cpp
@@ -0,0 +1,14 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n;
+    cout<<"Enter no. of rows:";
+    cin>>n;
+    for(int i=0;i<n;i++)
+    { 
+      for(int j=0;j<=i;j++)
+        cout<<"*";
+     cout<<endl;    
+    } 
+}    
diff --git a/p3_ii.cpp b/p3_ii.cpp
diff --git a/p3_iii.cpp b/p3_iii.cpp
diff --git a/p3_iv.cpp b/p3_iv.cpp
diff --git a/p3_v.cpp b/p3_v.cpp
diff --git a/p4.cpp b/p4.cpp
diff --git a/p5.cpp b/p5.cpp
diff --git a/p6.cpp b/p6.cpp
diff --git a/p7.cpp b/p7.cpp
diff --git a/questions.txt b/questions.txt
@@ -46,6 +46,30 @@ MEDIUM
 
 10. Program to check if entered number is an Armstrong Number. 
 
+11. Program to convert Decimal Number to Binary
+
+12. Program to convert a Binary Number to Decimal Number  
+
+13. Program to convert Decimal Number to Octal Number 
+
+14. Program to convert a Octal Number to Decimal Number  
+
+15. Program to convert a Hexadecimal Number to Decimal Number  
+
+16. Program to convert Decimal Number to Hexadecimal Number 
+
+17. Program to evaluate a POSTFIX expression using Stack 
+
+18. Program to convert an INFIX expression to POSTFIX using Stack 
+
+19. Program to implement QUEUE using Linked List   
+
+20. Program to implement PRIORITY QUEUE using Linked List   
+
+21. Program to implement NON-CIRCULAR QUEUE using Arrays  
+
+22. Program to implement DEQUE using Linked List
+
 PRACTITIONER
 
 1. Program to reverse a number. 
@@ -97,3 +121,25 @@ v)  55555
       -  Push an element in Stack  
       -  Pop an element from Stack  
       -  Display the elements in Stack
+
+HARD
+
+1. Program to Print the following Pattern 
+    555555555 
+    544444445 
+    543333345 
+    543222345 
+    543212345 
+    543222345 
+    543333345 
+    544444445 
+    555555555  
+
+2. Program to implement the concept of Sparse Matrix   
+
+3. Program to demonstrate the use of storage classes like static, register, etc 
+
+4.  Program to demonstrate the use to static variables and functions. 
+
+5. Program to demonstrate the concept of inheritance
+