Merge branch 'master' of https://github.com/o-goldensail/PythonProgramming

Author: o-goldensail

Week02/sequences_bilal_ayakdas.py

@@ -0,0 +1,26 @@
+
+my_list=[1,2,3,4,5]
+my_tuple=(1,2,3,4,5)
+my_set={1,2,3,4,5}
+my_dict={'name':'Bilal',
+           'surname':'Ayakdaş',
+            'age':'24',
+           'Job':'Full Stack Developer'}
+
+def remove_duplicates(my_list):
+    return list(set(my_list))
+
+def list_counts(my_list):
+    new_dict = dict()
+    for item in my_list:
+        if item  in new_dict:
+            new_dict[item] = new_dict[item] + 1
+        else:
+            new_dict[item] = 1
+    return new_dict
+
+def reverse_dict(my_dict):
+    new_dict = dict()
+    for i,j in my_dict.items():
+        new_dict[j] = i
+    return new_dict

Week02/sequences_melisa_sahin.py

@@ -0,0 +1,23 @@
+my_list = [4,5,6,7,8,8,8,9,2,2,3,3,3,3]
+my_tuple = (1,2,3,4)
+my_set = {"Blue", "Red", "Green", "Black", "White"}
+my_dict = {"Name" : "Melisa", "Surname" : "Sahin" , "Department" : "Comp_Eng" , "Number" : 200315046, "Uni" : "MCBU"}
+
+
+def remove_duplicates(my_list):
+    new_list = []
+    for i in my_list:
+        if i not in new_list:
+            new_list.append(i)
+    return new_list  
+
+
+def list_counts(my_list):
+    return {i : my_list.count(i) for i in my_list} 
+
+
+def reverse_dict(my_dict):
+    reversed_dict = {}
+    for key,value in my_dict.items():
+        reversed_dict[value] = key
+    return reversed_dict    

Week02/sequences_muhammet_berk_can.py

@@ -0,0 +1,40 @@
+
+my_list = ["Raw Prime Meat", True , 211, "Saddle"]
+my_tuple = "Rex","Pterenadon",215,False,("Raptor","Microraptor")
+my_dict = {"Narcotic" :" a tranquilizer", "duration_in_minute":10,}
+my_set = set(["42",64,"sdad","sad",64,42]) #duplicated values will be removed
+
+
+def remove_duplicates(my_list_):
+    #We shouldn't use sets for this method, because sets are unordered and if we use
+    # sets, our list will no longer be ordered, it will be random ordered.
+    non_duplicated_list = []
+    for item in my_list_:
+        if item not in non_duplicated_list:
+            non_duplicated_list.append(item)
+
+    return non_duplicated_list
+
+
+def list_counts(my_list_):
+    count_dictionary= {}
+
+    for item in my_list_:
+        if item not in count_dictionary:
+            count_dictionary[item] = 1
+        else:
+            count_dictionary[item] += 1
+
+    return count_dictionary
+
+def reverse_dict(dict):
+    #!!! If there are identical keys in dictionary, when they reversed, if they are integer
+    #    the result will be sum of those integer but if they are string, then
+    #    the result will be the last selected item.
+    reversed_dict = {}
+
+    for item in dict:
+        reversed_dict[dict[item]] = item
+
+    return reversed_dict
+

Week02/sequences_yavuz_selim.py

@@ -0,0 +1,24 @@
+my_list = [1,"Y",False,3.2,False]
+my_tuple = (5,13,36)
+my_set = {3,5,"hi",7,5}
+my_dict =  { "a": 100, "b":"B","c":True }
+
+def remove_duplicates(a_list):
+
+    return list(set(a_list))
+
+def list_counts(a_list):
+    a_dict = {}
+
+    for  i in a_list:
+        if i not in a_dict :
+            a_dict[i]=1
+        else:
+            a_dict[i]+=1
+    return a_dict
+
+def reverse_dict(a_dict):
+    new_dict = {}
+    for key, value in a_dict.items():
+        new_dict[value] = key
+    return new_dict

Week02/types_batuhan_ayyildiz.py

@@ -0,0 +1,4 @@
+my_int=8
+my_float=8.7
+my_bool=True
+my_complex=95+7j

Week02/types_bilal_ayakdas.py

@@ -0,0 +1,4 @@
+my_int=2
+my_float=3.99
+my_bool=False
+my_complex=5 + 4j

Week02/types_eren_yuksel.py

@@ -0,0 +1,4 @@
+my_int = 12
+my_float = 2.3
+my_bool = True
+my_complex = 3j

Week02/types_esra_basoglu.py

@@ -0,0 +1,4 @@
+my_int = 23
+my_float = 4.5
+my_bool = False
+my_complex = 2j

Week02/types_melisa_sahin.py

@@ -0,0 +1,4 @@
+my_int = 4
+my_float = 7.3
+my_bool = True
+my_complex = 1+9j

Week02/types_melisa_uyar.py

@@ -0,0 +1,4 @@
+my_int = 100
+my_float =0.5
+my_bool = True
+my_complex= 11 + 14j