Patch 2

Test2/P01_hello.py

@@ -0,0 +1,28 @@
+# Author: OMKAR PATHAK
+# This program prints the entered message
+
+def justPrint(text):
+    '''This function prints the text passed as argument to this function'''
+    print(text)
+    first_number = input("Enter a number: ")
+    second_number = input("Enter another number: ")
+    base_value = 10
+    increment_value=20
+    difference = increment_value - base_value
+    divide_value = increment_value / base_value
+    multiply_value = increment_value * base_value
+    floor_division = increment_value // base_value  # // -> integer division
+
+    print("Floor Division:", floor_division)
+    # print("Difference is:", increment_value - base_value)
+    print("Divide value is:", divide_value)
+    print("Multiply value is:", multiply_value)
+    print("Modulus:", increment_value % base_value )         # %  -> remainder
+    print('Addition is:', int(a) + int(b))
+
+if __name__ == '__main__':
+    justPrint('Hello Sindhuja')
+    justPrint('Hello Sindhuja')
+    justPrint('Hello Sindhuja')
+
+

Test2/P04_Factorial.py

@@ -0,0 +1,17 @@
+#Author: OMKAR PATHAK
+#This program finds the favtorial of the specified numbers
+#For example, factorial of 5 = 5*4*3*2*1 = 120
+
+def factorial(number):
+    '''This function finds the factorial of the number passed as argument'''
+    if number < 0:
+        print('Invalid entry! Cannot find factorial of a negative number')
+    if number == 0 or number == 1:
+        print("Hello")
+        return 1
+    else:
+        return number * factorial(number - 1)
+
+if __name__ == '__main__':
+    userInput = int(input('Enter the Number to find the factorial of: '))
+    print(factorial(userInput))

Test2/P05_Pattern.py

@@ -0,0 +1,112 @@
+#Author: OMKAR PATHAK
+#This program prints various patterns
+
+def pattern1(level):
+    '''This function prints the following pattern:
+
+    *
+    **
+    ***
+    ****
+
+    '''
+    for i in range(1, level + 1):
+        print()
+        for j in range(i):
+            print('*', end = '')
+
+def pattern2(level):
+    '''This function prints the following pattern:
+
+    ****
+    ***
+    **
+    *
+
+    '''
+    for i in range(level, 0, -1):
+        print()
+        for j in range(i):
+            print('*', end = '')
+
+def pattern3(level):
+    '''This function prints the following pattern:
+
+       *
+      **
+     ***
+    ****
+
+    '''
+    counter = level
+    for i in range(level + 1):
+        print(' ' * counter + '*' * i)
+        counter -= 1
+
+def pattern4(level):
+    '''This function prints the following pattern:
+
+    ****
+     ***
+      **
+       *
+
+    '''
+    counter = 0
+    for i in range(level, 0 ,-1):
+        print(' ' * counter + '*' * i)
+        counter += 1
+
+def pattern5(level):
+    '''This function prints the following pattern:
+
+      *
+     ***
+    *****
+
+    '''
+    # first loop for number of lines
+    for i in range(level + 1):
+        #second loop for spaces
+        for j in range(level - i):
+            print (" ",end='')
+        # this loop is for printing stars
+        for k in range(2 * i - 1):
+            print("*", end='')
+        print()
+
+
+if __name__ == '__main__':
+    userInput = int(input('Enter the level: '))
+    pattern1(userInput)
+    print()
+    pattern2(userInput)
+    print()
+    pattern3(userInput)
+    print()
+    pattern4(userInput)
+    print()
+    pattern5(userInput)
+    print()
+
+    def pattern6(userInput):
+        '''
+        following is the another approach to solve pattern problems with reduced time complexity 
+
+        for 
+
+        *
+        **
+        ***
+        ****
+        *****
+        '''
+
+        num = userInput
+        pattern = '*'
+        string = pattern * num
+        x = 0
+
+        for i in string:
+            x = x + 1
+            print(string[0:x])

Test2/P06_CharCount.py

@@ -0,0 +1,18 @@
+#Author: OMKAR PATHAK
+#This program checks for the character frequency in the given string
+
+def charFrequency(userInput):
+    '''This fuction helps to count the char frequency in the given string '''
+    userInput = userInput.lower() #covert to lowercase
+    dict = {}
+    for char in userInput:
+        keys = dict.keys()
+        if char in keys:
+            dict[char] += 1
+        else:
+            dict[char] = 1
+    return dict
+
+if __name__ == '__main__':
+    userInput = str(input('Enter a string: '))
+    print(charFrequency(userInput))

Test2/P07_PrimeNumber.py

@@ -0,0 +1,23 @@
+#Author: OMKAR PATHAK
+#This program checks whether the entered number is prime or not
+
+def checkPrime(number):
+    '''This function checks for prime number'''
+    isPrime = False
+    if number == 2:
+        print(number, 'is a Prime Number')
+    if number > 1:
+        for i in range(2, number):
+            if number % i == 0:
+                print(number, 'is not a Prime Number')
+                isPrime = False
+                break
+            else:
+                isPrime = True
+
+        if isPrime:
+            print(number, 'is a Prime Number')
+
+if __name__ == '__main__':
+    userInput = int(input('Enter a number to check: '))
+    checkPrime(userInput)

Test2/P20_OsModule.py

