The following Turing Machine is given: 0 → 0,L xx,L 95 UUR UUL xx, R 0U, R 0x, R q1 92 93 xx, R UU,R xx, R UU,R 00, R 0x, R 'xx, R greject Jaccept 94 U➡U, R When an input string arrives, we place them in the tape from the leftmost cell, the rest of the cell will be blank (B and both represent blank symbol) With the input string of "OXXOXOOX", does this TM Accept/Reject/Loop? , what would be the new content of tape (only the 8 leftmost cells)? With the input string of "OX000000", does this TM Accept/Reject/Loop? (use B for blank symbol) , what would be the new content of tape (only the 8 leftmost cells)? (use B for blank symbol)

The following questions are independent. 1. A palindrome is a string that reads the same forward and backward. Using our algorithmic language, propose an algorithm that determines whether a string of n characters is a palindrome. 2. Let x be a real number, and n be an integer. Devise an algorithm that computes xn. [Hint: First, give a procedure for computing xn when n is nonnegative by successive multiplication by x, starting with 1 until we reach n. Then, extend this procedure and use the fact that x–n = 1/xn to compute xn when n is negative.] 3. The median of a set of integers is the middle element in the list when these integers are listed in increasing order. The mean of a set of integers is the sum of integers divided by the number of integers in the set. Write an algorithm that produces the maximum, median, mean, and minimum of a set of three integers.  Answer question 3 only with details

The following questions are independent. 1. A palindrome is a string that reads the same forward and backward. Using our algorithmic language, propose an algorithm that determines whether a string of n characters is a palindrome. 2. Let x be a real number, and n be an integer. Devise an algorithm that computes xn. [Hint: First, give a procedure for computing xn when n is nonnegative by successive multiplication by x, starting with 1 until we reach n. Then, extend this procedure and use the fact that x–n = 1/xn to compute xn when n is negative.] 3. The median of a set of integers is the middle element in the list when these integers are listed in increasing order. The mean of a set of integers is the sum of integers divided by the number of integers in the set. Write an algorithm that produces the maximum, median, mean, and minimum of a set of three integers.    Answer only 2 question

The following questions are independent. 1. A palindrome is a string that reads the same forward and backward. Using our algorithmic language, propose an algorithm that determines whether a string of n characters is a palindrome. 2. Let x be a real number, and n be an integer. Devise an algorithm that computes xn. [Hint: First, give a procedure for computing xn when n is nonnegative by successive multiplication by x, starting with 1 until we reach n. Then, extend this procedure and use the fact that x–n = 1/xn to compute xn when n is negative.] 3. The median of a set of integers is the middle element in the list when these integers are listed in increasing order. The mean of a set of integers is the sum of integers divided by the number of integers in the set. Write an algorithm that produces the maximum, median, mean, and minimum of a set of three integers.  Answer 2 and 3 questions

Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. You are given two strings An and B addressing expositions of two understudies who are suspected miscreants. For any two strings C, D we characterize their likeness score S(C,D) as 4⋅LCS(C,D)−|C|−|D|, where LCS(C,D) signifies the length of the Longest Common Subsequence of strings C and D.    You accept that main some piece of the expositions might have been replicated, along these lines you're keen on their substrings.    Work out the maximal likeness score over all sets of substrings. All the more officially, output maximal S(C,D) over all sets (C,D), where C is some substring of A, and D is some substring of B.    In case X is a string, |X| means its length.    A string a will be a substring of a string b if a can be acquired from b by erasure of a few (potentially, zero or all) characters from the start and a few (conceivably, zero or all) characters from the end.    A string a will…

2 - Arrange string characters such that lowercase letters should come first. Example: input: PyNaTive output: yaivePNT

A hexadecimal string is a finite sequence of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F. (In particular, a hexadecimal string can have leading 0’s.) How many hexadecimal strings start and end with the same character?

Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1. Example 1: Input: s= "leetcode" Output: 0 Example 2: Input: s= "loveleetcode" Output: 2 Example 3: Input: s= "aabb" Output: -1

Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science.     A string b is an aftereffect of a string an if b can be gotten from a by cancellation of a few (conceivably, zero or all) characters. For instance, "xy" is an aftereffect of "xzyw" and "xy", yet not    You are given a string a. Your errand is to reorder the characters of a so that "trygub" isn't an aftereffect of the subsequent string   All in all, you should find a string b which is a stage of images of the string an and "trygub" isn't an aftereffect of b   We have a genuinely superb confirmation that any string can be sorted out not to contain "trygub" as an aftereffect, however this issue explanation is too short to even think about containing it   Inpu   The primary line contains a solitary integer t (1≤t≤100) — the number of experiments   The primary line of each experiment contains a solitary integer n (1≤n≤200) — the length of a   The following line contains the string an of…

QUESTION7 The following algorithm finds the same character in two strings: string, =X1X2X, and string, =yıy2".Yn: How many times would Step 4.1.1. be performed for the following inputs: string1=6632176980 string 2=8703125409 1. input n 2. input the n-character long string x1X2X3 Xn 3. input the n-character long string y1y2Y3 * Yn 4. for i = 1 to n do 4.1. for j = 1 to n do 4.1.1. if x; = y; then 4.1.1.1. return "A common character has been found; it is x;" 5. return "There is no common character in the given two strings"