12* 3MA5 69' P854/ ma12z658?111. 1,2 5-647.pl Write a recursive function int count_digit(string s) to count the number of digits in a string s. Write a program that reads a text file numbers.txt (is given), and calls the function count_digit to count the number of digits of each of the file lines. The program then store the number of digits of each line of numbers.txt into another file called result_counting.txt (Needs to be created). Example: The number of digits in the 1st line "12*3MA569" is 6, so 6 should be stored in the 1st line in result_counting.txt The number of digits in the 2nd line "P854/ result_counting.txt is 3, so 6 should be stored in the 2nd line in • The program needs as well to multiply these numbers then display the multiplication into the screen. Submit only the program that should be named your FirstName_LastNameLab3.cpp Below is how you program should behave. -- |------/ 12*3MA569' P854/ ma12z658?111. 1,2 5-647.pl /- --Input file: numbers.txt --Output file: result_counting.txt 3 8 2 Screen output-- --- The multiplication of 6 3 8 2 4 is equal to 1152

12* 3MA5 69' P854/ ma12z658?111. 1,2 5-647.pl Write a recursive function int count_digit(string s) to count the number of digits in a string s. Write a program that reads a text file numbers.txt (is given), and calls the function count_digit to count the number of digits of each of the file lines. The program then store the number of digits of each line of numbers.txt into another file called result_counting.txt (Needs to be created). Example: The number of digits in the 1st line "123MA569" is 6, so 6 should be stored in the 1st line in result_counting.txt The number of digits in the 2nd line "P854/ result_counting.txt is 3, so 6 should be stored in the 2nd line in • The program needs as well to multiply these numbers then display the multiplication into the screen. Submit only the program that should be named your FirstName_LastNameLab3.cpp Below is how you program should behave. -- |------/ 123MA569' P854/ ma12z658?111. 1,2 5-647.pl /- --Input file: numbers.txt --Output file: result_counting.txt 3 8 2 Screen output-- --- The multiplication of 6 3 8 2 4 is equal to 1152

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 8SA

See similar textbooks

Similar questions

