QUESTION 15 The following algorithm finds the same character in two strings: string, -xx2Xn and string2=y1y2-Yn How many times would Step 4.1.1. be performed for the following inputs: string = 6632176980 string, = 8703125409 1. input n 2. input the n-character long string x1x2X3 Xn 3. input the n-character long string yıY2y3 **Yn 4. for i = 1 ton 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"

QUESTION 15 The following algorithm finds the same character in two strings: string, -xx2Xn and string2=y1y2-Yn How many times would Step 4.1.1. be performed for the following inputs: string = 6632176980 string, = 8703125409 1. input n 2. input the n-character long string x1x2X3 Xn 3. input the n-character long string yıY2y3 **Yn 4. for i = 1 ton 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"

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 29PE

See similar textbooks

Similar questions

Using C language
plese code in python The midfix of 3 is the middle 3 characters of a string. Given a string input, output the middle three characters of that string. Assume the word length is always odd and at least three characters. Ex: If the input is: xxxtoyxxx the output is: Midfix: toy
Longest String You are given S consisting of only 0 and 1 An integer X Input: The first line contains an integer T denoting the number of the test cases. For each test case , first line contains a string S. The secind line contains an integer X Output. For each test case print an integer number in a new line representing the legth of the longest subsequences of string S. Sample input: 1 111011100 100 Sample output: 7
Answer the following. 33150 string is recognized DFA OR Not
The international standard letter/number mapping found on thetelephone is shown below: Write a program that prompts the user to enter a lowercase or uppercase letter anddisplays its corresponding number. For a nonletter input, display invalid input. Enter a letter: A ↵EnterThe corresponding number is 2
Please provide the CFG (Context-Free Grammer) for all string of this language: L = {0p 1q 2r , where p = q + r} These are the strings: 0011 0012 0022 000111 000112 000222
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 the Algorithm analysis. The complexity of the algorithm must be in O(n). ➢ PS: You use the algorithm for string matching taught in class. The repeated pattern is valid only from the first character.
Q4/ Convert the following algebraic expressions into expressions in Mat lab: -10t cosle Decree DIE 3y 9) z = z- [2 + (31₂) (M² sin²0 - 1) y+21 10) a9b³-4b² + 3b + 3 Matlab
Pyhton: Take two strings input and print the string whose length is greater in the output.
Write a program in python language to find the length of string entered by user
Java program to find a digit string from the given alphanumeric string.
Using Python PLY implement the RE to DFA conversion algorithm. Once the DFA is constructed, prompt the user for input strings and report "MATCH" if the string is accepted by the DFA and "NO MATCH" otherwise.