Sindhu python

Programs/P02_VariableScope.py

@@ -10,7 +10,9 @@ def test():
     y = 100  # Local y
     x = 20
     print(x + y) #prints 'Local x' and  'Local y'
+    print("Variable scope")
 
 if __name__ == '__main__':
     test()
     print(x) #prints 'Global x'
+

Test001/P10_LCM.py

@@ -0,0 +1,19 @@
+#Author: OMKAR PATHAK
+#This program calculates the LCM of the two numbers entered by the user
+
+def LCM(number1, number2):
+    '''This function calculates LCM of two numbers inputed by the user'''
+    maximum = max(number1, number2)
+    i = maximum
+    while True:
+        if (i % number1 == 0  and i % number2 == 0):
+            lcm = i
+            break
+        i += maximum
+
+    return lcm
+
+if __name__ == '__main__':
+    userInput1 = int(input('Enter first number: '))
+    userInput2 = int(input('Enter second number: '))
+    print('LCM of {} and {} is {}'.format( userInput1, userInput2, LCM(userInput1, userInput2)))

Test001/P11_BinaryToDecimal.py

@@ -0,0 +1,17 @@
+#Author: OMKAR PATHAK
+#This program converts the given binary number to its decimal equivalent
+
+def binaryToDecimal(binary):
+    '''This function calculates the decimal equivalent to given binary number'''
+    binary1 = binary
+    decimal, i, n = 0, 0, 0
+    while(binary != 0):
+        dec = binary % 10
+        decimal = decimal + dec * pow(2, i)
+        binary = binary//10
+        i += 1
+    print('Decimal equivalent of {} is {}'.format(binary1, decimal))
+
+if __name__ == '__main__':
+    userInput = int(input('Enter the binary number to check its decimal equivalent: '))
+    binaryToDecimal(userInput)

Test001/P12_DecimalToBinary.py

@@ -0,0 +1,13 @@
+#Author: OMKAR PATHAK
+#Program to convert decimal to its equivalent binary
+
+def decimalToBinary(n):
+   '''Function to print binary number for the input decimal using recursion'''
+   if n > 1:
+       decimalToBinary(n//2)
+   print(n % 2,end = '')
+
+if __name__ == '__main__':
+    userInput = int(input('Enter the decimal number to find its binary equivalent: '))
+    decimalToBinary(userInput)
+    print()

Test001/P13_Palindrome.py

@@ -0,0 +1,14 @@
+#Author: OMKAR PATHAK
+#This program checks for the palindrome
+
+def palindrome(string):
+    '''This function checks the string for palindrome'''
+    revString = string[::-1]
+    if string == revString:
+        print('String is Palindrome')
+    else:
+        print('String is not Palindrome')
+
+if __name__ == '__main__':
+    userInput = str(input('Enter a string to check for Palindrome: '))
+    palindrome(userInput)

Test001/P14_CheckGreater.py

@@ -0,0 +1,15 @@
+#Author: OMKAR PATHAK
+#This prpgram checks that the given number is greater than all those numbers in th list
+
+def checkGreater(number):
+    '''This function checks whether the entered number is greater than those in the list'''
+    original = [1,2,3,4,5]
+    original.sort()
+    if number > original[-1]:
+        print('Yes, the entered number is greater than those in the list')
+    else:
+        print('No, entered number is less than those in the list')
+
+if __name__ == '__main__':
+    userInput = int(input('Enter the number to check: '))
+    checkGreater(userInput)

Test001/P15_Arguments.py

@@ -0,0 +1,17 @@
+#Author: OMKAR PATHAK
+#This program gives a demo of how can you pass arguments while running python programs
+#Run the program as: python P15_Arguments.py Omkar Pathak
+
+import sys
+
+def arguments():
+    '''This function prints the argruments passed while running the python program'''
+    try:
+        print('This is the name of the script:', sys.argv[0])
+        print('First argument:', sys.argv[1])
+        print('Second argument:', sys.argv[2])
+    except IndexError:
+        print('Give only two arguments')
+
+if __name__ == '__main__':
+    arguments()

Test001/P16_CountVowels.py

@@ -0,0 +1,17 @@
+#Author: OMKAR PATHAK
+#This program counts the vowels present in the user input
+
+def countVowels(sentence):
+    '''This function counts the vowels'''
+    count = 0
+    sentence = sentence.lower()
+    for c in sentence:
+        if c in ['a', 'e', 'i', 'o', 'u']:
+            count += 1
+    return count
+
+
+if __name__ == '__main__':
+    userInput = str(input("Enter the string to check for vowels: "))
+    count = countVowels(userInput)
+    print('Vowel Count: ',count)

Test001/P17_EvenOdd.py

@@ -0,0 +1,19 @@
+#Author: OMKAR PATHAK
+#This program takes input from user and sorts the numbers in two arrays, one of even and other of odd
+
+def evenOdd(numbers):
+    '''This function divides the numbers in two arrays one of even and other of odd'''
+    even = []
+    odd = []
+    for number in numbers:
+        if int(number) % 2 == 0:
+            even.append(number)
+        else:
+            odd.append(number)
+    return even, odd
+
+if __name__ == '__main__':
+    userInput = input("Enter the numbers (space separated) to check: ")
+    userInput = list(userInput.split())
+    even, odd = evenOdd(userInput)
+    print('Even Nos: ', ','.join(even), '\n', 'Odd Nos: ', ','.join(odd))

Test001/P18_Logging.py

@@ -0,0 +1,22 @@
+#Author: OMKAR PATHAK
+#This program illustrates a logging example
+import logging
+
+def log(number):
+    ''' This function creates a log file if any error is reported '''
+    logging.basicConfig(filename = 'P18-logfile.txt', level = logging.INFO)
+    try:
+        if int(number) % 2 == 0:
+            print('Successful')
+        else:
+            print('Unsuccessful, this instance will be reported, check the log file')
+            logging.info('Invalid Entry')
+    except:
+        print('Please enter a valid integer')
+
+if __name__ == '__main__':
+    try:
+        userInput = int(input('Enter a number: '))
+        log(userInput)
+    except:
+        print('Please enter a valid integer')

Test001/P19_SimpleStopWatch.py

@@ -0,0 +1,45 @@
+#Author: OMKAR PATHAK
+#This program illustrates a stopwatch
+
+import time
+
+print('Press ENTER to begin, Press Ctrl + C to stop')
+while True:
+    try:
+        input() #For ENTER
+        starttime = time.time()
+        print('Started')
+    except KeyboardInterrupt:
+        print('Stopped')
+        endtime = time.time()
+        print('Total Time:', round(endtime - starttime, 2),'secs')
+        break
+# Press enter to start and stop the watch
+"""
+import time
+
+print('Press Enter to begin, Press Enter again to stop')
+if input()=='':
+    starttime = time.time()
+    print('Started')
+    while True:
+            val=input() #For ENTER
+            if val=='':
+                print('Stopped')
+                endtime = time.time()
+                print('Total Time:', round(endtime - starttime, 2),'secs')
+                break
+
+"""
+
+"""
+Output:
+Press Enter to begin, Press Enter again to stop
+
+Started
+
+Stopped
+Total Time: 1.05 secs
+
+"""
+

Test001/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)

Test001/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()

Test001/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')

Test001/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')

Test001/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))

Test001/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))

Test001/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))