Suppose that you have the following recursive function written in C++. I've intentionally written the function so that it doesn't use descriptive names for anything, though that's obviously not a good design practice, but I aim not to bias your understanding of the techniques you'll be using by assuming anything about what the function's goal is; to stay "on task" here, you should resist the temptation to try to figure that out first. void kaboom( const std::vector& v, std::vector& w, unsigned int i) { if (i < w.size()) { int q = 0; for (int j : v) { 9 += j; w.at(i) = q; kaboom(v, w, i + 1); } 1. Using the techniques from our discussion of the Asymptotic Analysis of Recursion, write a recurrence that describes the time required to run the following call to kaboom for two vector v and w whose sizes are the same. Use the variable s in your recurrence to denote that size. kaboom(v, w, 0) 2. Using the repeated substitution technique, reduce the recurrence to a closed form, then give an asymptotic notation that best describes it.

Suppose that you have the following recursive function written in C++. I've intentionally written the function so that it doesn't use descriptive names for anything, though that's obviously not a good design practice, but I aim not to bias your understanding of the techniques you'll be using by assuming anything about what the function's goal is; to stay "on task" here, you should resist the temptation to try to figure that out first. void kaboom( const std::vector& v, std::vector& w, unsigned int i) { if (i < w.size()) { int q = 0; for (int j : v) { 9 += j; w.at(i) = q; kaboom(v, w, i + 1); } 1. Using the techniques from our discussion of the Asymptotic Analysis of Recursion, write a recurrence that describes the time required to run the following call to kaboom for two vector v and w whose sizes are the same. Use the variable s in your recurrence to denote that size. kaboom(v, w, 0) 2. Using the repeated substitution technique, reduce the recurrence to a closed form, then give an asymptotic notation that best describes it.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

In this question you’ll write six related recursive functions to do basic arithmetic. You’re given a starter filele, which is where you’ll write your functions, and also a test script that can check if your functions arecorrectly implemented. Every function you design must be recursive, and must follow the constraintsoutlined below.(Think of this exercise as a bunch of recursion exercises, and about what arithmetic means, which you solveby using only a restricted set of tools. No one is suggesting this results in practical software; but practicewith recursion is good. On the planet Moosetopia, the Moosetopian computer engineers have invented computers, but comparedto our computers they are very limited. Whereas we have computers that can do arithmetic, like addition,and multiplication in hardware, Moosetopian computers can not do such advanced arithmetic in hardware:they had to write a library to implement arithmetic.We’re going to simulate Moosetopian computers using simple Python…
Please answer in Python or Java: 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…
If you want to copy a shared pointer array into another array in C++, how do you do it? You've been handed a problem, and now you have to come up with creative answers. If you duplicate a shared pointer, does that mean you're also copying the objects that refer to it? Explain
in C++ langauge please and with the given functions. I submitted earlier and someone did it with a peek(); function which i didnt need and was confusing me
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…
I want code in MATLAB In this part, you are required to implement Quiz Application. Add 10 questions in your program of any domain with their answers. You many use strcmpi function to compare user answer with the saved answer. If the answer is correct/matched with the saved answer user score 1 point. Functionalities that need to be implemented in Quiz application are: - 1. The user will be asked to enter the name and then asked questions one by one. 2. The user should be given the choice to pass any question. If a user passes any question, no marks will be added or deducted. 3. The user should be able to see his/her total score after every question. 4. If 70% of the answers by the user are correct, then the user passes the Quiz otherwise, the user fails the Quiz. In both cases, the user will be displayed with a message, for example, “Congratulations, you got 8/10 correct, You Pass the Exam” or “Unfortunately, you got only 4/10, You failed the Exam”. 5. At the end of the Quiz, a user…
Consider the following code for a recursive function namedrf. You’ve been tasked with understanding why this recursive functioncauses an error. You haven’t been told what it does, but it seems to causea fault when you run rf(2). Draw out the recursive calls for rf(2) for afew steps to the best of your ability (like we’ve seen with factorial andFibonacci). What specific problem does this recursive call rf(2) have? i n t r f ( i n t number ){i f ( number == 1 ) r e t u r n 1 ;e l s e r e t u r n r f ( r f ( number − 1 ) − r f ( number − 1 ) ) ;}
А C++ program that finds all the ways in which the mouse can move to the cheese and display it with ‘*’. You can get out of a white cube. You can get out of a black cube, but you can't get out of it. Compose a recursive function path (int i, int j), receiving as parameters the coordinates of the current position of the mouse (initially 0.0, and then run with parameters (i-1, j), (i + 1, j), ( i, j-1) or (i, j + 1)).
CODE USING C++ When dealing with problems, it is always best to find the "elephant" in the room. The elephant is basically the biggest issue. Once this is resolved, it's almost always easier to move forward. As a therapist, I know how to find the elephant in the room. However, I'm feeling sick today and the next client is coming. Could you please find the elephant for me? Instructions: In the code editor, you are provided with a function, findElephant() that accepts a 2D array and returns the largest element in the array. This function has already been implemented so do not edit this. You are also provided with the 2D array in the main() function. Your only task is to call the findElephant() function and pass the 2D array, and print the return value. Output Elephant:·10
Write a recursive function that returns a value of 1 if its string argument is apalindrome and zero otherwise.* Note that for the function parameters, you need to accommodate for the shrinkingstring, so that the string shrinks both from beginning and end after each recursive call.** Think about the simple cases or base cases. The 2 base cases have conditions thatwould return 0 and return 1 independently.For the palindrome, create a driver program. First ask the user to enter anystring through the keyboard. Then remove all the spaces and punctuations from thestring. Also, remove any letter capitalization from the string. Finally, pass the string tothe palindrome function through a function call.
Write a recursive void function that has one parameter that is a positive integer. When called, the function writes its argument to the screen backward. That is,, if the argument is 1234, it outputs the following to the screen: 4321. I've literally tried to create this program and I have no idea how to make it work. Please help me. Is it possible to explain line by line what the code does?
Please use easy logic with proper indentations and comments for understanding!. Coding should be in C++. 1. Write a recursive function named printStars which receives an int parameter. If the parameter is positive, the function prints the given number of asterisks; otherwise the function does nothing. The function does not return a value. Thus, if the printStars(8) is called, ******** (8 asterisks) will be printed. The function must not use a loop of any kind to accomplish its job. Instead, it gets the job done by (recursively) calling itself.