Consider the following pseudocode segment k = (j+13) / 27 loop: if k 10 then goto out k = k + 1 i = 3 * k 1 goto loop out: (a) Using a loop structure, rewrite the above pseudocode two times: Once in Python and another in either C or Java. (b) Assuming all variables are integer type, discuss which language, for this code, has the best writability, the best readability, and the best combination of the two.

Consider the following pseudocode segment k = (j+13) / 27 loop: if k 10 then goto out k = k + 1 i = 3 * k 1 goto loop out: (a) Using a loop structure, rewrite the above pseudocode two times: Once in Python and another in either C or Java. (b) Assuming all variables are integer type, discuss which language, for this code, has the best writability, the best readability, and the best combination of the two.

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

See similar textbooks

Similar questions

Ackermann's function (A) is defined as:A(m,n):Ackermann's function (A) is defined as:A(m,n):n+1, if m=0A(m-1,1), if m>0 and n=0A(m-1,A(m,n-1)), if m>0 and n> 0Write a recursive Python function to implement Ackermann's function. How many recursive calls willbe required to evaluate A(2,3)?n+1, if m=0A(m-1,1), if m>0 and n=0A(m-1,A(m,n-1)), if m>0 and n> 0Write a recursive Python function to implement Ackermann's function. How many recursive calls willbe required to evaluate A(2,3)?
Make a program in C language of the following: 1. Make a tic-tac-toe game Please do the above using the most simplest and efficient way possible. No use of Pointers Please.
For 'C' programming language A. Constant expressions are evaluated at compile B. String constants can be concatenated at compile time C. Size of array should be known at compile time D. All of these
Please answer in Python In this assignment, you will do an implementation of the Huffman Code. If you have the Data Structures book for this class, on pages 415-421 is the theory for encoding a String using the Huffman Code. There is also a PDF of these pages on the class website. Your task is to develop a proof of concept of the Huffman Code and demonstrate it by taking a String and encoding it. The Huffman Code requires knowledge of a few data structure concepts discussed in class: Priority Queues Binary Trees Recursion Arrays and/or Linked Lists In your program, you will demonstrate an understanding of all these concepts by developing your own priority queue, node, binary tree, array, and/or linked list, and use of recursion to support the Huffman Code encryption algorithm. Read through the theory of the Huffman Code in the text and then write a program that can take a String and encrypt it. For example, given a String “Hello World”, the program should apply the Huffman Code…
Question 3: What is the time complexity of following code. Show the time complexity of each statement below and the final running time. For computing the running time, you must show an example of tracing the algorithm as we did in the (Data Structures and Algorithms in Java Michael T. Goodrich. Roberto Tamassia. Michael H.) int a, b, c = 0; for (a= n / 2; a<= n; a++) { for (b = 2; b <= n; b= b* 2) { c = c+ n/ 2; }
Write a code in C++ that calculates the times for each of the algorithms (functions). The code must execute the result showing the largest size n of each algorithm (function) that can be solved in time t
3. Implement a recursive function for an in Python.
A palindrome is a string that reads the same forwards or backwards; for example dad, mom, deed are palindromes (i.e., reversing a palindrome produces the same string). Use C++ Programing language Write a recursive, boolean-valued function, isPalindrome that takes a string as a parameter and returns whether the string is a palindrome. A string, s, is a palindrome if: s is the empty string or s consists of a single letter (which reads the same back or forward), or the first and last characters of s are the same, and the rest of the string (i.e., the second through next-to-last characters) form a palindrome. Write a test program that reads a string from the standard input device and outputs whether the input string is a palindrome or not.
using recursion python Consider the English alphabet consisting of 26 lowercase letters: a, b, c, · · ·, x, y, z. • To this order, letters appear earlier are defined smaller. For example, the letter a is smaller than the letter b, and z is the largest letter since it appears last in the alphabet. • The least letter of an English word is the smallest letter that appears in that word. For example, the least letter of “Saturday” is “a”, and the least letter of “hello” is “e”. You are asked to write a program consisting of a function and a main interface as follows. (a) function recur_least_letters(l): Goal: collects all the least letters of words in list l (one least letter for each word) and returns the string of the obtained least letters in the order that the corresponding words appear in list l. • Input: a list l of English words • Output: string of all the least letters of words appearing in list l • Example: input: l = [‘today’, ‘is’, ‘saturday’] → output: “aia” Recursion is…
Implement the game of tic-tac-toe in Haskell. Your implementation should run entirely from a terminal. Your playing board should appear in ASCII in the following format: An updated board should be displayed to the screen after each turn. The computer player should attempt to block a win whenever the human player has two in the same row and a third cell is empty. At the end of each game, your system should offer to play another game. At the end of the session, the number of games won by each side should display.
Write in c language please, The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which has an index n as a parameter and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci(7) is 13 Note: Use a for loop and DO NOT use recursion.
implement the following tasks using recursive functions in C programming: Summation of the integers 1, 2, 3, …, n Factorial function Fibonacci numbers Power of n raised by m Summation of the elements of an array of integers The minimum element of an array of integers