reorganized the repository

Author: premaseem

README.md

@@ -5,4 +5,9 @@ def fibo(n):
         return 1
     return fibo(n-1) + fibo(n-2)
 
-print(fibo(7))
+def iter(n):
+    a,b = 0,1
+    for x in range(n):
+        a,b = b,a+b
+    return a
+print(iter(1))

algorithm/recursion/fibonacci.py

@@ -0,0 +1,101 @@
+## Challenge exercise - list, tuple, dictionary and functions.
+# Sample execution code is provided at the bottom, you may run it now
+# to see and get a feel for the existing output then build each function
+# and re-run the script.
+from collections import Counter
+
+buckets = [ ('john.doe@example.com',{'first_name':'john','last_name':'doe'}),
+            ('jane.doe@example.com',{'first_name':'jane','last_name':'doe'}),
+            ('derek.zoo@example.com',{'first_name':'derek','last_name':'zoolander'}),
+            ('murph.cooper@example.com',{'first_name':'murph','last_name':'cooper'}),
+            ('ned.stark@example.com',{'first_name':'ned','last_name':'stark'})
+            ]
+
+# Question 1: Create a function that returns all last names in the list
+# with the number of occurances of that last name, example 'doe': 2, 'stark': 1
+# use the Counter function from collections module to count the occurances with ease.
+def get_last_name_count(list_of_records):
+    """
+    fill in docstring
+    """
+    m = { }
+
+    for rec in list_of_records:
+        ln = rec[1].get("last_name")
+        if m.get(ln) is None:
+            m[ln] = 1
+        else :
+            m[ln] = m.get(ln) + 1
+
+    print("count map", m)
+    ## Write code below ##
+    pass
+    ## end of function ##
+
+
+# Question 2: Create a function that compares first and last names of records
+# given the email address, first and last names to compare. Exact matches only,
+# ignore case. Return True if exact match, return False otherwise.
+def compare_full_name(list_of_records, email, first_name, last_name):
+    """
+    fill in docstring
+    """
+    for rec in list_of_records:
+        if rec[1].get("first_name") == first_name and rec[1].get("last_name") == last_name:
+            return True
+
+    return False
+    ## Write code below ##
+
+    ## end of function ##
+
+# (CHALLENGE) Question 3: Create a function that can reset the value for first_name
+# and last_name for a record found with a specific email address
+# while leaving the rest of the list unchanged, if the email address
+# does not exist, then append a new record to the list with the new email
+# address, first name and last name.
+# Hint: Solutions use the enumerate function to track index of a record.
+def update_record(list_of_records, email, first_name, last_name):
+    """
+    fill in docstring
+    """
+    ## Write code below ##
+    pass
+    ## end of function ##
+
+def divider():
+    print()
+    print("-"*40)
+    print()
+
+print("The last names and their counts are as follows:")
+result = get_last_name_count(buckets)
+# un-comment the code below once your get_last_name_count function works
+# for k, v in result.items():
+#     print(f"{k}: {v}")
+divider()
+
+print("Does ned's first and last name match our records?")
+print(compare_full_name(buckets,'ned.stark@example.com','ned','stark'))
+print(compare_full_name(buckets,'john.doe@example.com','john','doe'))
+divider()
+
+print("Changing john's first name to jon and last name to snow")
+update_record(buckets,'john.doe@example.com','jon','snow')
+divider()
+
+print("Adding new record ironman@example.com")
+update_record(buckets,'ironman@example.com','iron','man')
+divider()
+
+print("Updated last names and their count are as follows:")
+result = get_last_name_count(buckets)
+# un-comment the code below once your get_last_name_count function works
+# for k, v in result.items():
+#     print(f"{k}: {v}")
+divider()
+
+print("Full list")
+for item in buckets:
+    record_email, full_name = item
+    print(f"Email: {record_email}, first name: {full_name['first_name']}, last_name: {full_name['last_name']}")

challenge/func_with_list.py

@@ -1,2 +1,4 @@
 import os
+from main_file import call_method
+import main_file as abc
 os.system("python3 main_file.py -d arg1 -p arg2 -e arg3")

concepts/calling_script/caller.py

@@ -1,5 +1,8 @@
 from optparse import OptionParser
 
+def call_method(arg = None):
+    print("method called with arg", arg)
+
 if __name__ == '__main__':
     # provide options
     parser = OptionParser()

concepts/calling_script/main_file.py

@@ -0,0 +1,28 @@
+def cheeseshop( *argum, **keywords1):
+    print("-- Do you have any",  "?")
+    for arg in argum:
+        print(arg)
+    print("-" * 40)
+    for kw in keywords1:
+        print(kw, ":", keywords1[kw])
+
+cheeseshop("Heart", "dick", "pussy",
+           vegina="Michael Palin",
+           client="John Cleese",
+           sketch="Cheese Shop Sketch")
+
+#############################################
+
+def parrot(voltage, state:'a stiff', action:'voom') -> bool:
+    print("-- This parrot wouldn't", action, end=' ')
+    print("if you put", voltage, "volts through it.", end=' ')
+    print("E's", state, "!")
+    return "return"
+
+# unpacked the dictionary
+dict = {"state": "a stiff", "action":"voom"}
+parrot("a", **dict)
+
+# unpacked the list and passed
+lst = ["a","b","c"]
+print(parrot(*lst) + parrot(*lst))

expiring_dict/expiringdict.py concepts/expiringdict.py

@@ -12,8 +12,11 @@
 # 2 second time and 3 third time
 def simpleGeneratorFun():
     yield 1
+    print("returned 1st yield")
     yield 2
+    print("returned 2nd yield")
     yield "3"
+    print("returned 3rd yield")
 
 o = simpleGeneratorFun()
 print(type(o))
