Merge branch 'master' of https://github.com/RisingLight/Python_Practice

Author: imabhishekkumar

Challenge questions/Readme.md

@@ -15,10 +15,15 @@ Wish to give a challenge? sure just make an edit, and throw the pull request ;)
 
 ## Challenge:
 1.	Write a Code that accepts String in a format like "My name is someone", then it has to be formatted into "MyNameIsSomeone" and then back to original
-2.	***Challenge Awaits***
-3.	***Challenge Awaits***
-4.	***Challenge Awaits***
-5.	***Challenge Awaits***
+2.	Write a Code that accepts the inversemod of num to inversemodnum  -> num inverse% inversemodnum = ?
+3.	Write a Code that scrambles the words by following the rules below:
+		a)Words less than or equal to 3 characters need not be scrambled .
+		b)Don't scramble first and last char, so Scrambling can become Srbmnacilg or Srbmnailcg or Snmbracilg , i.e. letters except first and last can be scrambled in any order .
+		c)Punctuation at the end of the word to be maintained as is i.e. "Surprising," could become "Spsirnirug," but not "Spsirn,irug" .
+		d)Following punctuation marks are to be supported - Comma Question mark, Full stop, Semicolon, Exclamation .
+		e)Do this for a file and maintain sequences of lines .
+4.	Reading from a CSV file and printing all colums as rows.
+5.	Given Strings of code equations like, "45 >= 67 56==70 30 <= 78" and output should be binary "0 0 1" { input is seprated with space and output should be on new line}
 6.	***Challenge Awaits***
 7.	***Challenge Awaits***
 ---------------------------------------------------------------------------------------------------------------------------------------

Challenge questions/TejaSreeChand/output.txt

@@ -0,0 +1 @@
+This wlil slreuy get sbraclemd This is aa ionsfys pjoecrt It scaembrls the leertts in eervy word of eervy snctcenee in the gevin file

Challenge questions/TejaSreeChand/word.txt

@@ -0,0 +1 @@
+ This will surely get scrambled This is a infosys project It scrambles the letters in every word of every scentence in the given file

Challenge questions/TejaSreeChand/wordscramb challenge3 .py

@@ -0,0 +1,35 @@
+import random
+import os
+def shuf(string):
+    ltemp=string[1:len(string)-1]       # taking only the mid part { change it into string[0:len(string)] for a full words shuffle
+    ltemp=list(ltemp)                   # convert the word into alphabet list eg: "hey" -> ["h","e","y"]
+    random.shuffle(ltemp)               # shuffles the alphabet
+    ltemp="".join(ltemp)                # join the alphabet back to a word
+    ltemp=string[0]+ltemp+string[len(string)-1]     # add the first and the end alphabet to the word
+    return ltemp                                # returns the shuffled word
+
+def filewrite(stext):
+    f=open("output.txt","w")
+    f.write(stext)
+    
+
+def wordscramble():
+    #f=open("word.txt","r")
+    fn=input("Enter file name:")
+    f=open(fn,"r")
+    text=f.read()
+    print("The text before scrambling:", text)
+    text=text.split()               # this splits words from string        
+    stext=[]                        #scramble list { empty }
+    for i in range(len(text)):
+        stext.append(shuf(text[i])) # shuffles the word mid part only , starting and ending alphabets are not touched
+    stext=" ".join(stext)
+    print("The text after scrambling:")                            # joins the words into a string again
+    print(stext)
+    filewrite(stext)
+    
+
+     
+wordscramble()  # scramble's the file text 
+
+

Challenge questions/adarshrise/ch 2 inverse mod1.py

@@ -0,0 +1,19 @@
+extract=[]
+def mod(a,modnum):
+    global extract
+    left=0
+    addnum=0
+    for i in range(0,modnum):
+        if((modnum-a*i)>0):
+            left=i
+            addnum=modnum-a*i
+            continue
+        break
+    if(addnum != 1):
+        extract.append(mod(addnum,a))
+    return left,addnum
+
+print(mod(11,26))
+print(extract)
+            
+    

Challenge questions/adarshrise/ch2 inverse mod2.py

