Write a Python program to match a string that contains only upper and lowercase letters, numbers, and underscores. import re def text_match(text):         patterns = '^[a-zA-Z0-9_]*$'         #TO DO -- Complete the Code print("text#1: " + text_match("The quick brown fox jumps over the lazy dog.")) print("text#2: " + text_match("Python_Exercises_1")) Expected output: text1: No match found! text2: Found a match!

Write a Python program to count the number of times a specific element appears in a deque object.Sample Output:Number of 2 in the sequence5Number of 4 in the sequence4.

class Output{public static void main(String args[]){byte a[] = { 65, 66, 67, 68, 69, 70 };byte b[] = { 71, 72, 73, 74, 75, 76 };System.arraycopy(a , 0, b, 0, a.length);System.out.print(new String(a) + " " + new String(b));}}         The output of the above Java code is ?

Suppose dna is a string variable that contains only 'a','c','g' or 't' characters. What Python code below can we use to find the frequency (max_freq) of the most frequent character in string dna? A    dna_counts= {'t':dna.count('t'),'c':dna.count('c'),'g':dna.count('g'),'a':dna.count('a')}   max_freq=sorted(dna_counts.keys())[0] B  dna_counts= {'t':dna.count('t'),'c':dna.count('c'),'g':dna.count('g'),'a':dna.count('a')}   max_freq=sorted(dna_counts.values())[-1] C   dna_counts= {'t':dna.count('t'),'c':dna.count('c'),'g':dna.count('g'),'a':dna.count('a')}   max_freq=sorted(dna_counts.keys())[-1]

Revorse the vewels def reverse_vowels(text): Given a text string, create and return a new string constructed by finding all its vowels (for simplicity, in this problem vowels are the letters found in the string 'aeiouAEIOU') and reversing their order, while keeping all other characters exactly as they were in their original positions. However, to make the result look prettier, the capitalization of each moved vowel must be the same as that of the vowel that was originally in the target position. For example, reversing the vowels of 'Ilkka' should produce 'Alkki' instead of 'alkkI'. Applying this operation to random English sentences seems to occasionally give them a curious pseudo-Mediterranean vibe.Along with many possible other ways to perform this square dance, one straightforward way to reverse the vowels starts with collecting all vowels of text into a separate list, and initializing the result to an empty string. After that, iterate through all positions of the original text.…

This is the code: String name = Doe, John"; int index =name.indexOf(" , "); String firstName= name.substring(index + 2, name.length()); System.out.println(firstName);

In java, without Arrays and using only String methods ( don't use String builder) // Question 17: In MS-DOS, a file name consists of up // to 8 characters (excluding '.', ':', backslask, '?', // and '*'), followed by an optional dot ('.' character) // and extension. The extension may contain zero to three // characters. For example, 1STFILE.TXT is a valid filename. // Filenames are case-blind. // // Write and test a method that takes // in a String, validates it as a valid MS-DOS file // name, appends the extensions ".TXT" if no extension // is given (that is, no '.' appears in FILENAME), converts // the name to uppercase, and returns the resulting string // to the calling method // If fileName ends with a dot, remove that dot and do not // append the default extension. If the name is invalid, // validFileName should return null.   public String validFileName(String n) {   }

When an interrupt occurs, the CPU suspends the current process and handles the problem. In technical terms, this is known as interrupt service. What is the cause for the current process's halt? Consider completing the task now and dealing with the interruption afterwards.