Question

In Python 3, Write a program that reads in a text file that consists of some standard English text. Your program should count the number of occurrences of each letter of the alphabet, and display each letter with its count, in the order of increasing count. What are the six most frequently used letters?

Answer 1

If you have any queries write a comment in understood upvote Thak you

SOLUTION:

#open file
f = open("testingDoc.txt", "r")
#read data from file
filedata=f.read()
#dictionary to store frequency
freq = {}
#parse through each alphabet of file data
for i in filedata:
#here we are considering only alphabets we are checking ascii values of a-z and A-Z
if((ord(i)>=65 and ord(i)<=90) or(ord(i)>=97 and ord(i)<=127)):
#here i am storing to freq dictionary by converting to lower case now "a" and "A" are same
i=i.lower()
#check whether that data is present in diction if exist increase count else add to didctionary
if i in freq:
freq[i] += 1
else:
freq[i] = 1
#sort dictionary
sortedData=sorted(freq.items(), key = lambda kv:(kv[1], kv[0]))
print(sortedData)
#print last six most used
print("Six most used alphabets")
for i in range(len(sortedData)-1,len(sortedData)-7,-1):
print(sortedData[i])

CODE IMAGE AND OUTPUT:

- 0 x lè Python 3.7.2 Shell File Edit Shell Debug Options Window h', 17), ('', 24)] Help Lè occurencesofalphabetfile.txt - C:/Users/vinod/AppData/Local/Programs/Python/Python37-32/occurencesofalphabetfile.txt (3.7.2)* File Edit Format Run Options Window Help #open file f = open("testingDoc.txt", "r") #read data from file filedata=f.read() #dictionary to store frequency freq = { } #parse through each alphabet of file data for i in filedata: #here we are considering only alphabets we are checking ascii values of a-z and A-Z if((ord (i) >=65 and ord (i) <=90) or (ord (i) >=97 and ord (i) <=127)): #here i am storing to freq dictionary by converting to lower case now "a" and "A" are same i=i.lower() #check whether that data is present in diction if exist increase count else add to didctionary if i in freq: freq[i] = 1 else: freg[i] = 1 #sort dictionary sortedData=sorted (freq.items (), key = lambda kv: (kv[1], kv[0])) print (sortedData) #print last six most used print ("Six most used alphabets") for i in range (len (sortedData)-1,len (sortedData) -7,-1): print (sortedData[i]) RESTART: C:/Users/vinod/AppData/local/Programs/Python/Python37-32/occurencesofa lphabetfile.txt [('2', 1), ('r', 1), ('s', 1), ('\n', 2), ('0', 2), ('a', 4), ('l', 4), ('m', 4) , ('u', 5), ('x', 5), ('y', 5), ('i', 7), ('n', 7), ('a', 8), ('v', 8), ('d', 9) , ('e', 9), ('f', 10), ('b', 11), ('g', 12), ('w', 12), (';', 14), ('c', 17), (' h', 17), ('', 24)] RESTART: C:/Users/vinod/AppData/Local/Programs/Python/Python37-32/occurencesofa lphabetfile.txt Traceback (most recent call last): File "C:/Users/vinod/AppData/Local/Programs/Python/Python37-32/occurencesofalp habetfile.txt", line 9, in cmodule> if lower (i) in freq: NameError: name 'lower' is not defined RESTART: C:/Users/vinod/AppData/Local/Programs/Python/Python37-32/occurencesofa lphabetfile.txt [('r', 1), ('s', 1), ('o', 2), ('a', 4), ('l', 4), ('m', 4), ('u', 5), ('x', 5), ('y', 5), ('i', 7), ('n', 7), ('a', 8), ('y', 8), ('d', 9), ('e', 9), ('f', 10) , ('b', 11), ('g', 12), ('w', 12), (';', 14), ('c', 17), ('h', 17)] RESTART: C:/Users/vinod/AppData/Local/Programs/Python/Python37-32/occurencesofa lphabetfile.txt 22 RESTART: C:/Users/vinod/AppData/Local/Programs/Python/Python37-32/occurencesofa lphabetfile.txt [('r', 1), ('s', 1), ('o', 2), ('a', 4), ('l', 4), ('m', 4), ('u', 5), ('x', 5), ('y', 5), ('i', 7), ('n', 7), ('a', 8), ('y', 8), ('d', 9), ('e', 9), ('f', 10) , ('b', 11), ('g', 12), ('w', 12), ('j', 14), ('c', 17), ('h', 17)] Six most used alphabets ('h', 17) ('c', 17) (';', 14) ('w', 12) ('g', 12) ('b'11) >>> 99 Col: 4 Activate Windows Go to Settings to activate Windows. 4 O Type here to search B e A @ DEV Ln: 26 Col: 0 10:17 PM 2/19/2020