string_programs

purohitdheeraj · purohitdheeraj · commit af4011830eff · 2021-02-20T16:41:48.000+05:30
diff --git a/Native-Datatypes/add_two_matrices.py b/Native-Datatypes/add_two_matrices.py
@@ -0,0 +1,30 @@
+X = [[12, 7, 3],
+    [4,5,6],
+    [7,8,9]]
+
+Y = [[5,8,1],
+    [6,7,3],
+    [4,5,9]]
+result = [[0,0,0],[0,0,0],[0,0,0]]
+# print(len(X))
+# print(len(X[0]))
+for i in range(len(X)):
+    for j in range(len(X[0])):
+        result[i][j] = X[i][j] + Y[i][j]
+
+for i in result:
+    print(i)
+
+# comprehension_result = [[X[i][j]+Y[i][j] for j in range(len(X[0]))] for i in range(len(X))]
+# for i in comprehension_result:
+#     print(i)
+# print(comprehension_result)
+
+# transpose of a matrix
+traspose_result = [[0,0,0],[0,0,0],[0,0,0]]
+for i in range(len(result)):
+    for j in range(len(X[0])):
+        traspose_result [i][j] = result[j][i]   #  here element in ith column will be placed in jth column and element in jth element will be placed in ith column. 
+
+for i in traspose_result:
+    print(i)
diff --git a/Native-Datatypes/multiply_two_matrices.py b/Native-Datatypes/multiply_two_matrices.py
@@ -0,0 +1,17 @@
+X = [[12, 7, 3],  
+[4, 5, 6],
+[7, 8, 9]]
+   #j-0  1  2  3 
+Y = [[5, 8, 1, 2], # k -0
+[6, 7, 3, 0], # k- 1
+[4, 5, 9, 1]] # k -2
+result = [[0,0,0,0],
+        [0,0,0,0],
+        [0,0,0,0]]
+
+for i in range(len(X)):
+    for j in range(len(Y[0])):
+        for k in range(len(Y)):
+            result[i][j] += X[i][k] * Y[k][j]
+for i in result:
+    print(i)
diff --git a/Native-Datatypes/palindrome_check.py b/Native-Datatypes/palindrome_check.py
@@ -0,0 +1,23 @@
+def len_of_string(word):
+    count = 0
+    for _ in word:  # here _ is throwaway variable...because we dont want it to be used to store any value
+        count += 1
+    return count # this function gives output of 7...like len() function of python. 
+
+
+def check_palindrome(word):
+    lo = 0
+    hi = len_of_string(word)-1
+    word = word.casefold()  # will convert all letters to lower case
+    print(word)
+    while lo <= hi:
+        if word[lo] != word[hi]:
+            print(word[lo],"and", word[hi], "are not matching!")
+            # print(word[hi])
+            return False
+        lo += 1
+        hi -= 1
+        
+    return True
+
+print(check_palindrome(' aBcdCbA ')) 
diff --git a/Native-Datatypes/remove_punctuation.py b/Native-Datatypes/remove_punctuation.py
@@ -0,0 +1,11 @@
+punctuation = ''' !()-[]{},:;'"<>./!@#$%^&*_-=|'''
+
+my_string = "HEllo !@ , he said -----_________-------- and went|.............._____-----__-_-____-----__"
+
+
+no_puntuation= ""
+for char in my_string:
+    if char not in punctuation:
+        no_puntuation += char
+
+print(no_puntuation.casefold()) 
diff --git a/Native-Datatypes/set_operations.py b/Native-Datatypes/set_operations.py
@@ -0,0 +1,17 @@
+E = {0, 2, 4, 6, 8}
+N = {1, 2, 3, 4, 5}
+
+print("Union operation in python sets: ", E|N)
+
+print("Intersection of E and N: ", E&N)
+
+print("Difference of E and N: ", E-N) # will be considered for E... 
+
+print("Symmetric Difference of E and N: ", E^N)  # jo dono sets me individually lie karta hai. 
+
+# also we have in-built functions in python for set operations
+print(E.union(N))
+print(E.intersection(N))
+print(E.difference(N))
+
+print(E.symmetric_difference(N))
diff --git a/Native-Datatypes/sorting_words_lexographically.py b/Native-Datatypes/sorting_words_lexographically.py
@@ -0,0 +1,12 @@
+def sort_em_all(sentence):
+    list_of_words = sentence.split()
+    list_of_words.sort()
+
+    return list_of_words
+    
+sentence = 'Hello this Is an Example sentence With cAsed LettErS.'
+
+result = sort_em_all(sentence)
+
+for i in result:
+    print(i, end=" ")
diff --git a/Native-Datatypes/vowel_count_in_sentence.py b/Native-Datatypes/vowel_count_in_sentence.py
@@ -0,0 +1,24 @@
+def count_vowel(sentence):
+
+    vowels = '''aeiou'''
+    vowel_count = 0
+    for char in sentence:
+        if char in vowels:
+            vowel_count += 1
+    return vowel_count
+
+sentence = 'Hello have you tried our tutorial section'
+
+print(count_vowel(sentence))
+
+def dict_vowel_count(sentence):
+    vowels = 'aeiou'
+    count_dict = {}.fromkeys(vowels, 0)
+
+    sentence = sentence.casefold()
+    for char in sentence:
+        if char  in count_dict:
+            count_dict[char] += 1
+    print(count_dict)
+
+dict_vowel_count("Hello have you tried our tutorial section")
diff --git a/functions/count_and_reverse.py b/functions/count_and_reverse.py
@@ -8,4 +8,4 @@ def reverse_num(num):
         length += 1
     return count, length
     
-print(reverse_num(123676767676))
+print(reverse_num(12))
diff --git a/functions/dec_to_binary.py b/functions/dec_to_binary.py
@@ -8,8 +8,8 @@ def dec_to_bin(num):
         result_arr.append(digit)
         binary += str(digit)
         num //= 2
-    
     result_arr.reverse()
+    
     return result_arr
 
 a = dec_to_bin(4)
diff --git a/functions/shuffle_card.py b/functions/shuffle_card.py
@@ -1,7 +1,8 @@
 import itertools, random
 def shuffle_card():
     deck = list(itertools.product(range(1, 14), ['Spade', "Heart", "Diamond", "Club"]))
-    random.shuffle(deck)
+    # random.shuffle(deck)
+    print(deck)
 
     for i in range(5):
         print(deck[i][0], "of", deck[i][1]) # here deck[i][0] -- 5 denotes to number and deck[i][1] denotes to card name -- Club