@@ -0,0 +1,16 @@
+def egcd(a, b):
+    if a == 0:
+        return (b, 0, 1)
+    else:
+        g, y, x = egcd(b % a, a)
+        return (g, x - (b // a) * y, y)
+
+def modinv(a, m):
+    g, x, y = egcd(a, m)
+    if g != 1:
+        raise Exception('modular inverse does not exist')
+    else:
+        return x % m
+
+print(egcd(10,12))
+print(modinv(11,26))

Challenge questions/adarshrise/ch4/CsvReader.py

@@ -0,0 +1,15 @@
+import csv
+
+with open('data.csv') as csvfile:
+    readCSV =csv.reader(csvfile,delimiter=',')
+    ager=[]
+    genderr=[]
+    racer=[]
+    for row in readCSV:
+        age= row[0]
+        gender=row[1]
+        race=row[2]
+        ager.append(age)
+        genderr.append(gender)
+        racer.append(race)
+    print(ager,genderr,racer)

Challenge questions/adarshrise/ch4/data.csv

@@ -0,0 +1,6 @@
+23,male,white
+34,male,brown
+56,female,black
+34,female,brown
+27,male,black
+73,male,white

Challenge questions/adarshrise/challenge 2 inverse mod simple v3.py

@@ -0,0 +1,6 @@
+def imod(inv, modnum):
+ goal = 1
+ while (goal % inv > 0):
+     goal += modnum
+     print(goal)
+ return goal // inv

Challenge questions/adarshrise/comparing large number givien as a string.py

@@ -0,0 +1,34 @@
+def bin(instrlist):
+    #instr=input("Enter your String ")
+    #instrlist=instr.split()
+    # print(instrlist)
+    a=eval(instrlist[0])
+    b=eval(instrlist[-1])
+    if '==' in instrlist:
+        if(a==b):
+            print(1)
+        else:
+            print(0)
+    if '!=' in instrlist:
+        if(a!=b):
+            print(1)
+        else:
+            print(0)
+    if '>=' in instrlist:
+        if(a>=b):
+            print(1)
+        else:
+            print(0)
+    if '<=' in instrlist:
+        if(a==b):
+            print(1)
+        else:
+            print(0)
+
+listinstr=input("enter your input")
+listinstr=listinstr.split()
+# print(listinstr)
+for i in range(0,len(listinstr),3):
+    # print(i,999)
+    # print(listinstr[i:i+3])
+    bin(listinstr[i:i+3])

Ciphers/Caesar_cipher.py

@@ -1,4 +1,5 @@
 # making of Caesar Cipher
+import sys
 seriesEnlv1=dict()
 seriesDelv1=dict()
 seriesEnlv2=dict()
@@ -13,10 +14,16 @@ def mapping():
         seriesEnlv1[alphalv1[i]]=i
         seriesDelv1[i]=alphalv1[i]
     alphalv2='ZYXWVUTSRQPONMLKJIHGFEDCBA'
-    for i in range(-25,0):
+    for i in range(-26,0):
         seriesEnlv2[alphalv2[i]]=i
         seriesDelv2[i]=alphalv2[i]
-    
+
+def check(message):
+    for i in message:
+        if((i==" " or i.isalpha())==False):
+            print("\n Message can't be send, remove any numbers or special symbols to continue ")
+            raise Exception(" message fault ")   
+            
 
 def message(code):
     mess=[]
@@ -59,6 +66,12 @@ def remodify(string):
 
 def textconv(text,key):
     mapping()
+    key=key%26
+    try:
+        check(text)
+    except:
+        print(" Message format is incorrect ")
+        sys.exit()
     text=modify(text)
     code=[]
     global seriesEnlv1
@@ -69,9 +82,11 @@ def textconv(text,key):
         else:
             code.append((seriesEnlv1[i]+key)%26)
     return (message(code))
+  
 
 def textrevert(encoded,key):
     code=[]
+    key=key%26
     global seriesEnlv1
     for i in encoded:
         if (i.islower()):
@@ -85,12 +100,19 @@ def textrevert(encoded,key):
         code.append(x)
     return remodify(message(code))
 
-simpleText=input("Enter the simple text : ")
-key=int(input(" Enter the key for the Text :"))
-encoded=textconv(simpleText,key)
-print(encoded)
-decoded=textrevert(encoded,key)
-print(decoded)
+def main():
+    simpleText=input("Enter the simple text : ")
+    try:
+        key=int(input(" Enter the key for the Text :"))
+    except:
+        print(" Enter only numeric key ")
+        sys.exit()
+    encoded=textconv(simpleText,key)
+    print(encoded)
+    decoded=textrevert(encoded,key)
+    print(decoded)
+
+main()
 
 
 

Ciphers/railfence.py

@@ -0,0 +1,23 @@
+#rail fence
+
+string=input("Enter the string :")
+part1,part2='',''
+i=1
+if(len(string)%2!=0):
+    string+=" "
+while(i<len(string)):
+    part1+=string[i-1]
+    part2+=string[i]
+    i=i+2
+print(part1+part2)
+
+newString=part1+part2
+newpart1=newString[0:len(newString)//2+1]
+newpart2=newString[len(newString)//2:]
+
+i=1
+backString=''
+while(i<max(len(newpart1),len(newpart2))):
+    backString=backString+newpart1[i-1]+newpart2[i-1]
+    i+=1
+print(backString)