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 run the above algorithms in C/C+

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 run the above algorithms in C/C+

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

in this code: def insertSort(A): for i in range(1,len(A)): j = i-1 while A[j]>A[j+1] and j>=0: A[j],A[j+1] = A[j+1],A[j] j -= 1 A = [3,1,11,9,10,2] insertSort(A) print(A) 1) What is the Hypothesis? 2) What is Your Induction
Computer Science you are given a string X of length n and another string Y of length m ≤n. Say,the indexes p1, p2, p3, p4 and q1, q2, q3, q4 form two sub-sequences, i.e., 0 ≤ p1 < p2 < p3 < p4 < nand 0 ≤q1 < q2 < q3 < q4 < n; then, they are non-overlapping if p4 < q1.The task is to count the maximum number of non-overlapping sub-sequences of X that are thesame as Y . Thus, if X = GAXTYAWBGTAUGBTABGRGTAXB and Y = GTAB, then the answer is3 as shown by the red fonts. We cannot select the underlined GTAB as it overlaps with a red GTAB(i.e., among overlapping sub-sequences, you can select only one of them).Describe an O(m + n) time algorithm to obtain the count. Write a pseudo-code.
For the following problem please write an algorithm in plain English .i.e give details as to how you will solve the problem.A deck of 52 playing cards (as used for playing bridge) has to be sorted. At the end of the attempt, the sorted deck of cards should be on the table with the backside up.The order within a suite is Ace - King - Queen - Jack- 10 -9 - 8 - 7- 6- 5- 4- 3- 2. The very first card in the sorted deck is the Ace of Clubs, the next ones are the King of Clubs, the Queen of Clubs, the Jack of Clubs, the 10 of Clubs ... down to the 2 of Clubs. The next card is Ace of Spades, followed by the King of Spades etc. The hearts and diamonds cards follow in the same order.The deck of cards must be well-shuffled immediately prior to the challenge.Please write the algorithm in steps like you write a recipe for a dish.If any steps need to be repeated try to use a loop.Please try to not use any programming language.(IT's one question just with a lot of instructions to be understood well)
g1 = 5 g2 = 6 for k in range(3,8): gk = (k-1)·gk-1 + gk-2 What is the last term, g8, of the recursive sequence generated as a result of executing this algorithm?
Given these 8 numeric values to be sorted using the recursive Mergesort algorithm: 92 63 24 18 69 27 64 43 The list that will be passed to the first call of the Mergesort algorithm will be the entire list of values above. Show the list that will be passed to the 5th call of the Mergesort algorithm.
Use C++ Write a program that replaces words in a sentence. The input begins with an integer indicating the number of word replacement pairs (original and replacement) that follow. The next line of input begins with an integer indicating the number of words in the sentence that follows. Any word on the original list is replaced. Ex: If the input is: 3 automobile car manufacturer maker children kids 15 The automobile manufacturer recommends car seats for children if the automobile doesn't already have one. then the output is: The car maker recommends car seats for kids if the car doesn't already have one. You can assume the original words are unique. For coding simplicity, follow each output word by a space, even the last one. Hint: For words to replace, use two vectors: One for the original words, and the other for the replacements. Your program must define and call the following function that returns index of word's first occurrence in wordList. If not found, then the function returns…
Computer Science Draw the TST that results from inserting the following strings into an initially empty trie now is the time for all good people to come to the aid of
How this can be with recursion. It has to show all possible path, when movement in all possible direction is allowed. #include <bits/stdc++.h> #define MAX 5 using namespace std; // Function returns true if the // move taken is valid else // it will return false. bool isSafe(int row, int col, int m[][MAX], int n, bool visited[][MAX]) { if (row == -1 || row == n || col == -1 || col == n || visited[row][col] || m[row][col] == 0) return false; return true; } // Function to print all the possible // paths from (0, 0) to (n-1, n-1). void printPathUtil(int row, int col, int m[][MAX], int n, string& path, vector<string>& possiblePaths, bool visited[][MAX]) { // This will check the initial point // (i.e. (0, 0)) to start the paths. if (row == -1 || row == n || col == -1 || col == n || visited[row][col] || m[row][col] == 0) return; // If reach the last cell (n-1, n-1) // then store the path and return if (row == n - 1 && col == n - 1) {…
he algorithm below is used to find the largest element in a list of numbers.By modifying one of the lines in the program it is possible to make the algorithm find the SMALLEST element. Which line would need to be modified and how?01 target <- list[1] 02 FOR EACH num IN list 03 { 04 IF(num > target) 05 { 06 target <- num 07 } 08 } 09 DISPLAY(target) a. Line 01 becomes target <- list[2] b. Line 01 becomes list[0] <- target c. Line 04 becomes if (num <= target) d. Line 04 becomes IF (num < target)
Python code: import randomdef main(): # main function definition aGrades=[] # empty list to store Grades for i in range(7): # loop to read 7 inputs print("Input scores ",i+1," : ", end="") # a message to enter grade n=int(input()) # input grade aGrades.append(n) # add grade into list print("Grade list before randomize: ",aGrades) # print list random.shuffle(aGrades) # randomize list numExams=len(aGrades)-1 # compute numExams FinalExam=aGrades[-1] # store final grade TotalPoints=sum(aGrades)-aGrades[-1] # compute TotalPoints TestAverage=TotalPoints/numExams # compute TestAverage FinalAverage=TestAverage*.6 + FinalExam*.4 # compute FinalAverage print("Grade list after randomize is: ",aGrades) # print list print("Test Average = %.2f"%TestAverage) # print test average print("Final Average = %.2f "%FinalAverage) # print final averagemain() # calling main function Can you explain in a word doc explaining each line…
Write a version of the sequential search algorithm that can be used to search a sorted list. Write a program to test the sequential search algorithm. Use either the function bubbleSort or insertionSort to sort the list before the search. Your program should prompt the user to enter 10 digits and then prompt the user to enter a digit to search - if the list contains this digit, output its position to the console: x is found at position y If the digit is not contained in the list, output the following: x is not in the list
given input word, return the list of abbreviations.ex)word => ['word', 'wor1', 'wo1d', 'wo2', 'w1rd', 'w1r1', 'w2d', 'w3', '1ord', '1or1', '1o1d', '1o2', '2rd', '2r1', '3d', '4']""" def generate_abbreviations(word): def backtrack(result, word, pos, count, cur): if pos == len(word): if count > 0: cur += str(count) result.append(cur) return if count > 0: # add the current word backtrack(result, word, pos+1, 0, cur+str(count)+word[pos]) else: backtrack(result, word, pos+1, 0, cur+word[pos]) # skip the current word backtrack(result, word, pos+1, count+1, cur).