Algorithm Design: A palindrome is a nonempty string over some alphabet that reads the same forward and backward. Examples of palindromes include all strings of length 1, civic, racecar and aibohphobia (fear of palindrome). Design an efficient algorithm using dynamic programming strategy to find the longest palindrome that is a subsequence of a given input string. For example, given the input character, your algorithm should return carac. What is the running time of your algorithm?

Given: List L of pairs of characters String S Output: TRUE if S is a valid string, FALSE otherwise.   A string is considered valid if each character in the string can be paired with another character in the string, where the pair belongs to the input list L. Furthermore, two pairs cannot cross each other. In other words, a pair most completely enclose another, or be completely separate. Design and implement an efficient dynamic programming solution to this problem.   Examples: Input L: (a b) (b c) (c d) (a a) Input S: aaba Output: True (pairs shown color-coded: aaba, “aa” fully encloses “ab”)   Input L: (a b) (b c) (c d) (a a) Input S: abcaad Output: True (pairs shown color-coded: abcaad, “ab” is separate from the other pairs)   Input L: (a b) (b c) (c d) (a a) Input S: acbd Output: False (acbd is not valid because the pairs cross each other.)   Input L: (a b) (b c) (c d) (a a) Input S: aaac Output: False   Could you please provide python implementation to this?

Given: List L of pairs of characters String S Output: TRUE if S is a valid string, FALSE otherwise.   A string is considered valid if each character in the string can be paired with another character in the string, where the pair belongs to the input list L. Furthermore, two pairs cannot cross each other. In other words, a pair most completely enclose another, or be completely separate. Design and implement an efficient dynamic programming solution to this problem.   Examples: Input L: (a b) (b c) (c d) (a a) Input S: aaba Output: True (pairs shown color-coded: aaba, “aa” fully encloses “ab”)   Input L: (a b) (b c) (c d) (a a) Input S: abcaad Output: True (pairs shown color-coded: abcaad, “ab” is separate from the other pairs)   Input L: (a b) (b c) (c d) (a a) Input S: acbd Output: False (acbd is not valid because the pairs cross each other.)   Input L: (a b) (b c) (c d) (a a) Input S: aaac Output: False

Write in C Language Spilitology Yosef is a peculiar fellow. He introduced the idea to study a string by splitting it into two, and he called it Splitology. Why split a string? We do not know. Didn’t we say that Yosef is a weird one? Yosef is interested in one particular type of string, a palindrome. A palindrome is a string that is the same for both forwards and backwards. Example of palindrome strings are “ada”, “taat”, and “radar”. On the other hand, string such as “taman” is not a palindrome; notice that “taman” becomes “namat” if read backwardsand it’s not the same as “taman”. As the idea of Splitology is still new, Yosef is investigating whether a string can be split into two non-empty strings such that each string is a palindrome. For example, the string “malamini” can be split into “malam” and “ini” while both of them are palindrome. Another example is “ababab”. It can be split into “aba” and “bab”, and both of them are palindrome. Note that “ababab” can also be split into…

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 O's.) How many hexadecimal strings start and end with the same character?

CodeW For fun X C Solved https://codeworkou... 臺亂 CodeWorkout X272: Recursion Programming Exercise: Is Reverse For function isReverse, write the two missing base case conditions. Given two strings, this function returns true if the two strings are identical, but are in reverse order. Otherwise it returns false. For example, if the inputs are "tac" and "cat", then the function should return true. Examples: isReverse("tac", "cat") -> true Your Answer: 1 public boolean isReverse(String s1, String s2) { 2. if > 3. 4. else if > return true; return false; 5. 6. else { String s1first = String s2last return s1first.equals (s2last) && 51. substring(0, 1); s2, substring(s2.length() 1); 7. 8. 6. isReverse(s1.substring(1), s2.substring(0, s2.length() 1)); { 12} 1:11AM 50°F Clear 12/4/2021

The problem:➢ Input: a string in a line.➢ Output: Print the pattern and the repeated count if there is a repeated pattern, Print "none"otherwise.➢ Task: Design an algorithm in pseudocode/code to for the problem and write down theAlgorithm analysis. The complexity of the algorithm must be in O(n).

1. Design an algorithm to find the weighted sum of four test scores (https://en.wikipedia.org/wiki/Weight_function). Assume that the weights have been accurately calculated in advance such that their sum equals one.  Your algorithm must-read in the four test scores and four corresponding weights in the following order: score1 weight1 score2 weight2 score3 weight3 score4 weight4 Write your algorithm such that it can be run with any set of data values. However, you can test your algorithm on the following sample data to verify that the result is 70: 90 0.10 80 0.20 70 0.30 60 0.40   2. Write an algorithm that prompts the user for the radius, in inches, and price of a pizza, and then reads in those values.  Finally, have the algorithm compute and output the pizza’s cost per square inch.   3. Sports exercise advisor algorithm. In this algorithm you will start out with a temperature value in Celsius, so you do not need to ask the user for it. First, convert the temperature to Fahrenheit.…

ANALYSIS & DESIGN OF ALGORITHMS subject Three points P, Q, and R are said to be collinear if they are on a single line. To check whether the 3 points lie on the same line, we use the distance formula. If P, Q and R are three collinear points, then: Distance from P to Q + Distance from Q to R = Distance from P to R PQ + QR = PR The distance between two points (x1, y1) and (x2, y2) is given by Hence, we can easily find the distance between the points P, Q and R, with the help of this formula.  Design an algorithm (pseudocode) to check whether three points are collinear. In your solution include the input and the output.

Nuts and bolts You are given a collection of n bolts of different widths and n corresponding nuts. You are allowed to try a nut and bolt together, from which you can determine whether the nut is larger than the bolt, smaller than the bolt, or matches the bolt exactly. However, there is no way to compare two nuts together or two bolts together. The problem is to match each bolt to its nut. Design an algorithm for this problem with average-case efficiency in (n log n).