@@ -24,7 +27,7 @@ def simpleGeneratorFun():
 print(next(o)); # In Python 3, __next__()
 print(next(o));
 print(next(o));
-print(next(o));
+# print(next(o));
 
 ######################################
 

concepts/function/function_args.py

@@ -0,0 +1,11 @@
+# In Python, you can pass in functions as arguments to other functions.
+# I have a function below that takes a function and a list as an argument and runs the function using the list as a parameter.
+def run_func(func_name, some_list):
+    return func_name(some_list)
+
+
+l1 = [6, 5, 4, 9, 10, 23, 12]
+print(run_func(sorted, l1))
+
+if "a" == "b":
+    pass

concepts/function/generator_function.py

@@ -0,0 +1,3 @@
+def function():
+    print("function called ")
+

concepts/function/pass_func_as_argument.py

@@ -0,0 +1,4 @@
+# import module101.function as func1
+from module101 import function
+
+function()

globalVars/my_module.py concepts/globalVars/my_module.py

@@ -0,0 +1,2 @@
+from .module201 import function1
+from concepts.imports_concept.package1.module101 import funciton1

concepts/imports_concept/__init__.py

@@ -0,0 +1,5 @@
+var1 = int(input("enter age?"))
+
+var2 = input("enter sex?")
+
+print(type(var1), type(var2))

concepts/imports_concept/package1/module101.py

@@ -61,4 +61,6 @@
 print(r)
 
 r = [(n1,n2) [n1 >n2] for n1,n2 in zip(a,b)]
-print(r)
+print(r)
+
+#####################

concepts/imports_concept/package1/module102.py

@@ -0,0 +1,49 @@
+# Else would be executed after the for loop and would be skipped with break
+
+#!/usr/bin/python3
+
+numbers = [11,33,55,39,55,75,37,21,23,41,13,2]
+
+for num in numbers:
+   if num%2 == 0:
+      print ('the list contains an even number')
+      break
+else:
+   print ('the list doesnot contain even number')
+
+#############################################
+lst = range(2,15,2)
+# for a in lst:
+#     print(a)
+
+#############################################
+# print reverse of string
+str = "aseem jain is a good man"
+newstr = ""
+for i in range(len(str)):
+    #print(str[i])
+    newstr = newstr + str[i]
+print(newstr)
+
+#############################################
+# iterating with index
+
+for index in range(len(str)):
+    print(str[index])
+
+
+#############################################
+
+# iterating with index using enumerator
+colors = ["red", "green", "blue", "purple"]
+for index, color in enumerate(colors):
+    print(f"{index} has {color}")
+
+
+#############################################
+
+colors = ["red", "green", "blue", "purple"]
+ratios = [0.2, 0.3, 0.1, 0.4]
+sizes = ["xs", "s","m","l"]
+for color, ratio, size in zip(colors, ratios, sizes):
+    print(color,ratio, size)

concepts/imports_concept/package2/module201.py

@@ -17,9 +17,13 @@
 
 ########################
 # creating a custom map
+# def my_map(f, lst):
+#     for i in lst:
+#         yield f(i)
+
+# generator comprehension
 def my_map(f, lst):
-    for i in lst:
-        yield f(i)
+    return (f(i) for i in lst)
 
 o = my_map(str.capitalize, names)
 print(next(o))

concepts/imports_concept/package2/module202.py

@@ -0,0 +1,18 @@
+from optparse import OptionParser
+
+prep_mode = None
+
+parser = OptionParser()
+parser.add_option("-m", "--mode",  dest="prep_mode", metavar="MYVAR",
+    help="(REQUIRED)")
+
+(options, args) = parser.parse_args()
+
+print(options.prep_mode)
+prep_mode = options.prep_mode
+
+if prep_mode is not None :
+    print("only prepping")
+else:
+    print("executing for real")
+

concepts/input.py

@@ -3,10 +3,10 @@
 import datetime
 
 t = datetime.time(5,25,1,44)
-print t
+print (t)
 
 today=datetime.date.today()
 d1 = datetime.date(25,2,2)
 d2 = datetime.date(5,2,2)
-print d1-d2
+print (d1-d2)
 

concepts/list_comprehension.py

@@ -3,15 +3,15 @@
 def interceptor(func):
 
     def wrapper_func():
-        print "code before call of func"
+        print "code before call of function"
         func()
-        print "code after call of func"
+        print "code after call of function"
     return wrapper_func
 
 def wrapper_func(func):
-    print "code before call of func"
+    print "code before call of function"
     func()
-    print "code after call of func"
+    print "code after call of function"
     return wrapper_func
 
 

concepts/loop/for.py

@@ -3,18 +3,18 @@
 list = [2,2.2,0," " ]
 count = 0
 for item in list :
-    print "index "+ str(count) +" has element ",
-    print item
+    print ("index "+ str(count) +" has element ")
+    print (item)
     count+=1
 
 for index,item in enumerate(list):
     if index >2 : break;
     print( index , item)
 
-lst = [2==2,2==3,4%2==0]
-print all(list)
+lst = [2==2,3==3,4%2==0]
+print (all(list))
 
-print complex(1,2)
+print (complex(1,2))
 er = complex('2+2j')
-print er
+print (er)
 

concepts/map_function.py

@@ -1,7 +1,7 @@
 # switch of choice and case of grade assignment
-choice = 85
+choice = 90
 try:
-    grade=  {90:"a",80:"b", 70:"c" } [choice]
+    grade=  {90:print("ais win"),80:"b", 70:"c" } [choice]
 except:
     grade ="unknown"
 print(grade)
@@ -12,5 +12,5 @@
 print("max")
 
 marks=99
-result = ("Fail","Pass") [marks > 70]
-print(result)
+result = ("Fail", "Pass")[marks > 70]
+print(result)