Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
4th Edition
ISBN: 9780134787961
Author: Tony Gaddis, Godfrey Muganda
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 15, Problem 2PC
isMember Method
Write a recursive boolean method named isMember. The method should search an array for a specified value, and return true if the value is found in the array, or false if the value is not found in the array. Demonstrate the method in a
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Demonstrate Recursion Assignment Instructions
Overview
The programs we’ve discussed so far are generally structured as methods that call one another in a hierarchical manner. For some problems, it’s useful to have a method call itself—this is known as a recursive method. Such a method can call itself either directly or indirectly through another method. Recursion is an important topic discussed at length in upper-level computer-science courses.
Instructions
Write a recursive method printArray() that displays all the elements in an array of integers, separated by spaces. The array must be 100 elements in size and filled using a for loop and a random number generator. The pseudo-code for this is as follows:
//Instantiate an integer array of size 100
//fill the array
For (int i=0; i<array.length; i++)
Array[i] = random number between 1 and 100 inclusive
printArray(integer array);
For this assignment make sure that your screen shots show your program running and that your runtime…
recursive solution
oddEvenMatchRec:the method takes an integer array as a parameter and returns a boolean. The method returns trueif every odd index contains an odd integer AND every even index contains aneven integer(0 is even). Otherwise it returns fals
Exercise 1:
//The max function the max between a and b, it returns a if a == //b
public double max(double a, double b);
//The mult function returns the result of a * b public double mult(double a, double b);
//The exist in array function returns the index of the element //‘a’ if //‘a’ exist in array ‘arr’ otherwise returns ‘-1’ public int existsInArray(int [] arr, int a);
//Are array equals method compares two arrays and returns true // if the elements of array ‘a’ are equal to elements of array
// ‘b’, element by element. If equals it returns 0, it returns -
// 1 if not
public int areArrayEquals(int [] a, int [] b);
Devise four executable test cases for every method in the JUnit notation. See the attached handout for a refresher on the notation.
Chapter 15 Solutions
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
Ch. 15.2 - It is said that a recursive algorithm has more...Ch. 15.2 - Prob. 15.2CPCh. 15.2 - What is a recursive case?Ch. 15.2 - What causes a recursive algorithm to stop calling...Ch. 15.2 - What is direct recursion? What is indirect...Ch. 15 - Prob. 1MCCh. 15 - This is the part of a problem that can be solved...Ch. 15 - This is the part of a problem that is solved with...Ch. 15 - This is when a method explicitly calls itself. a....Ch. 15 - Prob. 5MC
Ch. 15 - Prob. 6MCCh. 15 - True or False: An iterative algorithm will usually...Ch. 15 - True or False: Some problems can be solved through...Ch. 15 - True or False: It is not necessary to have a base...Ch. 15 - True or False: In the base case, a recursive...Ch. 15 - Find the error in the following program: public...Ch. 15 - Prob. 1AWCh. 15 - Prob. 2AWCh. 15 - What will the following program display? public...Ch. 15 - Prob. 4AWCh. 15 - What will the following program display? public...Ch. 15 - Convert the following iterative method to one that...Ch. 15 - Write an iterative version (using a loop instead...Ch. 15 - What is the difference between an iterative...Ch. 15 - What is a recursive algorithms base case? What is...Ch. 15 - What is the base case of each of the recursive...Ch. 15 - What type of recursive method do you think would...Ch. 15 - Which repetition approach is less efficient: a...Ch. 15 - When recursion is used to solve a problem, why...Ch. 15 - How is a problem usually reduced with a recursive...Ch. 15 - Prob. 1PCCh. 15 - isMember Method Write a recursive boolean method...Ch. 15 - String Reverser Write a recursive method that...Ch. 15 - maxElement Method Write a method named maxElement,...Ch. 15 - Palindrome Detector A palindrome is any word,...Ch. 15 - Character Counter Write a method that uses...Ch. 15 - Recursive Power Method Write a method that uses...Ch. 15 - Sum of Numbers Write a method that accepts an...Ch. 15 - Ackermarms Function Ackermanns function is a...Ch. 15 - Recursive Population Class In Programming...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Explain the different aspects of the cost of a programming language.
Concepts of Programming Languages (11th Edition)
The following hands-on exercises develop additional techniques for manipulating and
accessing controls placed o...
Introduction To Programming Using Visual Basic (11th Edition)
3.12 (Date Create a class called Date that includes three pieces Of information as data
members—a month (type ...
C++ How to Program (10th Edition)
State the order of evaluation of the operators in each of the following C statements and show the value of x af...
C How to Program (8th Edition)
Define a class for complex numbers. A complex number is a number of the form a + b i where, for our purposes, ...
Problem Solving with C++ (9th Edition)
Sales Tax Write a program that will ask the user to enter the amount of a purchase. The program should then com...
Starting Out with Java: Early Objects (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
- Correctly define a method that takes and returns arrays。Create initialized and allocated arrays and array variables。Write procedures（void methods）that modify array parameters。Process arrays using selection statements and / or the logical operators。。Process arrays with loops。Use counting，accumulation，extreme value，and linear search algorithmsarrow_forwardLab Goal : This lab was designed to teach you more about recursion. Lab Description : Take a number and recursively determine how many of its digits are even. Return the count of the even digits in each number. % might prove useful to take the number apart digit by digitSample Data : 453211145322224532714246813579Sample Output : 23540 I want a code class and a runner class without the scanner classarrow_forwardMethod Implementation Design and implement a method to swap the first and the last element of an array. For example, 1 4 9 16 25 would be transformed into 25 4 9 16 1. Important: You don’t need to test this method in main(). You don’t need to initialize the array. You don’t print out the values in the method. All you need to do is swap the first with the last element. pubilc static void swapFirstLast(int [] arr) {arrow_forward
- Create a class Recursion. It will have two static methods: removeX and countSubstring and write each function recursively. Recursion class removeX The removeX function will take a String as a parameter. It will return a new String that is the same as the original String, but with all “x” characters removed. This method will be case insensitive. countSubstring The countSubstring function will take two strings as parameters and will return an integer that is the count of how many times the substring (the second parameter) appears in the first string without overlapping with itself. This method will be case insensitive. For example: countSubstring(“catwoman loves cats”, “cat”) would return 2 countSubstring(“aaa nice”, “aa”) would return 1 because “aa” only appears once without overlapping itself. Create a Main class to test and run your Recursion class.arrow_forwardparam data * @return true if all items of the array are positive (more than 0), false otherwise. * return false if the array is null. */ public boolean allPositives(int[] data) without using functionsarrow_forwardInstructions : Complete the tasks listed below. PLEASE USE THE SCREENSHOT AS A GUIDENACE ask Lists Complete the body for the recursive method fac(n) which computes n! (n factorial) for n >= 0. Note: n! = n(n - 1) (n - 2) (n - 2)… (2) (1), where n > 0 and zero factorial, 0! = 1. Complete the body for the recursive method sum(n) to compute the sum of the first n positive integers. Complete the body for the recursive method pow(x,n) for computing xn, for a positive integer n, and real number x. Complete the body for the recursive method isPalindrome(str) to determine if a string of text is a palindrome. This method accepts a String and returns true if the string reads the same forwards as backwards. The string is trivially true for empty or one(1) letter strings. Hint: You should make use of the subtring and charAt methods of the String. Run the Viewer of the Sierpinski Triangles and give a description of what you observed as it relates to recursion. Write a short summary…arrow_forward
- Lab Goal : This lab was designed to teach you more about recursion. Lab Description : Take a number and recursively determine how many of its digits are even. Return the count of the even digits in each number. % might prove useful to take the number apart digit by digitSample Data : 453211145322224532714246813579Sample Output : 23540 I want a code class and a runner classarrow_forwardQuestion 4. Recursion write a Java program.A perfect number is a number whose factors, excluding the number itself, also add up to that number.For example 6 is a perfect number since its factors (other than 6 itself) 1, 2, and 3 also add up to 6 (i.e.,1+2+3 = 6). Write a program that uses a recursion to determine if an integer provided by a user byusing Scanner object is a perfect number or notarrow_forwardLab Goal : This lab was designed to teach you more about recursion. Lab Description : Take a number and recursively determine how many of its digits are even. Return the count of the even digits in each number. % might prove useful to take the number apart digit by digit Sample Data : 453211145322224532714246813579 Sample Output : 23540arrow_forward
- Lab Goal : This lab was designed to teach you more about recursion. Lab Description : luckyThrees will return a count of the 3s in the number unless the 3 is at the start. A 3 at the start of the number does not count. /* luckyThrees will return the count of 3s in the number* unless the 3 is at the front and then it does not count* 3 would return 0* 31332 would return 2* 134523 would return 2* 3113 would return 1* 13331 would return 3* 777337777 would return 2* the solution to this problem must use recursion*/public static int luckyThrees( long number ){} Sample Data : 331332134523311313331777337777 Sample Output : 022132arrow_forwardJava: Write a recursive method that finds and returns the sum of the elements of an int array. Also, write a program to test your method.arrow_forwardIn GO language. Create a struct that has student name, id, and GPA. Write functions to create a student, modify the student’s id, and modify the student's GPA, and print the student’s information. (This is like creating a class and methods). Now create an array of three students and test your functions. You may hardcode your values if using a web conpiler. (Please hardcode the values!)arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
1.1 Arrays in Data Structure | Declaration, Initialization, Memory representation; Author: Jenny's lectures CS/IT NET&JRF;https://www.youtube.com/watch?v=AT14lCXuMKI;License: Standard YouTube License, CC-BY
Definition of Array; Author: Neso Academy;https://www.youtube.com/watch?v=55l-aZ7_F24;License: Standard Youtube License