Data Structures and Algorithms in Java
6th Edition
ISBN: 9781118771334
Author: Michael T. Goodrich
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 5, Problem 27P
Program Plan Intro
Recursive method with calling signature
Program plan:
- Create a class FindFile.
- In find() method,
- Check whether the list is not “null”. If yes,
- The for loop executes until the list. If yes,
- Check whether the directory is there in the list. If yes,
- Call recursively find() method to find path from the file name in the list.
- Otherwise, check whether the given file name is equal to the filename in the list. If yes,
- Fetch the parents file of the given file name and then display it.
- Check whether the directory is there in the list. If yes,
- The for loop executes until the list. If yes,
- In main() method,
- Create an object for FindFile class.
- Read the input file name and directory name from the user.
- Call the find() method to find the path of the file name and then display it.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Implement a recursive procedure in UCBLogo, which will draw a set of circles arranged in a circle. It must be possible to specify the number of circles that have to be drawn in a simple
fashion (i.e. with minor modification to the program source code).
The task is to implement part of a linter program using python. Specifically, you must be
able to scan for grouping symbols ( "()", "[]", "{}” ) and ensure that there are no hanging
open symbols or stray closing symbols in the source file.
The implementation must involve recursion in terms of scanning for the scope. If a
different closing symbol is encountered or the end of file is reached, the error message
"Line : missing closing symbol for "" should be
displayed. For stray closing tags, the message "Line : stray closing
symbol for "".
Note: Do not use "stack" in your code.
write a recursive method to schedule compatible activities that result in the maximum usage of the room.
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...
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
- Implement the logarithmBase22 method which, given a long integer number, returns the result of Logz2(number), rounded down to the nearest floor integer. Design and implement this as a recursive method. Read the test cases in the JUnit tester file for more detailed specification.arrow_forwardImplement a recursive function void deleteMax() on the IntList class (provided). The function will delete from the IntList the IntNode containing the largest value. If there are multiple nodes containing this largest value, only delete the 1st one. Be careful not to cause any memory leaks or dangling pointers. You may NOT use any kind of loop (must use recursion). You may NOT use global or static variables. You may NOT use any standard library functions. Ex: list: 5->7->1->16->4->16->3 list.deleteMax(); list: 5->7->1->4->16->3 IntList.h #ifndef __INTLIST_H__#define __INTLIST_H__ #include <ostream> using namespace std; struct IntNode {int value;IntNode *next;IntNode(int value) : value(value), next(nullptr) {}}; class IntList { private:IntNode *head; public: /* Initializes an empty list.*/IntList() : head(nullptr) {} /* Inserts a data value to the front of the list.*/void push_front(int val) {if (!head) {head = new IntNode(val);} else {IntNode…arrow_forwardPlease convert Mutual Recursion to Java. See attached image. Thank you.arrow_forward
- Write a program to flatten a nested list using recursion. Try to do it as soon as possiblearrow_forwardWRITE IT IN JAVA Write a recursive method that can detect if a set of numbers can be divided into two groups such that the summation of the numbers at both groups is a power of 2.arrow_forwardWrite a java method to search for an element in an array using a linear search. Many list processing tasks, including searching, can be done recursively. The base case typically involves doing something with a limited number of elements in the list (say the first element), then the recursive step involves doing the task on the rest of the list. Think about how linear search can be viewed recursively; if you are looking for an item in a list starting at index i:o ¬If i exceeds the last index in the list, the item is not found (return -1).o ¬If the item is at list[i], return i.o ¬If the is not at list[i], do a linear search starting at index i+1arrow_forward
- Implement an postfix-to-infix translator using stacks. The applicationshould repeatedly read a postfix expression and print the equivalentinfix expression until the user quits. Throw an exception if the postfixexpression entered is invalid.arrow_forwardCreate an iterative technique for reverse-engineering a string. Explain why you would not typically handle this issue using recursion.arrow_forwardusing python In a jupyter notebook, implement a recursive function anagrams() that computes anagrams of a given word. An anagram of word A is word B that can be formed by re-arranging the letters of A. For example, the word pot is the anagram of the word top. Your function will take as an input the name of a file of words and as well a word, and print all the words in the file that are anagrams of the input word. Used the attached file words.txt as your file of words. words.txt Points for handling base case, a step that brings you closer to solving the problem, and correctly reading from the file. >>> anagrams("words.txt, trace) crate cater reactarrow_forward
- Write a Perl program that uses a hash and a large number of operationson the hash. For example, the hash could store people’s names and theirages. A random-number generator could be used to create threecharacter names and ages, which could be added to the hash. When aduplicate name was generated, it would cause an access to the hash butnot add a new element. Rewrite the same program without using hashes.Compare the execution efficiency of the two. Compare the ease ofprogramming and readability of the two.arrow_forwardWritten in Dr Racket: Write a recursive function that takes a list of numbers as input and returns a list of the numbers in ascending order.Use the quicksort algorithmUse ( 20 13 74 5 12 9 22 95 22 6 101 72 3 53 33 21 96) as input. To do that, calculate the average value of a sublist before dividing it.(quicksort ‘( 20 13 74 5 12 9 22 95 22 6 101 72 3 53 33 21 96))returns ‘(3 5 6 9 12 13 20 21 22 22 33 53 72 74 95 96 101) Do not use sort, quicksort, set!, or mean.arrow_forwardImplement a city database using ordered lists. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x and y coordinates. Your database should allow records to be inserted, deleted by name, and searched by name. Another operation that should be supported is to print all records within a given distance of a specified point/coordinate. The order of cities should be alphabetically by city name. Implement the database using: an array- based list implementation. By using JAVA.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning