day6

Author: mahtab04

Day1/q1.py

@@ -1,7 +1,6 @@
-# Write a program which will find all such numbers which are divisible by 7 but are not a multiple of 5, 
+# Write a program which will find all such numbers which are divisible by 7 but are not a multiple of 5,
 # between 2000 and 3200 (both included).The numbers obtained should be printed in a comma-separated sequence on a single line.
 
 for i in range(2000,3201):
     if i%7==0 and i%5!=0:
         print(i,end=',')
-

Day6/q22.py

@@ -0,0 +1,21 @@
+# Generate a random number between 1 and 9 (including 1 and 9).
+# Ask the user to guess the number, then tell them whether they
+# guessed too low, too high, or exactly right. (Hint: remember to
+# use the user input lessons from the very first exercise)
+
+import random
+
+guess = random.randint(1, 20)
+
+print("Enter a number between 1-20: ")
+
+number = int(input())
+while guess != number:
+    if guess < number:
+        print("Your guess is too high, Try again!")
+    elif guess > number:
+        print("Your guess is too low, Try again!")
+
+    number = int(input("Enter a number again: "))
+
+print("You got it!")

Day6/q23.py

@@ -0,0 +1,28 @@
+# Implement Binary Search
+# Algorithm
+#     1.Keep track of two pointers First and Last, these are incremented or decremented to limit the part of the list to be searched.
+#     2.Find the middle element of the list: mid = ( length of the list )/2
+#     3.Compare the middle element with the value to be found
+#     4.Check if the middle element is lesser than the value to be found:
+#     5.If yes, the element must lie on the second half of the list
+#     6.If no, the element must lie on the first half of the list
+#     7.Repeat steps 1 through 3 until the element is found or the end of the list is reached.
+# Note:The array or list should be shorted.
+
+
+def binarySearch(ls, data):
+   first = 0
+   last = len(ls)-1
+   done = False
+   while first <= last and not done:
+       mid = (first+last)//2
+       if ls[mid] == data:
+           done = True
+       else:
+           
+            if ls[mid]>data:
+                last = last-1
+            else:
+                first = first+1
+    return done
+print(binarySearch([2,5,7,8,9,11,14,16],4))

Day6/q24.py

@@ -0,0 +1,15 @@
+# Take two lists, say for example these two:
+
+# 	a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]
+# 	b = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]
+# and write a program that returns a list that contains only the 
+# elements that are common between the lists (without duplicates).
+#  Make sure your program works on two lists of different sizes. 
+#  Write this in one line of Python using at least one list 
+#  comprehension. 
+
+a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]
+b = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]
+
+c = [n for n in a if n in b]
+print(c)

Day6/q25.py

@@ -0,0 +1,20 @@
+
+
+def prime(num):
+    if num > 1:
+        # check for factors
+        for i in range(2, num):
+            if (num % i) == 0:
+                print(num, "is not a prime number")
+
+                break
+            else:
+                print(num, "is a prime number")
+    else:
+        print(num, "is not a prime number")
+
+
+
+number = int(input("Enter a number to check whethe it's prime or not: "))
+
+print(prime(number))