@@ -0,0 +1,13 @@
+#Author: OMKAR PATHAK
+#This program illustrates the example for os module in short
+
+import os
+import time
+
+print(os.getcwd()) #Prints the current working directory
+
+os.mkdir('newDir1')
+for i in range(1,10):
+    print('Here i is',i)
+    os.rename('newDir' + str(i),'newDir' + str(i + 1))
+    time.sleep(2)

Test2/P21_GuessTheNumber.py

@@ -0,0 +1,24 @@
+#Author: OMKAR PATHAK
+#This program guesses the randomnly generated number
+
+
+import random
+
+def guess():
+    ''' This function guesses the randomnly generated number '''
+    randomNumber = random.randint(0, 21)
+    count = 0
+
+    while True:
+        count += 1
+        number = int(input('Enter the number between 0 to 20: '))
+        if number < randomNumber:
+            print('Too small')
+        elif number > randomNumber:
+            print('Too large')
+        else:
+            print('You have got it in', count, 'tries')
+            break
+
+if __name__ == '__main__':
+    guess()

Test2/P22_SequentialSearch.py

@@ -0,0 +1,23 @@
+#Author: OMKAR PATHAK
+#This program is an example for sequential search
+
+def sequentialSearch(target, List):
+    '''This function returns the position of the target if found else returns -1'''
+    position = 0
+    global iterations
+    iterations = 0
+    while position < len(List):
+        iterations += 1
+        if target == List[position]:
+            return position
+        position += 1
+    return -1
+
+if __name__ == '__main__':
+    List = [1, 2, 3, 4, 5, 6, 7, 8]
+    target = 3
+    ans = sequentialSearch(target, List)
+    if ans != -1:
+        print('Target found at position:',ans,'in',iterations,'iterations')
+    else:
+        print('Target not found in the list')

Test2/P23_BinarySearch.py

@@ -0,0 +1,29 @@
+#Author: OMKAR PATHAK
+#This programs give an example of binary search algorithm
+
+def binarySearch(target, List):
+    '''This function performs a binary search on a sorted list and returns the position if successful else returns -1'''
+    left = 0 #First position of the list
+    right = len(List) - 1 #Last position of the list
+    global iterations
+    iterations = 0
+
+    while left <= right: #U can also write while True condition
+        iterations += 1
+        mid = (left + right) // 2
+        if target == List[mid]:
+            return mid
+        elif target < List[mid]:
+            right =  mid - 1
+        else:
+            left = mid + 1
+    return -1
+
+if __name__ == '__main__':
+    List = [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14]
+    target = 2
+    ans = binarySearch(target, List)
+    if(ans != -1):
+        print('Target found at position:',ans,'in',iterations,'iterations')
+    else:
+        print('Target not found')

Test2/P24_SelectionSort.py

@@ -0,0 +1,21 @@
+#Author: OMKAR PATHAK
+#This program shows an example of selection sort
+
+#Selection sort iterates all the elements and if the smallest element in the list is found then that number
+#is swapped with the first
+
+#Best O(n^2); Average O(n^2); Worst O(n^2)
+
+def selectionSort(List):
+    for i in range(len(List) - 1): #For iterating n - 1 times
+        minimum = i
+        for j in range( i + 1, len(List)): # Compare i and i + 1 element
+            if(List[j] < List[minimum]):
+                minimum = j
+        if(minimum != i):
+            List[i], List[minimum] = List[minimum], List[i]
+    return List
+
+if __name__ == '__main__':
+    List = [3, 4, 2, 6, 5, 7, 1, 9]
+    print('Sorted List:',selectionSort(List))

Test2/P25_BubbleSort.py

@@ -0,0 +1,24 @@
+#Author: OMKAR PATHAK
+#This program shows an example of bubble sort using Python
+
+#   Bubblesort is an elementary sorting algorithm. The idea is to
+#   imagine bubbling the smallest elements of a (vertical) array to the
+#   top; then bubble the next smallest; then so on until the entire
+#   array is sorted. Bubble sort is worse than both insertion sort and
+#   selection sort. It moves elements as many times as insertion sort
+#   (bad) and it takes as long as selection sort (bad). On the positive
+#   side, bubble sort is easy to understand. Also there are highly
+#   improved variants of bubble sort.
+
+#   Best O(n^2); Average O(n^2); Worst O(n^2)
+
+def bubbleSort(List):
+    for i in range(len(List)):
+        for j in range(len(List) - 1, i, -1):
+            if List[j] < List[j - 1]:
+                List[j], List[j - 1] = List[j - 1], List[j]
+    return List
+
+if __name__ == '__main__':
+    List = [3, 4, 2, 6, 5, 7, 1, 9]
+    print('Sorted List:',bubbleSort(List))

Test2/P26_InsertionSort.py

@@ -0,0 +1,25 @@
+#Author: OMKAR PATHAK
+#This program shows an example of insertion sort using Python
+
+#  Insertion sort is good for collections that are very small
+#  or nearly sorted. Otherwise it's not a good sorting algorithm:
+#  it moves data around too much. Each time an insertion is made,
+#  all elements in a greater position are shifted.
+
+#  Best O(n); Average O(n^2); Worst O(n^2)
+
+def insertionSort(List):
+    for i in range(1, len(List)):
+        currentNumber = List[i]
+        for j in range(i - 1, -1, -1):
+            if List[j] > currentNumber :
+                List[j], List[j + 1] = List[j + 1], List[j]
+            else:
+                List[j + 1] = currentNumber
+                break
+
+    return List
+
+if __name__ == '__main__':
+    List = [3, 4, 2, 6, 5, 7, 1, 9]
+    print('Sorted List:',insertionSort(List))