diff --git a/factorial-using-class.cpp b/factorial-using-class.cpp
new file mode 100644
index 0000000..810f694
--- /dev/null
+++ b/factorial-using-class.cpp
@@ -0,0 +1,49 @@
+#include<iostream>
+using namespace std;
+
+class factorial
+{
+        private:
+                int n,n1,f=1;
+        public:
+                void input();
+                void calc();
+                void display();
+};
+
+void factorial::input()
+{
+        cout<<"\nEnter any number :: ";
+        cin>>n;
+}
+
+void factorial::calc()
+{
+        n1=n;
+        if(n==0||n==1)
+        cout<<"\nFactorial of Number [ "<<n<<" ] is :: 1\n";
+        else
+        {
+             while(n>0)
+            {
+                        f=f*n;
+                        n--;
+            }
+        }
+
+}
+
+void factorial::display()
+{
+                cout<<"\nFactorial of [ "<<n1<<" ] is :: "<<f<<"\n";
+}
+
+int main ()
+{
+        factorial f;
+        f.input();
+        f.calc();
+        f.display();
+
+        return 0;
+}
\ No newline at end of file
diff --git a/queue-using-class.py b/queue-using-class.py
new file mode 100644
index 0000000..acb9e72
--- /dev/null
+++ b/queue-using-class.py
@@ -0,0 +1,51 @@
+class Queue(object):
+    def __init__(self, size):
+        self.queue = []
+        self.size = size
+
+    def __str__(self):
+        myString = ' '.join(str(i) for i in self.queue)
+        return myString
+
+    def enqueue(self, item):
+        if(self.isFull() != True):
+            self.queue.insert(0, item)
+        else:
+            print('Queue is Full!')
+
+    def dequeue(self):
+        if(self.isEmpty() != True):
+            return self.queue.pop()
+        else:
+            print('Queue is Empty!')
+
+    def isEmpty(self):
+        return self.queue == []
+
+    def isFull(self):
+        return len(self.queue) == self.size
+
+    def peek(self):
+        if(self.isEmpty() != True):
+            return self.queue[-1]
+        else:
+            print('Queue is Empty!')
+
+
+if __name__ == '__main__':
+    myQueue = Queue(20)
+    myQueue.enqueue(41)
+    myQueue.enqueue(35)
+    myQueue.enqueue(62)
+
+    print(myQueue)
+
+    myQueue.enqueue(1)
+    myQueue.enqueue(2)
+    myQueue.enqueue(3)
+
+    print(myQueue)
+
+    myQueue.dequeue()
+
+    print(myQueue)