Python Programs

Author: OmkarPathak

OOP/P01_ClassDefinition.py

@@ -1,3 +1,4 @@
+#Author: OMKAR PATHAK
 #In this program we will see how to define a class
 
 class MyFirstClass():

OOP/P02_InstanceMethods.py

@@ -1,3 +1,4 @@
+#Author: OMKAR PATHAK
 #In this example we will be seeing how instance methods are used
 #Instance methods are accessed by: instance.method()
 

OOP/P03_InstanceAttributes.py

@@ -1,3 +1,4 @@
+#Author: OMKAR PATHAK
 #In this example we will be seeing how instance Attributes are used
 #Instance attributes are accessed by: object.attribute
 #Attributes are looked First in the instance and THEN in the class

OOP/P04_InitConstructor.py

@@ -1,3 +1,4 @@
+#Author: OMKAR PATHAK
 #This example shows the use of __init__ constructor
 
 class Vehicle():

OOP/P05_FirstProgramusingOOP.py

@@ -1,3 +1,4 @@
+#Author: OMKAR PATHAK
 #In this assignment we would see the use of OOP
 
 class MaxSizeList(object):

OOP/P06_Inheritance.py

@@ -1,3 +1,4 @@
+#Author: OMKAR PATHAK
 #This program illustrates the concept of inheritance
 #Python looks up for method in following order: Instance attributes, class attributes and the
 #from the base class

OOP/P07_MoreOnInheritance.py

@@ -1,3 +1,4 @@
+#Author: OMKAR PATHAK
 #This program illustrates the advanced concepts of inheritance
 #Python looks up for method in following order: Instance attributes, class attributes and the
 #from the base class

OOP/P08_MultipleInheritence.py

@@ -1,3 +1,4 @@
+#Author: OMKAR PATHAK
 #This program shows the order in which the classes are accessed in case of multiple inheritance
 #Python uses DEPTH FIRST SEARCH algorithm for lookups
 

Programs/P34_Stack.py

@@ -0,0 +1,47 @@
+#Author: OMKAR PATHAK
+#This program illustrates an example of Stack implementation
+#Stack Operations: push(), pop(), isEmpty(), top(), stackSize()
+
+class Stack(object):
+    def __init__(self, size):
+        self.index = []
+        self.size = size
+
+    def __str__(self):
+        myString = ' '.join(str(i) for i in self.index)
+        return myString
+
+    def push(self, data):
+        ''' Pushes a element to top of the stack '''
+        self.index.append(data)
+
+    def pop(self):
+        ''' Pops the top element '''
+        return self.index.pop()
+
+    def isEmpty(self):
+        ''' Checks whether the stack is empty '''
+        return len(self.index) == []
+
+    def isFull(self):
+        ''' Checks whether the stack if full '''
+        return len(self.index) == self.size
+
+    def top(self):
+        ''' Returns the top element of the stack '''
+        return self.index[-1]
+
+    def stackSize(self):
+        ''' Returns the current stack size '''
+        return len(self.index)
+
+if __name__ == '__main__':
+    myStack = Stack(10)
+    for i in range(0, 10):
+        myStack.push(i)
+    print(myStack.isEmpty())        #False
+    print(myStack.isFull())         #True
+    print(myStack)                  #0 1 2 3 4 5 6 7 8 9
+    print(myStack.stackSize())      #10
+    print(myStack.pop())            #9
+    print(myStack)                  #0 1 2 3 4 5 6 7 8