Create a recursive function in a file called ab_equality.py: def ab_equal(n, k, current): Print out all of the strings of a's and b's of length n so that the number of a's and b's are equal. For n = 2, there's ab and ba. For n = 3 there are no strings since they'd have to have 2 a's and 1 b, or 2 b's a 1 a so not equal. For n = 4, there will be 6 of these strings, and for n = 5, zero again. Hint: use k to track the difference between a's and b's. So for instance if your current is aaabb then k should be equal to either 1 or -1 (your choice depending). When you call the function, you should call it from your main or testing function with the length in the n parameter, 0 should be put into the k parameter, and then an empty string will be passed in for current.
c++ Implement a function that recursively calculates the nth number in the Fibonacci sequence of numbers. The Fibonacci sequence starts at 0 and 1. Each number thereafter is the sum of the two preceding numbers. This gives us the following first ten numbers: 0,1,1,3,5,8,13,21,34, .... Input Expected output0 01 17 139 34
Write a recursive function, displayFiles, that expects a pathname as an argument. The path name can be either the name of a file or the name of a directory. If the pathname refers to a file, its filepath is displayed, followed by its contents, like so: File name: file_path Lorem ipsum dolor sit amet, consectetur adipiscing elit... Otherwise, if the pathname refers to a directory, the function is applied to each name in the directory, like so: Directory name: directory_path File name: file_path1 Lorem ipsum dolor sit amet... File name: file_path2 Lorem ipsum dolor sit amet... ...
Write a recursive function, displayFiles, that expects a pathname as an argument. The path name can be either the name of a file or the name of a directory. If the pathname refers to a file, its filepath is displayed, followed by its contents, like so: File name: file_path Lorem ipsum dolor sit amet, consectetur adipiscing elit... Otherwise, if the pathname refers to a directory, the function is applied to each name in the directory, like so: Directory name: directory_path File name: file_path1 Lorem ipsum dolor sit amet... File name: file_path2 Lorem ipsum dolor sit amet... ... # Put your code here import os #module used to interact with operating system def displayFiles(pathname): #recursive function that takes a pathname as argument if (os.path.isdir(pathname)): #checks if specified path (argument) is an existing directory #for item in os.listdir(pathname): for content in os.listdir(pathname): #gets the list of all files and directories in the directory and…
using python In a jupyter notebook, implement a recursive function anagrams() that computes anagrams of a given word. An anagram of word A is word B that can be formed by re-arranging the letters of A. For example, the word pot is the anagram of the word top. Your function will take as an input the name of a file of words and as well a word, and print all the words in the file that are anagrams of the input word. Used the attached file words.txt as your file of words. words.txt Points for handling base case, a step that brings you closer to solving the problem, and correctly reading from the file. >>> anagrams("words.txt, trace) crate cater react
Write a Python function called name_processor that takes a list of students' full names and returns a new list containing the names in the format "Last, First". You can assume that the list contains only strings and that the strings are not empty. In the original list, first and last names are separated by a space e.g. "First Last". Some full names may contain a middle name e.g. "First Middle Last". In these cases, ignore the middle name. It is possible that a student has only a single name (i.e. one word, no spaces). In these cases, add the name to the new list without changing its format. An example: Calling the function with this list: ["Pele", "Sarah Jessica Parker", "Darth Vader"] ... should return this list: ["Pele", "Parker, Sarah", "Vader, Darth"] You will find the string method .split() useful for this problem.
Write a Python function called name_processor that takes a list of students' full names and returns a new list containing the names in the format "Last, First". You can assume that the list contains only strings and that the strings are not empty. In the original list, first and last names are separated by a space e.g. "First Last". Some full names may contain a middle name e.g. "First Middle Last". In these cases, ignore the middle name. It is possible that a student has only a single name (i.e. one word, no spaces). In these cases, add the name to the new list without changing its format. An example: Calling the function with this list: ["Pele", "Sarah Jessica Parker", "Darth Vader"] ... should return this list: ["Pele", "Parker, Sarah", "Vader, Darth"] You will find the string method .split() useful for this problem. A) Describe all the test cases you you can think of for the function you wrote for this question. For example, one test case would be a list containing a name that has…
Write a program called Recursive_fibonacci.java that implements a recursive function for computing the nth term of a Fibonacci Sequence. In the main method of your program accept the value of n from the user as a command-line argument and then call your function named Fibonacci with this value. The output should look exactly like what is pictured below.
Write a function in c that reads real (fractional) numbers, ?1, ?2, … , ?? from the keyboard into an array of N, starting from index 0. The numbers are read after a prompt.
Write a function MedianWithoutHL(ScoreList) that takes an unsorted list of n numbers as a parameter, discards the highest and the lowest numbers and return the median. You can assume the number of items in the list is between 0.0 and 9.9. To find the median from a list of items, you have tosort the list and find out the value of the item in the middle.Note: If the list has an odd number of items, the median is the value of the middle item. If the list has an even number of items, the median is the average of the two middle items.Sample Run #1:scoreList1 = [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]print("The Original ScoreList: ", scoreList1)print(MedianWithoutHL(scoreList1))Output of Sample Run #1:The Original ScoreList: [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]The List after sorting: [5.0, 6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0, 9.5]Without the High & Low: [6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0]7.75
The goal is to rewrite the function, below, such that passes in a different list of parameters, particularly eliminating the need to pass low and high for each recursive call to binary_search. defbinary_search(nums,low,high,item): mid=(low+high)//2iflow>high:returnFalse #The item doesn't exist in the list!elifnums[mid]==item:returnTrue# The item exists in the list!elifitem<nums[mid]:returnbinary_search(nums,low,mid-1,item)else:returnbinary_search(nums,mid+1,high,item) The new function should be prototyped below. The number of changes between the given version, and the one requested is not significant. defbinary_search(nums,item):pass# Remove this and fill in with your code Tip: If you consider that high and low are used to create a smaller version of our problem to be processed recursively, the version requested will do the same thing, just through a different, more Pythonic technique.
Write a recursive function named binarySearch that accepts a reference to a sorted vector of integers and an integer target value and uses a recursive binary search algorithm to find and return an index at which that target value is found in the vector. If the target value is not found in the vector, return -1. The following code shows some example calls and their expected return values: // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16vector<int>v {-4, 2, 7, 10, 15, 20, 22, 25, 30, 36, 42, 50, 56, 68, 85, 92, 103};intindex=binarySearch(v, 42); // 10intindex=binarySearch(v, 66); // -1 You should assume that the vector's elements are already sorted; you do not need to handle the case of an unsorted vector. Your function must be recursive and must use a binary search algorithm. Do not use loops or auxiliary data structures.