Do not use chat gpt or any AI tools to solve it please Write in a python Write only Naive function Implement 1. Naïve (Brute force) Algorithm 2. Boyer-Moore Algorithm to search for “ababada” pattern in the given input.txt text file. Your program should be able to read from a text file called input.txt and search through it. The program then displays the number of occurences of this pattern and how long it takes in milisecs for each algorithm.

Do not use chat gpt or any AI tools to solve it please Write in a python Write only Naive function Implement 1. Naïve (Brute force) Algorithm 2. Boyer-Moore Algorithm to search for “ababada” pattern in the given input.txt text file. Your program should be able to read from a text file called input.txt and search through it. The program then displays the number of occurences of this pattern and how long it takes in milisecs for each algorithm.

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 20PE

See similar textbooks

Similar questions

Python programming-basics homework assignment: Write a program that inputs a text file, should print unique words in file in abc order, uppercase words should take precedence over lower. this is example of output: example text file: brown dog fox jumps lazy over quick the example output: brown dog fox jumps lazy over quick the THis is MY output: thequickbrownfoxjumpsoverthelazydog This is my code: QUESTION: why it won't SORT or removing unique text like example output: # Put your code herefileName = input("Enter the input file name:")word_list = []with open(fileName) as words: for line in words: line.rstrip() for list_of_words in line.split(): print(list_of_words) word_list.sort() for list2_words in word_list: if list2_words not in word_list: word_list.sort() word_list.append(list_of_words) for new_words in line.split(): print(new_words)
Time Write a Python script that extracts and prints a single record from an input file in which organized by line. Each line contains the name of a person (possibly containing multiple followed by the year of his birth. Abbas ibn Firnas ibn Wirda: 809 Muhammad ibn Musa al - Khwarizmi: 780 Abu Al - Walid Muhammad Ibn Ahmad Rushd: 1126 The program uses function extract DataRecord with the specification: @param infile the input text file object @return pants a list containing the name (string) in the first element and the year of bir the second element. If the end of file was reached, an empty list is returned
The function print_last_line in python takes one parameter, fname, the name of a text file. The function should open the file for reading, read the lines of the file until it reaches the end, print out the last line in the file, report the number of lines contained in the file, and close the file. Hint: Use a for loop to iterate over the lines and accumulate the count. For example: Test Result print_last_line("wordlist1.txt") maudlin The file has 5 lines.
【Python Programming】Writing a game is _word_drome(), a Chinese string palindrome that determines whether the content is given, all non-English words are loaded, and the Chinese string is required to be read from the file.
Q14: The function f(x) = e can be represented in a Taylor series by: ex = -Σ n! 72=0 Write a program in a script file that determines e by using the Taylor series representation. The program calculates e by adding terms of the series and stopping when the absolute value of the term that was added last is smaller than 0.0001. Use the program to calculate e², e05 and eª This problem can be solved by using while - end loop because : ONumber of passes not known OIt is a Taylor series All of the given O Number of passes is predetermined O Estimated error value must be calculated
PYTHON without def function Problem Statement Suppose an input file (called "paragraph.txt") contains a paragraph of text. Read in the file and then count/print the number of times the word "book" is in the file. Hint: Punctuation should be ignored, i.e., "book?" and "book!" should increase the count. The program should also be case-insensitive. Sample Input (File paragraph.txt) I have a book. It's called Harry Potter. It's a pretty good book! Do you want to buy my BOOK? Sample Output The word 'book' appears 3 time(s).
Fibonacci numbers are the numbers in a sequence in which the first two ele- ments are 0 and 1, and the value of each subsequent element is the sum of the previous two elements: 0, 1, 1, 2, 3, 5, 8, 13, .. Write a MATLAB program in a script file that determines and displays the first 20 Fibonacci numbers.
Problem Definition Task. Your task is to develop a python program that reads input from text file and finds if the alphanumeric sequence in each line of the provided input file is valid for Omani car license plate. The rules for valid sequences for car plates in Oman are as follows: Each sequence is composed of 1 to 5 digits followed by one or two letters. Digits cannot start with 0, for instance, 00, 011, or 09 are not valid digit sequences. The following list are the only valid letter combinations: ['A','AA','AB','AD','AR','AM','AW",'AY"', 'B', BA','BB','BD',"BR','BM',"BW',"BY', 'D','DA','DD','DR','DW','DY', 'R','RA','RR','RM','RW','RY', 'S','SS', 'M','MA','MB','MM','MW','MY", "W',"WA',WB',"wW', Y,YA','YB','YD','YR','YW',YY] Program Input/Output. Your program should read input from a file named plates.txt and write lines with valid sequences to a file named valid.txt. Any line from the input file containing invalid sequence should be written to a file named invalid.txt. Each line…
Using C++ how can I use Binary Search Tree (BST) to update a file.The code needs to be a menu-driven application that can: read a file and store the words and their count in BST store words that have at least 4 letters, ignore the rest there will be no words with ' (he's - for example will not be in the input file) print the words and their count in alphabetical order (A-Z) in a table format search for a word display the count and the word if found delete a word delete the word from the BST AND replace each occurrence of the word with a number of Xs equal to the length of the word; for example, delete word "camp", in the input file every occurrence of the word "camp" is replaced with XXXX use the search function you wrote for the search option to locate the word and delete it quit Also, how could I implement the BST as a linked list and how could I replace the words in the file with X's
Soundex System Soundex is a system that encodes a word into a letter followed by three digtis that roughly describe how the word sounds. That is, similar sounding words have similar four-character codes. For instance, the words carrot and caret are both coded as C123. A slight variation of the Soundex coding algorithm is as follows: 1. Retain the first letter. 2. For the remaining letters, delete all occurrences of a, e, i, o, u, h, y, and w. 3. Replace the letters that remain with numbers so that (a) b, f, p, and v become 1 (b) c, g, j, k, q, s, x, and z become 2 (c) d and t both become 3 (d) l (that is, el) becomes 4 (e) m and n become 5 (f) r becomes 6 4. If the result contains two adjacent identical digits, eliminate the second of them. 5. Keep only the first four characters of what you have left. If you have fewer than four, then add zeros on the end to make the string have length four. Write a program that carries out the algorithm. See Fig. 6.86.
Soundex System Soundex is a system that encodes a word into a letter followed by three digtis that roughly describe how the word sounds. That is, similar sounding words have similar four-character codes. For instance, the words carrot and caret are both coded as C123. A slight variation of the Soundex coding algorithm is as follows: 1. Retain the first letter. 2. For the remaining letters, delete all occurrences of a, e, i, o, u, h, y, and w. 3. Replace the letters that remain with numbers so that (a) b, f, p, and v become 1 (b) c, g, j, k, q, s, x, and z become 2 (c) d and t both become 3 (d) l (that is, el) becomes 4 (e) m and n become 5 (f) r becomes 6 4. If the result contains two adjacent identical digits, eliminate the second of them. 5. Keep only the first four characters of what you have left. If you have fewer than four, then add zeros on the end to make the string have length four. Write a program that carries out the algorithm. See Fig. 6.86. THIS IS DONE IN VISUAL BASIC
C Programming Write function checkHorizontal to count how many discs of the opposing player would be flipped, it should do the following a. Return type integer b. Parameter list i. int rowii. int col iii. char board[ROW][COL] iv. char playerCharc. If the square to the left or right is a space, stop checking d. If the square to the left or right is the same character as the player’s character, save that it was a flank, stop checking e. If the square to the left or right is not the same character as the player’s character, count the disc f. If the counted discs is greater than zero AND the player found their own character, return the counted discs, otherwise return ZERO Write function checkVertical to count how many discs of the opposing player would be flipped, it should do the following a. Return type integer b. Parameter list i. int rowii. int col iii. char board[ROW][COL] iv. char playerCharc. If the square above or below is a space, stop checking d. If the square above or below is…