Consider the array A[1 . . . n] consisting of n non-negative integers. There is a frog on the LAST index of the array, i.e. the nth index of the array. In each step, if the frog is positioned on the i th index, then it can make a jump of size at most A[i] towards the beginning of the array. In other words, it can hop to any of the indices i, . . . , i − A[i].

Consider the array A[1 . . . n] consisting of n non-negative integers. There is a frog on the LAST index of the array, i.e. the nth index of the array. In each step, if the frog is positioned on the i th index, then it can make a jump of size at most A[i] towards the beginning of the array. In other words, it can hop to any of the indices i, . . . , i − A[i].

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Write the code in Java language
in java ecplise . Implement a program that randomly generates 10 integers from -100 to 100,stores them in a 1D array, and finds their maximum value. Calculate theexecution time of finding a maximum. Repeat the test for 10,000 and10,000,000 numbers. Provide your results in the form of a table below andprovide a small summary. Implement a Java program that will populate a 5x5 matrix with randomlygenerated 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 followingsample outputs:
Person receives text (string) messages on his/her phone. Message memory of a phone is very limited. A buffer is provided for storing messages when phone memory gets full. Message from buffer is loaded into phone memory when space is available. Messages are moved from buffer to phone in such a way that first received message is viewed first on screen. Implement buffer only using array. question solved in data structure
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.
Searches – Directed Lab Work1. When an object does not occur in an array, a sequential search for it must examine the entirearray. If the array is sorted, you can improve the search by using the approach described inExercise 2. A jump search is an attempt to reduce the number of comparisons even further.Instead of examining the n objects in the array a sequentially, you look at the elements a[j],a[2j], a[3j], and so on, for some positive j < n. If the target t is less than one of these objects,you need to search only the portion of the array between the current object and the previousobject. For example, if t is less than a[3j] but is greater than a[2j], you search the elementsa[2j + 1], a[2j + 2], . . ., a[3j - 1] by using the method in Exercise 2 on the textbook’s page544. The implementation should take care of the case when t > a[k × j], but (k + 1) × j > n.Devise an algorithm for performing a jump search.Then, using⌈√n⌉as the value of j, implement the jump search. Add more…
In a non-empty array of integers, the priority of a number is determined by the frequency of its occurrence. Elements are added as they come but the most frequent element is deleted first. If two elements have the same priority, then the element which came first will be deleted first. For example: nums = [1,2,3,1,3,1,3,2,3]. After the first deletion now the array will be num=[2,3,3,3,2,3]. Implement a priority queue for the aforementioned scenario. give the answer in brief and the correct one.
A shrinkable word is a word with more than two characters that can be reduced down to a two-character c-string by deleting one character at a time such that, at each stage, the remaining c-string is a word that must be found in a two-dimensional c-string array. For example, to check if the word startling is shirnkable we start by deleting one character; it could be any character in the word. When trying to delete the character 'l', the c-string becomes starting which is a c-string found int the two-dimensional array dictionary. Next, we continue by trying to delete another character which turns out to be the second 't' and the c-string becomes staring. In the same fashion, the c-string becomes string, sting, sing, sin, and finally in which must also be found in the dictionary. At this point, the original word (i.e. startling) is considered shrinkable. An example of non-shrinkable word is table. When trying to delete one character, we get the c-string able. However, when trying to…
Suppose we are given an array of numbers A[0], A[2], . . . , A[n - 1]. You may assume that n is a multiple of6. We wish to find a number x that simultaneously satisfies two properties: First, x should be in the middle two-thirds ofthe array (in other words, x = A[i] for some n/6 <= i < 5n/6). Second, after sorting the array, x should still be in the middletwo-thirds.2a) Prove that such an x exists. (Hint: how many values are not in the middle two-thirds of the original array? How manyare not in the middle two-thirds of the sorted array?)2b) Describe a linear time algorithm for finding such an x. (Note, if your solution calls one of the algorithms described inthe lectures, you should just refer to it by name, e.g. “quicksort”, rather than explaining how it works.)
You are given an array of positive integers S[1, . . . , n]. You are initially positioned at the array’s first index 1, and each element S[i] represents your maximum length of jump at position i. For example, you can jump from position i to any position among i + 1, . . . , i + S[i]. Return true if you can reach the last index, or false otherwise. Precisely define the subproblem.Provide the recurrence equation.Describe the algorithm in pseudocode to compute the optimal value.Describe the algorithm in pseudocode to print out an optimal solution.
In an array-based implementation of a List, why does the add operation take O(n) time in the average case? Select one: a. The time it takes to shift entries over to make room in the array depends on the number of entries in the List b. The time to copy the current entries into a newly allocated, larger array depends on the number of entries in the List c. The time to access the position in the array to add the new entry depends on the number of entries in the List d. The time to access the position in the array to add the new entry depends on the capacity of the array
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.
A website has a test bank of questions. Students usc the website to sharpen their skills. Teachers also use it to gencrate quizzes. Suppose the website generated n questions for Teacher Alice. It also provided her a size-n array T such that T[i] denotes the topic covered by question i. Teacher Alice wants to rearrange the questions so no two consecutive questions cover the same topic. That is, we say the questions are scrambled. For example, if T = [2,3, 2, 2, 1, 3] then Teacher Alice can reorder the questions as 1,2, 3, 5, 4, 6 so the new topic-array is [2,3, 2, 1, 2, 3]. Q ---> Assume the questions covers topics 1, 2,..., k, where k is some constant. Given a size-n array T, design an O(n)-time algorithm that outputs a scrambled ordering of the questions if it's possible and returns –1 otherwise. Again, justify the correctness of your algorithm and explain why it runs in lincar time. For exam- ple, if the input is T = [2, 3, 2,2, 1, 3], your algorithm should output 1,2,3, 5, 4, 6. On…