QUESTION 2 Consider the below recursive function: public static int func (int n) if (n <= 0 ) return (0); else { temp = n + func(n-2); return (temp); Draw activation frames with n=5 and determine the final output. Attach File Browse My Computer

QUESTION 2 Consider the below recursive function: public static int func (int n) if (n <= 0 ) return (0); else { temp = n + func(n-2); return (temp); Draw activation frames with n=5 and determine the final output. Attach File Browse My Computer

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

Write a recursive function that computes the length of a list. For example, (mylen ‘(1 2 3 4))should output 4.And (mylen '(blue green yellow brown red purple))should output 6.Now you will writeonePascalprogram. Pascal source code is saved in files whose names end in “.pp” like “myprogram.pp” or “cs4100lab.pp”. The “fpc” Pascal compiler can be used from the command line. So if you created a file called test.pp which contained:program first;beginwriteln(‘hello’);end. and then you typed “fpc test.pp” at the command line, fpc would compile the code and store the results in a file called “test”. Typing “test” at the command line would then run the program.
In python, rite 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... ... Test this function in a new program.
create a recursive decent parse that read ( 1 + 2 ) / 3 from a txt file import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;import java.util.StringTokenizer; public class Lexical {public static void main(String args[]) throws FileNotFoundException{//reading file (Create one and put the expression (2+5/t) or (1-9)*0)Scanner input = new Scanner(new File("Expression.txt"));while(input.hasNextLine()) {//reading next lineString line = input.nextLine();//reading tokens by spaceStringTokenizer strings = new StringTokenizer(line," ");//reading more stringswhile (strings.hasMoreElements()) {//converting object to stringString token = strings.nextElement().toString();switch(token) //switch case{case "(" :System.out.println("Next token is: 25 Next lexeme is (");break;case ")" :System.out.println("Next token is: 26 Next lexeme is )");break;case "=" :System.out.println("Next token is: 20 Next lexeme is =");break;case "+" :System.out.println("Next token is: 21 Next…
Complete the function solveMeFirst to compute the sum of two integers. In javascript Example Return . Function Description Complete the solveMeFirst function in the editor below. solveMeFirst has the following parameters: int a: the first value int b: the second value Returns- int: the sum of a and b Constraints 1<a; b<1000; process.stdin.resume();process.stdin.setEncoding('ascii'); var input_stdin = "";var input_stdin_array = "";var input_currentline = 0; process.stdin.on('data', function (data) { input_stdin += data;}); process.stdin.on('end', function () { input_stdin_array = input_stdin.split("\n"); main(); }); function readLine() { return input_stdin_array[input_currentline++];} function solveMeFirst(a, b) { return a + b; } function main() { var a = parseInt(readLine()); var b = parseInt(readLine());; var res = solveMeFirst(a, b); console.log(res);}
taks 15.1 Follow these steps:● In a file called recursion.java, create:o a recursive function that reverses a stringo a recursive function that, given a number n, prints out the first nFibonacci numbers (Fibonacci numbers are a sequence whereeach number is the sum of the previous two - 0 1 1 2 3 5 8...)
Given an integer array of positive single digit values such as:int a[] = {8,4,2,6,9};1) Write a recursive arrayToN function which returns the concatenation of all array values as an integer value.This function should accept all required data as parameters and return a long integer value.ExamplesIf the array is 8 4 2 6 9 the arrayToN function returns the integer 84269.If the array is 0 2 6 8 9 3 5 1 the arrayToN function returns the integer 2689351.
In Java language Declare a constant V with value 5 Declare a variable named Graph that is an integer matrix of VxV Define a MENU procedure with the following text GRAPH 1. Create Graph 2.ShowGraph 3. Adjacency between pair 4. Input degree 5.Output degree 6.Loops 0.Exit Validate MENU so that it receives only valid options (from 0 to 6), otherwise send an error message and repeat the reading Make the MENU call in the main program Define a CREATE procedure/function to fill an array with random values between 0 and 1. Where 0 represents no adjacency and 1 indicates there is. Making the CREATE call in the main program receives as a parameter the Graph array created at point Define a SHOW procedure/function to print an adjacency matrix, in matrix form Make the SHOW call in the main program, it receives as a parameter the Graph array created in point 2 Define an ADJACENCY procedure/function that receives, apart from the array, two integer values and returns a true value if…
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…
can you please convert this python code into java? Python code is as shown below: # recursive function def row_puzzle_rec(row, pos, visited): # if the element at the current position is 0 we have reached our goal if row[pos] == 0: possible = True else: # make a copy of the visited array visited = visited[:] # if the element at the current position has been already visited then it's a loop. # as then its not possible to reach the last element, set possible to False if visited[pos]: possible = False else: # set visitied for the element as True visited[pos] = True possible = False # if its possible to move left then recurse in the left direction if pos - row[pos] > 0 and row_puzzle_rec(row, pos - row[pos], visited): # return immediately if the goal is reached return True # if its possible to move right then recurse in…
PLEASE HELP ME ON THE NESTED LOOPING FUNCTION ON THE LAST... WHERE IN (When done, ask user to repeat or go back to main menu) So it must return to Main function when the user will choose "N" pleaseee,,,#include <stdio.h>#include <conio.h> int ch; void Nestedlooping();void Recursion();void Array();void FileHandling();void Exit(); void main(){ while (1); printf("\n\n\t\t\t oooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo\n"); printf("\n\n\t\t\t oo \t\t ALLEAH CPE112 Final Exam Menu Programs oo"); printf("\n\n\t\t\t oo \t\t \n\nPress (1) for Nested Looping oo"); printf("\n\n\t\t\t oo \t\t \nPress (2) for Recursion oo"); printf("\n\n\t\t\t oo \t\t \nPress (3) for Array oo"); printf("\n\n\t\t\t oo \t\t \nPress (4) for File Handling oo"); printf("\n\n\t\t\t oo \t\t \nPress (5) to…
Under your module imports, paste the following definitions: (define WIDTH 300) (define HEIGHT 160) (define ES (empty-scene WIDTH HEIGHT)) (define (next-size s) (/ s 2)) Write a tail-call recursive function called circles in Racket. This function should take two numbers, x and size, and a Scene scn. If size is less-than or equal to 2, then your function returns the scn unchanged (base case). Otherwise, your function should place a circle in the Scene that results from a recursive call to circles with x shifted by (+size (next-size size)), a new size of (next-size size), and using the original Scene. After evaluating (circles 100 48 ES), your function should output this image of five blue circles, in this order, with the first circle at (x,y) coordinate position (100, 80):