Algorithm A4: index(T, P) 1. Initialize i = 0 and max = t – p + 1 / * t and p are respectively lengths of strings T and P * / 2. Repeat steps 3 to 6 while i < max 3. Repeat for j = 0 to p – 1 5. Return index i and exit 6. i = i + 1 7. Return –1 for no match 8. Exit

Algorithm A4: index(T, P) 1. Initialize i = 0 and max = t – p + 1 / * t and p are respectively lengths of strings T and P * / 2. Repeat steps 3 to 6 while i < max 3. Repeat for j = 0 to p – 1 5. Return index i and exit 6. i = i + 1 7. Return –1 for no match 8. Exit

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter1: Fundamentals Of C++ Programming

Section1.4: Preliminary Four: Algorithms

Problem 7E: (Data processing) a. Write an algorithm to locate the first occurrence of the name JEAN in a list of...

See similar textbooks

Similar questions

Background: When searching for an item in a list, each item that we examine (compare) is considered to be interrogated. If we search for John, the following names are interrogated: Harry, Larry, John (in that order). If two names tie for the middle position, choose the first of the two names for the middle.If we search this same list for John using the Sequential search we would interrogate all the names from Alice through John. We would start with Alice, move to Bob, move to Carol and so forth until we reached John. Directions: Use the original list of names (Alice - Oliver) to answers questions 1-8. Using a sequential search, what names are interrogated to find Carol? Using a sequential search, what names are interrogated to determine that Sam is not in the list? Using a binary search, what names are interrogated to find Carol? Using a binary search, what names are interrogated to determine that Sam is not in the list? Will a binary search or sequential search find Alice…
USING C++ Evaluate the following postfix expressions by using the algorithm we discussed in the videos/pdfs. Show the status of the stack after each step of the algorithm. Use the following values: a=7, b=3, c=12, d=-5, e=1: A.) a b c + - B) a b c - d * + PLEASE LOOK AT THE IMAGES FOR FURTHER HELP!
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…
(Data processing) a. Write an algorithm to locate the first occurrence of the name JEAN in a list of names arranged in random order. b. Discuss how you could improve your algorithm for Exercise 7a if the list of names were arranged in alphabetical order.
Algorithm design with sorting. Each of n users spends some time on a social media site. For each i = 1, . . . , n, user i enters the site at time ai and leaves at time bi ≥ ai. You are interested in the question: how many distinct pairs of users are ever on the site at the same time? (Here, the pair (i, j) is the same as the pair (j, i)).Example: Suppose there are 5 users with the following entering and leaving times: Then, the number of distinct pairs of users who are on the site at the same time is five: these pairs are (1, 2), (1, 3), (2, 3), (4, 6), (5, 6). (Drawing the intervals on a number line may make this easier to see).(a) Given input (a1 , b1),(a2 , b2), . . . ,(an, bn) as above in no particular order (i.e., not sorted in any way), describe a straightforward algorithm that takes Θ(n2)-time to compute the number of pairs of users who are ever on the site at the same time, and explain why it takes Θ(n2)-time. [We are expecting pseudocode and a brief justification for its…
220 CMPG 221 1-1 2021 Time Remaining: 00:04:31 ▲Hide Time Remaining▲ I_Know 6: SU4 All Part 5 of 5 - Run Time Question 5 of 53 Points Study the two methods below both will do the same work. If you use your algorithm analysis skills to analize these two algorithms. Will you use the first method or the second method? Motivate your answer. public MyLinkedList split() { int nodec=0 ; int index=0; Node ptr=head; MyLinkedList newlist = new MyLinkedList<>(); if((ptr==null)||(ptr==tail)) return this; for(;ptr!=null;ptr=ptr.next) { nodec++; } ptr = head; if(nodec%2==0) index = nodec/2; else index = nodec/2+1; int i =0; for(;ptr!=null;ptr=ptr.next) { if(i>=index) { newlist.append(ptr.element); this.delete(ptr.element); } i++; } return newlist; } public MyLinkedList split() { int…
Do not copy from other websites (will be directly downvoted) Correct and detailed answer will be Upvoted Question: Give asymptotic upper bound (represented by O( )) of the recursive function T(n) = T(n-1) + T(n-2) with T(1)=T(2)=1 via substitution method. Will give thumbs up.
Algorithm: Weighted Interval Scheduling & Dynamic Programming (Knapsack, Edit Distance) We say that a string w is a 'braid' of strings u and v if w can be written as the catenation of strings w = x_1*y_1*x_2*y_2 · · · x_n*y_n, where x_i , y_i are (possibly empty) strings such that u = x_1 · · · x_k and v = y_1 · · · y_k. For example, the string drnonfamatiicction is a braid of the strings 'dramatic' and 'nonfiction'. Given strings u, v, w with lengths m, n, m + n respectively, give an algorithm in pseudocode that determines whether w is a braid of u and v. Give proofs of correctness and running time for your algorithm.
1. a.An algorithm can be specified in various ways. Identify and explain four ways in which an algorithm can be specified. b. (b). Two algorithms A, B sort the same problem. When you go through each algorithm and break them down into their primitive operations, each can be represented as follows:A = 2n7 + 100n4 + 26n + 50 B = 7n4 + 22n2 + nlogn + 200For very large values of n, which of the algorithms A or B will runin the shortest time to solve the problem and why? (c). Two Computer Science students, Priscilla and Julius, are discussing how to compare two algorithms for solving a given problem. Priscilla suggests that they should use the execution times of the algorithms as criterion; but Julius insists that they should use the number of statements the algorithms execute as criterion. (i). Discuss the reasons why both criteria they are considering are not good for comparing algorithms.(ii). Recommend an ideal solution/criterion that they should rather use for comparing algorithms
The script has four steps: Read a list of integers (no duplicates). Output the numbers in the list. Perform an insertion sort on the list. Output the number of comparisons and swaps performed during the insertion sort. Steps 1 and 2 are provided in the script. Implement step 3 based on the insertion sort algorithm in the book. Modify insertion_sort() to: Count the number of comparisons performed. Count the number of swaps performed. Output the list during each iteration of the outside loop. Implement step 4 at the end of the script. Hints: In order to count comparisons and swaps, modify the while loop in insertion_sort(). Use global variables for comparisons and swaps. The script includes three helper functions: read_nums() # Read and return a list of integers. print_nums(nums) # Output the numbers in nums swap(nums, n, m) # Exchange nums[n] and nums[m] Ex: When the input is: 3 2 1 5 9 8 the output is: 3 2 1 5 9 8 2 3 1 5 9 8 1 2 3 5 9 8 1 2 3 5 9 8 1 2 3 5 9 8 1 2 3 5 8 9…
Find the smallest gap between two numbers in K. The algorithm should return the magnitude of the gap between the two closest integers. The algorithm(FINDGAP) should support Insert, delete and search in O(log n) time. And we maintain a dynamic set of integers. Example = [30, 5, 20, 9] Output = 9 - 5 = 4 a) Choose data structure to store the dynamic set of integers b) Create the algorithm FINDGAP and make it run as fast as possible. (PSEUDOCODE) c) Prove runningtime of FINDGAP and argue its optimal d) Make sure that running time of insert, delete and search are O(log N). Argue.
Consider the following snippets of code. Then, identify and describe thesorting algorithm used.num scores[5] = 90,85,65,95,75sort()x = 1while x < SIZEtemp = scores[x]y = x – 1while y >= 0 AND scores[y]>tempscores[y+1] = scores[y]y = y – 1endwhilescores[y+1] = tempx = x + 1endwhilereturn