Answer:
4
Explanation:got it right on edg.
Answer:no thank you ima goody
Explanation:
Answer:
Explanation:
The following code is written in Python. It asks the user for an input. Then cleans the input using regex to remove all commas, whitespace, and apostrophes as well as making it all lowercase. Then it reverses the phrase and saves it to a variable called reverse. Finally, it compares the two versions of the phrase, if they are equal it prints out that it is a palindrome, otherwise it prints that it is not a palindrome. The test case output can be seen in the attached picture below.
import re
phrase = input("Enter word or phrase: ")
phrase = re.sub("[,'\s]", '', phrase).lower()
reverse = phrase[::-1]
if phrase == reverse:
print("This word/phrase is a palindrome")
else:
print("This word/phrase is NOT a palindrome")
Answer and Explanation:
Given that total number of records in a file = 100000
Each record consists of= 240 bytes
Given that B= 2400 bytes.
Then total blocks in file = 100000 records * 240 / 2400
= 10000 blocks.
Time that will take for exhaustive read
= s + r + b.btt
= 16 + 8.3 + (10000) * 0.8
= 8024.3 msec
Now as per given X be the number of records that are searched randomly and it takes more than exhaustive read time.
Hence, X (s + r + btt) > 8024.3
X (16+8.3+0.8) > 8024.3
X > 8024.3/25.1
So that, X > 319.69
Hence, atleast 320 random reads should be made to search the file
Passwords, TPM, and Drive Encryption.
Hope this helps. :)