Data Structures and Algorithms in Java
6th Edition
ISBN: 9781118771334
Author: Michael T. Goodrich
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 5, Problem 24C
Isabel has an interesting way of summing up the values in an array A of n integers, where n is a power of two. She creates an array B of half the size of A and sets B[i] = A[2i] + A[2i + 1], for i = 0, 1,…, (n/2) − 1. If B has size 1, then she outputs B[0]. Otherwise, she replaces A with B, and repeats the process. What is the running time of her
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Jeff loves to develop code for random scenarios. Today Jeff started playing with a
couple of Arrays A and B, each of size N. Initially A is filled with zeros. Jeff filled B
with random numbers. Jeff visits each index i (1 <= i <= N) in random order. When at
i, he selects another random indexj such that j is greater or equal to i. He then
increments A[i], A[i+1], A[i+2] ... Alj] by 1. Finally, if for any index i, A[i] is greater than
B[1], he then throws away that array A. For a given B, calculate the number of
different arrays A, that Jeff can end up with. Two arrays are called different if there
exists an index where the arrays have different values. Help Jeff in creating a C++
code that prints a single line containing the required answer modulo 109 + 7.
Sample Test Case:
1
111
Result:
2
Isabel has an interesting way of summing up the values in an array A of n integers, where n is a power of two.
She creates an array B of half the size of A and sets B[i] = A[2i] + A[2i + 1], for i = 0, 1,..., (n/2) – 1. If B has size 1,
then she outputs B[0]. Otherwise, she replaces A with B, and repeats the process. What is the running time of
her algorithm?
Write a program that randomly fills in 0s and 1s into a 6 * 6 matrix, prints the matrix, and finds the first row and first column with the least 1s.
Chapter 5 Solutions
Data Structures and Algorithms in Java
Ch. 5 - Prob. 1RCh. 5 - Prob. 2RCh. 5 - Prob. 3RCh. 5 - Prob. 4RCh. 5 - Prob. 5RCh. 5 - Draw the recursion trace for the execution of...Ch. 5 - Prob. 7RCh. 5 - Describe a recursive algorithm for converting a...Ch. 5 - Prob. 9RCh. 5 - Prob. 10R
Ch. 5 - Prob. 11CCh. 5 - Prob. 12CCh. 5 - Give a recursive algorithm to compute the product...Ch. 5 - In Section 5.2 we prove by induction that the...Ch. 5 - Write a recursive method that will output all the...Ch. 5 - In the Towers of Hanoi puzzle, we are given a...Ch. 5 - Write a short recursive Java method that takes a...Ch. 5 - Write a short recursive Java method that...Ch. 5 - Use recursion to write a Java method for...Ch. 5 - Write a short recursive Java method that...Ch. 5 - Prob. 21CCh. 5 - Prob. 22CCh. 5 - Prob. 23CCh. 5 - Isabel has an interesting way of summing up the...Ch. 5 - Prob. 25CCh. 5 - Prob. 26CCh. 5 - Prob. 27PCh. 5 - Write a program for solving summation puzzles by...Ch. 5 - Prob. 29PCh. 5 - Write a program that can solve instances of the...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Write a program that takes an integer keyed in from the terminal and extracts and displays each digit of the in...
Programming in C
Your country is at war and your enemies are using a secret code to communicate with one another. You have manag...
Java: An Introduction to Problem Solving and Programming (8th Edition)
What happens if ios: :out is used by itself to open a file that does not exist?
Starting Out with C++: Early Objects (9th Edition)
Give pseudocode for a recursive method that sorts all letters in a string. For example, the string "goodbye" wo...
Big Java Late Objects
Give the definitions for the member function addValue, the copy constructor, the overloaded assignment operator...
Problem Solving with C++ (9th Edition)
Look at the signature of the enrollStudent method. You will notice that the type of the expected parameter is S...
Objects First with Java: A Practical Introduction Using BlueJ (6th Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Write a Java program to find continuous sub array of the given array whose sum is equal to a given number. For example, If {12, 5, 31, 9, 21, 8} is the given array and 45 is the given number, then you have to find continuous sub array in this array such that whose elements add up to 45. In this case, {5, 31, 9} is such sub array whose elements add up to 45.arrow_forwardSuppose that you are playing a card game whose goal is to collect exactly k cards with a total value of t. Write a solution that can determine if it is possible for a given collection of cards whose values are given in the array values. For example, if the array contained the values <10,5,7,2>, k = 3, and t = 12, you would return false because no three values add to 12. However, if t = 14, you would return true, since 5 + 7 + 2 = 14. So I considered this to be a form of groupSum recursion, so I try to implement it in recursion form. However, since the passing parameters are not the incrementing level index but 'k' that is the limit number of the numbers we can choose from the array, I cannot use passing index through recursion to search from the start of the array toward the end of the values.length(the length of the array). would there be any method I can use to increment and search along the array using k, the number of numbers we can add into the total(t) instead of the…arrow_forward. Implement a program that randomly generates 10 integers from -100 to 100, stores them in a 1D array, and finds their maximum value. Calculate the execution time of finding a maximum. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. Implement a Java program that will populate a 5x5 matrix with randomly generated integers from 0 to 100. (1) print your matrix in a table form. (2) modify your code to multiply all even numbers by 10 and print the matrix. Your output of questions (1) and (2) should match the format of the following sample outputs:arrow_forward
- Given two arrays A and B of equal size N, the task is to find if given arrays are equal or not. Two arrays are said to be equal if both of them contain same set of elements, arrangements (or permutation) of elements may be different though.Note : If there are repetitions, then counts of repeated elements must also be same for two array to be equal. Example 1: Input: N = 5 A[] = {1,2,5,4,0} B[] = {2,4,5,0,1} Output: 1.arrow_forwardThe solution must be submitted in the Coral programming language. A program that reads a list of 10 integers, and outputs those integers in reverse. For coding simplicity, follow each output integer by a space, including the last one. Then, output a newline. Ex: If the input is 2 4 6 8 10 12 14 16 18 20, the output is: 20 18 16 14 12 10 8 6 4 2 To achieve the above, first read the integers into an array. Then output the array in reverse.arrow_forwardWrite a program that randomly fills in 0s and 1sinto an n-by-n matrix, prints the matrix, and finds the rows and columns with themost 1s. Here is a sample run of the program: Enter the array size n: 4 ↵EnterThe random array is0011001111011010The largest row index: 2The largest column index: 2, 3arrow_forward
- Given an array A[] of size n. The task is to find the largest element in it. Example 1: Input: n = 5 A[] = {1, 8, 7, 56, 90} Output: 90 Explanation: The largest element of given array is 90.arrow_forwardGiven an array of integers of even length, your task is to split it into two arrays of equal length such that all the numbers are unique in each of them.There may be more than one possible answer, in which case you may return any of them. If there are no possible answers, return an empty array. Hint: Count the number of occurrences of each integer in a. If there are integers occurring more than twice, then there is no solution. Next, put the integers occurring twice into both answer arrays. Finally, put all other numbers in the answer arrays, following the condition that they should have equal sizes. Example For a = [2, 1, 2, 3, 3, 4], the output can be divideArray(a) = [[2, 1, 3], [2, 3, 4]]. Answers like [[1, 2, 3], [2, 3, 4]] or [[4, 2, 3], [3, 2, 1]] would also be considered correct. For a = [1, 2, 2, 1], the output can be divideArray(a) = [[1, 2], [2, 1]]. Again, there are other possible answers. For a = [2, 2, 3, 3, 2, 2], the output should be divideArray(a) = []. No matter how…arrow_forwardWrite the Java Program to Find the Elements that do Not have Duplicates. Given an array, print all the elements whose frequency is one, that is they do not have duplicates. Example: Array = [-1, -2, 3, 3, -2] Output = -1arrow_forward
- Write a program that reads an array A of N elements containing only 0's and 1's. Your program should find the position of a 0 and replace it with a 1 to get the longest continuous sequence of 1's. Let this position of 0 be called P. Print P if such a 0 exists and print -1 if the original array A contains only 1's. Assume the array indexing starts from 0.arrow_forwardComplete the implementation of scrabble.c, such that it determines the winner of a short scrabble-like game, where two players each enter their word, and the higher scoring player wins. Notice that we’ve stored the point values of each letter of the alphabet in an integer array named POINTS. For example, A or a is worth 1 point (represented by POINTS[0]), B or b is worth 3 points (represented by POINTS[1]), etc. Notice that we’ve created a prototype for a helper function called compute_score() that takes a string as input and returns an int. Whenever we would like to assign point values to a particular word, we can call this function. Note that this prototype is required for C to know that compute_score() exists later in the program. In main(), the program prompts the two players for their words using the get_string() function. These values are stored inside variables named word1 and word2. In compute_score(), your program should compute, using the POINTS array, and return the score…arrow_forwardWrite a program that fills an integer array of size 1000 with random positive integers between 1 and 10.Assume that each element represents a different city and the integers stored in the array represent thenumber of golds in those cities. The program traverses over the array and collects the golds at each city,starting from a random position. When the program visits a certain city, all of the golds are collected,and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues withthe rule given below. If the position at the nth step is denoted by pn, and the number of golds at the citypn is denoted by gn,??+1 = {| ((??−1 + ?? + ??) ???1000|, ????? 2 = 0| ((??−1 + ?? − ??) ???1000|, ????? 2 = 1.The program continues visiting cities until the last three visited city has no gold.The program, at each visit, should print out the following information:• The current city index (pn).• The previous city index (pn-1).• The number of golds at the current city…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Definition of Array; Author: Neso Academy;https://www.youtube.com/watch?v=55l-aZ7_F24;License: Standard Youtube License