
Introduction to Java Programming and Data Structures, Comprehensive Version, Student Value Edition (11th Edition)
11th Edition
ISBN: 9780134671604
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 18, Problem 18.3PE
(Compute greatest common divisor using recursion) The gcd (m, n) can also be defined recursively as follows:
- If m % n is 0, gcd(m, n) is n.
- Otherwise, gcd (m, n) is gcd (n, m % n).
Write a recursive method to find the GCD. Write a test
Expert Solution & Answer

Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Develop a script in a language of your choice (e.g., Python, PowerShell) that automates a
routine network security task (e.g., scanning a network for open ports, automating log
analysis for suspicious activities). Provide detailed comments within your code to explain
its functionality. No AI use please
You are using a web browser to load a webpage. Let's assume the size of the webpage is negligible. The
access link rate of the webserver is 1 Gigabits per second. The IP address for the associated URL is not
cached in your local host, so a DNS lookup is necessary to obtain the IP address. Suppose that n DNS
servers are visited before your host receives the IP address from DNS; the successive visits incur an RTT
of RTT1,..., RTTn. Let RTTo denote the RTT between the local host and the webserver containing the
webpage. Now answer the following:
1) Ignore all types of delays at the client and the servers. How much time elapses from when the
client clicks on the link of the webpage until the client receives the content of the webpage?
2) Now suppose, the HTML file references 10 additional objects (15 MB each) on the same server.
Considering only the transmission delay at the webserver for each of these objects and ignoring
all other delays at the host and the servers, recalculate the total…
Please code the following in R.
1a) Load the data set “ufc” (the file is ufc.csv). This data shows diameter at breast height (Dbh) and Height for forest trees. Can you use unstack() to get the diameter data for white pine (WP)? Start by unstacking all the diameter data. Can you also get this data by logical extraction? (Hint: use the function which(). If you really only wanted the data for one species logical extraction would probably be better.) 1b) For the data set ufc find the mean Dbh and Height for each species. (Hint: aggregate is your friend for more than one response variable.) 1c) Make a barplot showing these mean values for each species. Use beside =TRUE (stacking two different variables wouldn’t make sense...). (Hint: this will be easier if you make a new variable for the means from Q2. Look at ?barplot for the data type “height” must have- as.matrix() can be used to make something a matrix.) 1d) The barplot in Q3 suggests a fair correlation between Dbh and height. Plot…
Chapter 18 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version, Student Value Edition (11th Edition)
Ch. 18.2 - What is a recursive method? What is an infinite...Ch. 18.2 - Prob. 18.2.2CPCh. 18.2 - Show the output of the following programs and...Ch. 18.2 - Prob. 18.2.4CPCh. 18.2 - Prob. 18.2.5CPCh. 18.2 - Write a recursive mathematical definition for...Ch. 18.3 - Prob. 18.3.1CPCh. 18.3 - What is wrong in the following methods?Ch. 18.3 - Prob. 18.3.3CPCh. 18.4 - Describe the characteristics of recursive methods.
Ch. 18.4 - Prob. 18.4.2CPCh. 18.4 - Prob. 18.4.3CPCh. 18.5 - Prob. 18.5.1CPCh. 18.5 - Prob. 18.5.2CPCh. 18.5 - What is a recursive helper method?Ch. 18.6 - Prob. 18.6.1CPCh. 18.6 - How does the program get all files and directories...Ch. 18.6 - How many times will the getSize method be invoked...Ch. 18.6 - Will the program work if the directory is empty...Ch. 18.6 - Will the program work if line 20 is replaced by...Ch. 18.6 - Will the program work if lines 20 and 21 are...Ch. 18.7 - Prob. 18.7.1CPCh. 18.8 - Prob. 18.8.1CPCh. 18.8 - Prob. 18.8.2CPCh. 18.8 - How many times is the displayTriangles method...Ch. 18.8 - Prob. 18.8.4CPCh. 18.8 - Prob. 18.8.5CPCh. 18.9 - Which of the following statements are true? a. Any...Ch. 18.9 - Prob. 18.9.2CPCh. 18.10 - Identify tail-recursive methods in this chapter.Ch. 18.10 - Rewrite the fib method in Listing 18.2 using tail...Ch. 18 - Prob. 18.1PECh. 18 - Prob. 18.2PECh. 18 - (Compute greatest common divisor using recursion)...Ch. 18 - (Sum series) Write a recursive method to compute...Ch. 18 - (Sum series) Write a recursive method to compute...Ch. 18 - (Sum series) Write a recursive method to compute...Ch. 18 - (Fibonacci series) Modify Listing 18.2,...Ch. 18 - Prob. 18.8PECh. 18 - (Print the characters in a string reversely) Write...Ch. 18 - (Occurrences of a specified character in a string)...Ch. 18 - Prob. 18.11PECh. 18 - (Print the characters in a string reversely)...Ch. 18 - (Find the largest number in an array) Write a...Ch. 18 - (Find the number of uppercase letters in a string)...Ch. 18 - Prob. 18.15PECh. 18 - (Find the number of uppercase letters in an array)...Ch. 18 - (Occurrences of a specified character in an array)...Ch. 18 - (Tower of Hanoi) Modify Listing 18.8,...Ch. 18 - Prob. 18.19PECh. 18 - (Display circles) Write a Java program that...Ch. 18 - (Decimal to binary) Write a recursive method that...Ch. 18 - (Decimal to hex) Write a recursive method that...Ch. 18 - (Binary to decimal) Write a recursive method that...Ch. 18 - (Hex to decimal) Write a recursive method that...Ch. 18 - Prob. 18.25PECh. 18 - (Create a maze) Write a program that will find a...Ch. 18 - (Koch snowflake fractal) The text presented the...Ch. 18 - (Nonrecursive directory size) Rewrite Listing...Ch. 18 - (Number of files in a directory) Write a program...Ch. 18 - (Game: Knights Tour) The Knights Tour is an...Ch. 18 - (Game: Knights Tour animation) Write a program for...Ch. 18 - (Game: Eight Queens) The Eight Queens problem is...Ch. 18 - Prob. 18.35PECh. 18 - (Sierpinski triangle) Write a program that lets...Ch. 18 - (Hilbert curve) The Hilbert curve, first described...Ch. 18 - (Recursive tree) Write a program to display a...Ch. 18 - Prob. 18.39PE
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Suppose v is an object of the class vectorint. Use the search generic function (Display 18.18) to write some co...
Problem Solving with C++ (10th Edition)
Bug Collector The Bug Collector Problem A bug collector collects bugs every day for five days. Write a program ...
Starting Out with Python (4th Edition)
Write a complete Java program that behaves as follows. The program displays an input dialog window asking the u...
Java: An Introduction to Problem Solving and Programming (8th Edition)
Determine the components of the force acting parallel and perpendicular to the axis of the pole. Prob. F2-30
INTERNATIONAL EDITION---Engineering Mechanics: Statics, 14th edition (SI unit)
59. A 100-watt [W] motor (60% efficient) is used to raise a 100-kilogram [kg] toad 5 meters [m] into the air. H...
Thinking Like an Engineer: An Active Learning Approach (4th 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
- ExoProtect, which is an insurance company, plans to develop the operational database. Write out all requirements for the ER diagram for the ExoProtect Employees’ Computers Database shown below:arrow_forwardSignum Libri (SL) is a publishing company. The SL Operations Database will keep track of the following: For each book SL publishes: a book name, genre, date of publication, and number of pages; For each writer: a unique writer identifier as well as the writer’s name; For each agent: a unique agent identifier as well as the agent’s name; For each editor: a unique editor identifier as well as the editor’s name; Each SL book is written by one writer, and each writer can write many SL books. SL will not keep track of writers who did not write a book for SL. All books written by the same writer have a different book name. However, two writers can write two different books with the same book name. Each writer is represented by one agent. Each agent represents at least one writer, but can represent many. Each book has one editor. Each editor edits at least one book, but can edit many books. Each editor can mentor one or more other editors, but does not have to mentor any. Each editor can…arrow_forward1. Consider the NFA defined by the state diagram below. Follow the algorithm seen in class and in our textbook to construct an equivalent DFA. Please only include the states reachable (in one or more transitions) from the start state. (Your solution can be either the table or the state diagram, or both if you wish.) a ε, b b a a 92 91 8 93 b a, barrow_forward
- - a) Answer these Theoretical Questions: 1. Explain the rule of thumb for the Big O. Provide at least one example of applying each rule. 2. What is the Big O of each of the following functions? a) (n + 1)³/n b) (n³ + logзn) ³/n c) n + 100n³ + n d) 3n+ 100n3 + 3n * e) n 3n+ n * 33n 3. Describe an algorithm for finding the occurrence of the max element in an array. Analyze the complexity of the algorithm. 4. What is Divide-and-Conquer? What is the difference between Divide-and-Conquer and Dynamic Programming? What are the benefits of using one over another if any? 5. Is it possible to design an algorithm for finding the max element in a list using Divide-and-Conquer? What is the complexity of this algorithm? Hint: In this approach, the initial array is divided into two halves... b) Programming assignment: Implement initiative / naïve method to find a max element in an array. Implement the method that uses the Divide-and-Conquer approach to find the max element in an array. Test both…arrow_forward9. Given the following Boolean Function: F(P, Q, R) = PQ+QR+PR F(P,Q,R) (i) Derive the canonical SOP (sum of minterms) for F. (ii) Derive the canonical POS (product of maxterms) for F. (iii) Draw the truth table, clearly marking which rows are minterms of F and which rows correspond to maxterms of F. 10) For n Boolean variables, how many distinct Boolean functions exist? Give the answer as a function of n and briefly justify it.arrow_forwardPlease Show an Example in R: Find (or invent) some data (not from the “Data” directory supplied with EssentialR) and import it into R. (It is not a bad idea to include a commented line with units for each variable in your .txt or.csv file). a) What did you have to do to “clean it up” so it would read in? b) Are you satisfied with the console output of summary(yourdata)? Did all the variables import in the way (format) you thought they should? c) Include the output of summary(yourdata) and head(yourdata).arrow_forward
- 7. Convert Standard POS form to Canonical POS form. (A+B)(A+ C)(B+C) 8. Given that F(a, b, c, d) = Σm(1, 3, 4, 6, 8, 9, 12), (i) Write the product of maxterms (canonical POS) for F. (ii) Write the canonical SOP and canonical POS for F.arrow_forward1. Evaluate the following expression when A = 1, B = O, C = 1, D = 0 F = AB + CD + (A + B)C 2. Find F, the complement of function F, Write your answer using overbars. F(W, X, Y, Z) = WX + YZ +XZ 3. Determine the truth table for the function F = XY+XZ 4. Show with a truth table that the following is true: X(YZ) = XY+XZarrow_forward. 6. Find the dual of the Boolean expressions. (swap + with and O with 1; do not complement variables). a) A + BC b) (X + Y)(X + Z) c) P+Q+ RSarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrC++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningProgramming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
- Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTSystems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning

C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr

C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage

Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,

EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT

Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
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