Ex 6) This exercise uses sub-algorithms. Trace it for when input value is 6 and complete the trace tables. Also note that there are two variables name num, one in the main algorithm and another in the sub-algorithm. They are not related. Assume input is a positive integer. Write pre- post-conditions for each of these algorithms (the main one and the sub-algorithm). Note that the prime sub-algorithm is similar to the algorithm in Ex 1) but instead of reading input and producing outputs, it has a parameter num, and it returns the result. Also note that the true is in gray color, which means it can be ignored. Note that since the sub-program is called several times, it's better that you use separate trace tables, one for each call, as shown below. start num 142 i<+1+1 is num T prime()-true F prime(num) start flag-true d+2 flog true and ds num/2 num mod d=0 3 umed value

Ex 6) This exercise uses sub-algorithms. Trace it for when input value is 6 and complete the trace tables. Also note that there are two variables name num, one in the main algorithm and another in the sub-algorithm. They are not related. Assume input is a positive integer. Write pre- post-conditions for each of these algorithms (the main one and the sub-algorithm). Note that the prime sub-algorithm is similar to the algorithm in Ex 1) but instead of reading input and producing outputs, it has a parameter num, and it returns the result. Also note that the true is in gray color, which means it can be ignored. Note that since the sub-program is called several times, it's better that you use separate trace tables, one for each call, as shown below. start num 142 i<+1+1 is num T prime()-true F prime(num) start flag-true d+2 flog true and ds num/2 num mod d=0 3 umed value

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 17PE

See similar textbooks

Similar questions

Exercise # 2: Map search For the location map search example explained in the Greedy best first search and A* algorithm, change the search algorithm to follow the uniform cost algorithm (UCS). Run the new code and compare the results of UCS versus Greedy & A*, in terms of the levels required and the number of nodes expanded. IT HAS TO BE IN PYTHON LANGUAGE
Make Algorithm to illustrates the quick sort procedure. The algorithm employs the Divide and Conquer principle by exploiting procedure PARTITION to partition the list into two sublists and recursively call procedure QUICK_SORT to sort the two sublists.
Double trouble def double_trouble(items, n): Suppose, if just for the sake of argument, that the following operation is repeated n times for the given list of items: remove the first element, and append that same element twice to the end of items. Which one of the items would be removed and copied in the last operation performed? Sure, this problem could be finger-quotes “solved” by actually performing that operation n times, but the point of this exercise is to come up with an analytical solution to compute the result much faster than actually going through that whole rigmarole. To gently nudge you towards thinking in symbolic and analytical solutions, the automated tester is designed so that anybody trying to brute force their way through this problem by performing all n operations one by one for real will run out of time and memory long before receiving the answer, as will the entire universe. To come up with this analytical solution, tabulate some small cases (you can implement the…
COSC2006 Final Project to be assigned 23:59, Wednesday, July 26th. The Project Two students work together to complete the program to compare the performance of two algorithms implemented on the same data structure. The table at the end shows the tasks randomly assigned respectively to teams of two. On the first row of the table, Hrithik and Sahil will implement Bubble Sort and Merge Sort on a Linked List. On the last row, Avkashkumar and Upal will implement Insertion Sort and Selection Sort on an array or ArrayList. You will generate random keys for your input data. You must compare two sorting algorithms using the same input data. (If you generate a new set of random keys for the second sorting algorithm, the two sorting algorithms will run on different input data and their results may not be comparable.) Determine the time complexity of your two assigned sorting algorithms based on your code with explanation. If the performance differs according to the pattern of the input…
Create an Algorithm to demonstrate the rapid sort operation. The algorithm leverages the Divide and Conquer principle by partitioning the list into two sublists and then recursively using procedure QUICK SORT to sort the two sublists.
1. (a) 1. (a) 1 A) Design an algorithm that inputs two lists of numbers, A, and B, of lengths n and m respectively, and finds out (and prints) how many common elements they contain. For example, if A contains 104, 195, 26, 503, 404, 793, 39, 995 and B contains 612, 27, 39, 321, 104 the algorithm will output 2 (because 39 and 104 are common to both lists). B) What is the efficiency of your algorithm in terms of m and n? Please use really simple worded pseudocode
No programming required 2. Merge sorts a) Give traces, in the style discussed in class, showing how the keys I, L, O, V, E, A, L, G, O, R, I, T, H, M, S are sorted for the following sorting mergesort algorithms: a. Top-down mergesort b. Bottom-up mergesort
Create a NxN jigsaw puzzle. Create data structures and describe an algorithm to solve the challenge. Assume you have a fi tsWi th function that, when two puzzle edges are supplied to it, returns true if the two edges belong together.
0 A ladder tournament L can be split into two separate ladder tournaments L and L byassigning each player either to L or to L. The new ranks of the players are adjustedso that they do not contradict the relative rankings in L. However, there are manyways to define the inverse operation, joining two tournaments of disjoint players.Design algorithm Join-Ladder-Tournaments(L, L) that gives both tournamentsan equal value. This means, for example, that the joining does not force the championof L to compete against the worst players in L before she can have a match withthe champion of L
Subj:- Design & Anal Algorithms Please compelete all the three questions since it has to be answereda once. Thank you in advance. Three animals stand next to each other by size, as follows: An Elephant, followed by a Hippo, followed by a Panda bear, [E, H, P]. Your goal is to re-arrange them so that they are sorted in the opposite size-based order. You are only allowed to switch positions of neighboring animals. Do not use Insertion or Merge sort. Try to use your own strategy to re-arrange the array. (a) How many operations do you need to reverse the order of the three animals? (b) Let’s generalize the above. You have an array of n elements whose ordering you want to revers. Write pseudo code to do this. (c) How many operations do you need to reverse the ordering of an array of n? Your answer should be a function of n.
Task 4 Get Binary 2: For task 4 Implement the get_bin_2 function as directed in the comment above the function. If the directions are unclear, run the code, and look at the expected answer for a few inputs. For your solution, you should refer to your solution for Task 2 to get the general idea for Task 4, and you should use largest_po2_le in your solution (think about why this might be useful in terms of the binary representation). Make sure you build the string for 0 and negative numbers correctly. The same restrictions apply from Task 2. Code#include <stdio.h>#include <stdbool.h>#include <stdlib.h> // BEGIN STRINGBUILDER IMPLEMENTATION // This code is a very rudimentary stringbuilder-like implementation// To create a new stringbuilder, use the following line of code//// stringbuilder sb = new_sb();//// If you want to append a character to the stringbuilder, use the// following line of code. Replace whatever character you want to// append where the 'a' is.////…
Application: Apply Algorithm (Q5 – Q7) The following questions ask you to manually apply an algorithm introduced in the lecture and demonstrate your understanding by describing intermediate states of the computation. Question 5 (Sorting) Write down the list content at the end of each iteration of the main loop (ie. end of each pass) of Insertion Sort for the following list: [14,12,7,4,18,9] Use one line for each pass. Question 6 (Graph Traversal) Apply Depth First Search (DFS) to traverse the following graph. Start your traversal from vertex 0, and write down the order in which vertices will be visited during the traversal. (image for this question also attached) Question 7 (Gaussian elimination) (image for this question also attached) Apply forward elimination to this system of linear equations to put it into the upper triangular form. ⎛⎝⎜⎜1 1 2225−12−1⎞⎠⎟⎟⎛⎝⎜⎜? ? ?⎞⎠⎟⎟=⎛⎝⎜⎜6 3 13⎞⎠⎟⎟(12−1 122 25−1)(� � �)=(6 3 13) Write each row operation you use to solve the problem. Find…