1
they were crafted in stained-glass art in religious buildings
2
puzzle games
3
motion-capture devices (e.g., Kinect, WiiMote
4
puzzle
simulation
Answer:
def analyze_text(sentence):
count = 0
e_count = 0
for s in sentence:
s = s.lower()
if s.isalpha():
count += 1
if s == "e":
e_count += 1
return "The text contains " + str(count) + " alphabetic characters, of which " + str(e_count) + " (" + str(e_count*100/count) + "%) are ‘e’."
Explanation:
Create a function called analyze_text takes a string, sentence
Initialize the count and e_count variables as 0
Create a for loop that iterates through the sentence
Inside the loop, convert all letters to lowercase using lower() function. Check each character. If a character is a letter, increment the count by 1. If a character is "e", increment the e_count by 1.
Return the count and e_count in required format
Answer:
See explaination for the code
Explanation:
def wordsOfFrequency(words, freq):
d = {}
res = []
for i in range(len(words)):
if(words[i].lower() in d):
d[words[i].lower()] = d[words[i].lower()] + 1
else:
d[words[i].lower()] = 1
for word in words:
if d[word.lower()]==freq:
res.append(word)
return res
Note:
First a dictionary is created to keep the count of the lowercase form of each word.
Then, using another for loop, each word count is matched with the freq, if it matches, the word is appended to the result list res.
Finally the res list is appended.
Answer: 1 time.
Explanation:
- A binary function is also known as a half-interval search is a search algorithm to find the position of a given element x within a well-sorted array [].
- Binary search compares the target value to the middle element of the array.
- It ignores half of the elements just after one comparison.
- it compares x with the middle element.
So, the function read an element <u>one time</u> in the array before finding the value.
