new programs

Author: hemangsk

Basic/functions.py

@@ -0,0 +1,39 @@
+def add(x, y):
+    return x + y
+    #Evaluates x + y and returns the INTEGER result back to the point where this function was called from.
+
+def sub(a, b):
+    return a - b
+
+def mult(p, r):
+    return p * r
+
+def div(a, b):
+    return a / b
+
+def remainder(m,n):
+    return m % n
+
+print(" ** CALCULATOR ** ")
+print("Enter two numbers")
+a = input()
+b = input()
+
+#Suppose user enters 3 and 5, Then a = "3", b = "5", "3" and "5" are strings
+#But we need a = 3, and not "3" and b = 5, and not "5", so that they become integers and then we can perform arithmetic operations.
+
+a = int(a) # This line converts whatever is stored in a to INTEGER Type and assigns that value to a.
+b = int(b) # This line converts whatever is stored in b to INTEGER Type and assigns that value to b again.
+
+#SO simply put, int function converts variables to INTEGER data type
+# And similiarly, there is an str() function which converts variables to STRING data type
+
+print("\n\nResults!")
+
+# Suppose I entered a=1, b=2 then this happens,
+
+print(add(a,b))     #Addition, add(a,b) becomes --> 3, 3 gets printed on screen.
+print(sub(a,b))     #Subtraction, sub(a,b) --> -1
+print(div(a,b))     #Division, div(a,b) --> 0
+print(mult(a,b))    #Multiplication, mult(a,b) -> 2
+print(remainder(a,b))   #Remainder, remainder(a,b) -> 1

Data Structures/queue/hotpotato.py

@@ -0,0 +1,29 @@
+class Queue:
+    def __init__(self):
+        self.queue = []
+    def enqueue(self, item):
+        self.queue.insert(0, item)
+    def dequeue(self):
+        return self.queue.pop()
+    def size(self):
+        return len(self.queue)
+    def isEmpty(self):
+        return self.queue == []
+
+def hotPotato(people, iteration):
+    length = len(people)
+    q = Queue()
+
+    for x in people:
+        q.enqueue(x)
+
+    while(q.size() > 1):
+        for i in range(0, iteration):
+            item = q.dequeue()
+            q.enqueue(item)
+
+        q.dequeue()
+
+    return q.dequeue()
+
+print hotPotato(["Hemang", "Rahul", "Totem", "Hero"], 7)

Data Structures/queue/printingTasks.py

@@ -0,0 +1,80 @@
+import random
+
+class Queue:
+    def __init__(self):
+        self.queue = []
+    def enqueue(self, item):
+        self.queue.insert(0, item)
+    def dequeue(self):
+        return self.queue.pop()
+    def size(self):
+        return len(self.queue)
+    def isEmpty(self):
+        return self.queue == []
+
+class Printer:
+    def __init__(self, ppm):
+        self.pagerate = ppm
+        self.currentTask = None
+        self.timeRemaining = 0
+
+    def tick(self):
+        if self.currentTask != None:
+            self.timeRemaining = self.timeRemaining - 1
+            if self.timeRemaining <= 0:
+                self.currentTask = None
+
+    def busy(self):
+        return self.currentTask != None
+
+    def startNext(self, newtask):
+        self.currentTask = newtask
+        self.timeRemaining = newtask.getPages() * 60/self.pagerate
+
+
+class Task:
+    def __init__(self, time):
+        self.timestamp = time
+        self.pages = random.randrange(1,21)
+
+    def getStamp(self):
+        return self.timestamp
+
+    def getPages(self):
+        return self.pages
+
+    def waitTime(self, currenttime):
+        return currenttime - self.timestamp
+
+
+def simulation(numSeconds, pagesPerMinute):
+
+    labprinter = Printer(pagesPerMinute)
+    printQueue = Queue()
+    waitingtimes = []
+
+    for currentSecond in range(numSeconds):
+
+      if newPrintTask():
+         task = Task(currentSecond)
+         printQueue.enqueue(task)
+
+      if (not labprinter.busy()) and (not printQueue.isEmpty()):
+        nexttask = printQueue.dequeue()
+        waitingtimes.append(nexttask.waitTime(currentSecond))
+        labprinter.startNext(nexttask)
+
+      labprinter.tick()
+
+    averageWait=sum(waitingtimes)/len(waitingtimes)
+    print("Average Wait %6.2f secs %3d tasks remaining."%(averageWait,printQueue.size()))
+
+def newPrintTask():
+    num = random.randrange(1,181)
+    if num == 180:
+        return True
+    else:
+        return False
+
+for i in range(10):
+    simulation(3600,5)

Data Structures/stack/palindromeChecker.py

@@ -0,0 +1,41 @@
+class Stack:
+
+    def __init__(self):
+        self.stack = []
+    def push(self, item):
+        self.stack.append(item)
+    def pop(self):
+        return self.stack.pop()
+    def isEmpty(self):
+        return self.stack == []
+    def size(self):
+        return len(self.stack)
+    def __str__(self):
+        stack_str = ""
+        for x in self.stack:
+            stack_str += x
+        return stack_str
+
+
+list1 = Stack()
+list2 = Stack()
+def stringToStack(string):
+    for x in string:
+        list1.push(x)
+
+def makeListTwo(list):
+    length = list.size()/2
+    while(length > 0):
+        list2.push(list1.pop())
+        length = length - 1
+def compareLists(list1, list2):
+    print(list1)
+    print(list2)
+    return
+
+def doTask():
+    stringToStack("abba")
+    makeListTwo(list1)
+    print(compareLists(list1, list2))
+
+doTask()