In c++ 7.11 LAB: Number patternWrite a recursive function called PrintNumPattern() to output the following number pattern.Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until a negative value is reached, and thencontinually add the second integer until the first integer is again reached. For this lab, do not end output with a newline.Ex. If the input is:123the output is:12 9 6 3 0 3 0 3 6 9 12450942.2771164.qx3zg/7LABACTIVITY1 #include 23 using namespace std;7.11.1: LAB: Number pattern45 // TODO: Write recursive Print NumPattern() function67 int main() {8910111213141516 }int numiint num2;cin >> num1;cin >> num2;PrintNumPattern (num1, num2);return 0;Develop modeSubmit modemain.cppEnter program input (optional)If your code requires input values, provide them here.0/10Load default template...Run your program as often as you'd like, before submitting for grading. Below, type any neededinput values in the first box, then click Run program and observe the program's output in thesecond box."

Answered: In c++ | bartleby

Engineering

Computer Science

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

See similar textbooks

Similar questions

3.6 LAB: Number pattern Write a recursive function called print_num_pattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. For coding simplicity, output a space after every integer, including the last. Do not end output with a newline Ex. If the input is: 12 3 the output is 12 9 6 3 0 3 6 9 12 0/10 LAB ACTIVITY 3.6.1: LAB: Number pattern main.py Load default template 1. TODO: Write recursive print_num_pattern() function 2 3 if name "main": 4 numi int(input()) 5 num2 int(input()) print_num_pattern(num, num2)
4.10 LAB: All permutations of names 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, then use a recursive function to create and output all possible orderings of those names separated by a comma, one ordering per line. When the input is: Julia Lucas Mia then 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 def print_all_permutations(permList, nameList): # TODO: Implement method to create and output all permutations of the list of names. if __name__ == "__main__": nameList = input().split(' ') permList = [] print_all_permutations(permList, nameList)
4.11 LAB: Number pattern Write a recursive function called print_num_pattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until a negative value is reached, and then continually add the second integer until the first integer is again reached. For this lab, do not end output with a newline. Do not modify the given main program. Ex. If the input is:
6.9 LAB: All permutations of names 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 then 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 import java.util.Scanner;import java.util.ArrayList; public class PhotoLineups { // TODO: Write method to create and output all permutations of the list of names.public static void allPermutations(ArrayList<String> permList, ArrayList<String> nameList) {} public static void main(String[] args) {Scanner scnr = new Scanner(System.in);ArrayList<String> nameList = new ArrayList<String>();ArrayList<String> permList = new ArrayList<String>();String name;//…
11.10 LAB: All permutations of names 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 then 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 #include #include main.cpp: using namespace std; // TODO: Write method to create and output all permutations of the list of names. void AllPermutations(const vector &permList, const vector &nameList) { } int main(int argc, char* argv[]) { vector nameList; vector permList; string name; // TODO: Read in a list of names; stop when -1 is read. Then call recursive method. return 0; }
11.10 LAB: All permutations of names 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 then 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 Please help with //TODO #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…
6.14 Lab: Reversing an Integer. In this problem, your task is to complete the reverseNumber(num) function. The input of the function is an integer number num. The function should return a number where all the digits are reversed from the original number. You can assume that the input will be a non-negative integer. Example 1: If the input is: 123 The output is: 321 Example 2: If the input is: 321 The output is: 123 Example 3: If the input is: 1000 The output is: 1 Brainstorming. Oftentimes, a problem as formulated can be made easier when you change the way the data is represented. In this case, this problem can be solved in a clever way using strings. If you first convert the number into a string, you can then reverse the string and convert the number back to an integer. def reverseNumberUsingString(num): numInStringFormat = str(num) #converts the number into a string reversedNumberInStringFormat = numInStringFormat[::-1] #reverses the string reversedNumber =…
Part 5: Programming exercise (Optional) Write a recursive program called generateSum to read a positive integer N from user input and output all possible combination of two or more numbers which sum of the numbers is N. You can use function such as void genNum (int N, int N, String output). Example run: Enter number: 4 4 31 22 211 1111 Enter number: 6 6 51 42 411 33 321 3111 222 2211 21111 111111
11.11 LAB: Number pattern Write a recursive function called PrintNumPattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. For this lab, do not end output with a newline. Ex. If the input is: 12 3 the output is: 12 9 6 3 0 3 6 9 12 main.cpp: #include using namespace std; // TODO: Write recursive PrintNumPattern() function int main(int argc, char* argv[]) { int num1; int num2; cin >> num1; cin >> num2; PrintNumPattern(num1, num2); return 0; }
4.3.1: Calling a recursive function. Write a statement that calls the recursive function backwards_alphabet() with input starting_letter.Sample output with input: 'f'f e d c b a def backwards_alphabet(curr_letter):if curr_letter == 'a':print(curr_letter)else:print(curr_letter)prev_letter = chr(ord(curr_letter) - 1)backwards_alphabet(prev_letter) starting_letter = input() ''' Your solution goes here '''
5.6 Mat
Q1: Write a function that receives marks received by a student in 3 subjects and returns the average and percentage of these marks. Call this function from main() and print the results in main(). Q2: A positive integer is entered through the keyboard, write a function to display the Fibonacci series upto 'n’ positive integer (1) Without using recursion (2) Using recursion Q3: To fully define a variable one needs to mention not only its 'type’ but also its 'other properties'. In other words, not only do all variables have a data type, they also contain other properties. Explain the concept that will help us to describe the properties of any variable. Q4: Write a short note on one dimensional Arrays.