1. In quiz1.c implement digit_sum_base function using recursion that calculates the digit sum of a number's presentation with base as base. For example, if base is 2, a binary number, digit_sum_base(5, 2) should be 5's binary reprentation 101, adding up all digits together and we have 2. digit_sum_base(1234, 10) should be 10 = (1+2+3+4). You may assumen is always non-negative integer and base is an integer between 2 to 10 inclusive. 2. In main.c implement the main function so that when we run the program this is what happens: %./main Enter an int: 0 Enter a base: 10 answer is 0. $ ./main Enter an int: 1234 Enter a base: 10 answer is 10.

1. In quiz1.c implement digit_sum_base function using recursion that calculates the digit sum of a number's presentation with base as base. For example, if base is 2, a binary number, digit_sum_base(5, 2) should be 5's binary reprentation 101, adding up all digits together and we have 2. digit_sum_base(1234, 10) should be 10 = (1+2+3+4). You may assumen is always non-negative integer and base is an integer between 2 to 10 inclusive. 2. In main.c implement the main function so that when we run the program this is what happens: %./main Enter an int: 0 Enter a base: 10 answer is 0. $ ./main Enter an int: 1234 Enter a base: 10 answer is 10.

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

(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.
In C language please
In C programming, write a program that reads to matrices of integers
In C++ Write a recursive function that displays a string reversely on the console using the following header:void reverseDisplay(const string& s) For example, reverseDisplay("abcd") displays dcba. Write a test programthat prompts the user to enter a string and displays its reversal.
here is my c++ problem I'm working on. I have to use recursion to find all possible anagrams of a word. for example Please enter a string for an anagram: artMatching word artMatching word ratMatching word tarPlease enter a string for an anagram: regardlessNo matches found the txt file consists of words from A to Z about 28,000 words need help finishing this problem. but may not use any of C++'s iteration constructs (do, while, for, and goto) or any STLalgorithms #include <iostream>#include <fstream>#include <istream>#include <cstring>using namespace std; const int MAXRESULTS = 20; // Max matches that can be foundconst int MAXDICTWORDS = 30000; // Max words that can be read in int loadWords(istream& dictfile, string dict[]);int recBlends(string word, const string dict[], int size, stringresults[]);void showResults(const string results[], int size);void printPermutations(string prefix, string rest); void loop(string prefix, string rest, int i, int max);…
For function decToBinary, write the missing parts of the recursion case. This function should return a string that stores the binary equivalent for int variable num. Example: The binary equivalent of 13 may be found by repeatedly dividing 13 by 2. So, 13 in base 2 is represented by the string "1101". Examples: decToBinary(13) -> "1101" public String decToBinary (int num) { if (num < 2) return Integer.toString(num); else return <<Missing recursive call>> + <<Missing calculation>>;}
Recursive Palindrome! Recall that a palindrome is a string that reads the same forward and backward. Write a recursive function is_palindrome (s:str) -> bool to check whether a string s is a palindrome. Here's a hint: think about how you can use is_palindrome(t), where t is a substring of s, to help you decide whether s is a palindrome. Your Answer: 1 # Put your answer here 2 Submit
Good day
Use C Language Write a program that reads two matrices of integers. It then generates the sum and difference of the two matrices. The sum of the two matrices of the same size is a matrix with elements that are the sums of the corresponding elements of the two given matrices. Addition is not defined for matrices of different sizes. If A and B are matrices of the same size, then we define subtraction as follows: A – B = A + (-B). Thus, to subtract matrix B from matrix A, we simply subtract corresponding elements.
Use C Language Write a program that reads two matrices of integers. It then generates the sum and difference of the two matrices. The sum of the two matrices of the same size is a matrix with elements that are the sums of the corresponding elements of the two given matrices. Addition is not defined for matrices of different sizes. If A and B are matrices of the same size, then we define subtraction as follows: A – B = A + (-B). Thus, to subtract matrix B from matrix A, we simply subtract corresponding elements.
In C++ Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one word names (until -1), and use a recursive method to create and output all possible orderings of those names, one ordering per line. When the input is: Julia Lucas Mia -1 hen the output is (must match the below ordering): Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia #include <vector>#include <string>#include <iostream> using namespace std; // TODO: Write method to create and output all permutations of the list of names.void AllPermutations(const vector<string> &permList, const vector<string> &nameList) { } int main(int argc, char* argv[]) { vector<string> nameList; vector<string> permList; string name; // TODO: Read in a list of names; stop when -1 is read. Then call recursive method. return 0;}
In python. Include docstring. Please follow code requirements as listed below. Write a recursive function named is_subsequence that takes two string parameters and returns True if the first string is a subsequence of the second string, but returns False otherwise. We say that string A is a subsequence of string B if you can derive A by deleting zero or more letters from B without changing the order of the remaining letters. The empty string (which has zero characters) is considered a subsequence of any string (since you can derive it by deleting zero or more letters from any string). You can assume that the only characters in the strings will be lower case letters (though that shouldn't really affect your code). Note: subsequences are different than substrings, since the characters of a subsequence don't have to be consecutive. For example, 'aeiou' is a subsequence of 'faceitious', since all the characters appear in the same order, even though they're not consecutive. You may use…