Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
12:09 O & R all 86% Asgn5 Part 2 - recursion For this part, you have 2 small programs to write (independent of each other). In both cases, write only one class, with one recursive static method and one main method. The main method should have some example code showing how the recursive method is called, with hardcoded values. 1. Write a recursive method that calculates the total space used by all files under a given folder (or directory), including all files that are accessible from it when traversing down some subfolders. Here are some methods that could help you here, that are part of the class "File": isFile() : returns true if the file is a regular file (not a directory) isDirectory() : returns true if the file is a directory length() : returns a value of type "long" (not int), that is the number of bytes taken by the file. Note that it has to be called on a normal file only, not on a directory. listFiles() : called on a directory, it returns an array of File objects corresponding to the content of that directory (i.e., all its files and subfolders) Note: you can check the correctness of your answer by checking the properties of the directory (right-click on the directory, and select "properties"). 2. Write a recursive method that starts with one string (e.g., "ABC") and prints all combinations of letters from that string (one per line). For example here, we would get (note: your answer could be in a different order): АВС АВ АС A ВС В C

12:09 O & R all 86% Asgn5 Part 2 - recursion For this part, you have 2 small programs to write (independent of each other). In both cases, write only one class, with one recursive static method and one main method. The main method should have some example code showing how the recursive method is called, with hardcoded values. 1. Write a recursive method that calculates the total space used by all files under a given folder (or directory), including all files that are accessible from it when traversing down some subfolders. Here are some methods that could help you here, that are part of the class "File": isFile() : returns true if the file is a regular file (not a directory) isDirectory() : returns true if the file is a directory length() : returns a value of type "long" (not int), that is the number of bytes taken by the file. Note that it has to be called on a normal file only, not on a directory. listFiles() : called on a directory, it returns an array of File objects corresponding to the content of that directory (i.e., all its files and subfolders) Note: you can check the correctness of your answer by checking the properties of the directory (right-click on the directory, and select "properties"). 2. Write a recursive method that starts with one string (e.g., "ABC") and prints all combinations of letters from that string (one per line). For example here, we would get (note: your answer could be in a different order): АВС АВ АС A ВС В C

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
12:09 9 & K all 86%i Asgn5 Part 2- recursion For this part, you have 2 small programs to write (independent of each other). In both cases, write only one class, with one recursive static method and one main method. The main method should have some example code showing how the recursive method is called, with hardcoded values. 1. Write a recursive method that calculates the total space used by all files under a given folder (or directory), including all files that are accessible from it when traversing down some subfolders. Here are some methods that could help you here, that are part of the class "File": isFile() : returns true if the file is a regular file (not a directory) isDirectory() : returns true if the file is a directory length() : returns a value of type "long" (not int), that is the number of bytes taken by the file. Note that it has to be called on a normal file only, not on a directory. listFiles() : called on a directory, it returns an array of File objects corresponding to the content of that directory (i.e., all its files and subfolders) Note: you can check the correctness of your answer by checking the properties of the directory (right-click on the directory, and select "properties"). 2. Write a recursive method that starts with one string (e.g., “ABC") and prints all combinations of letters from that string (one per line). For example here, we would get (note: your answer could be in a different order): АВС АВ AC А ВС В 2
Transcribed Image Text:12:09 9 & K all 86%i Asgn5 Part 2- recursion For this part, you have 2 small programs to write (independent of each other). In both cases, write only one class, with one recursive static method and one main method. The main method should have some example code showing how the recursive method is called, with hardcoded values. 1. Write a recursive method that calculates the total space used by all files under a given folder (or directory), including all files that are accessible from it when traversing down some subfolders. Here are some methods that could help you here, that are part of the class "File": isFile() : returns true if the file is a regular file (not a directory) isDirectory() : returns true if the file is a directory length() : returns a value of type "long" (not int), that is the number of bytes taken by the file. Note that it has to be called on a normal file only, not on a directory. listFiles() : called on a directory, it returns an array of File objects corresponding to the content of that directory (i.e., all its files and subfolders) Note: you can check the correctness of your answer by checking the properties of the directory (right-click on the directory, and select "properties"). 2. Write a recursive method that starts with one string (e.g., “ABC") and prints all combinations of letters from that string (one per line). For example here, we would get (note: your answer could be in a different order): АВС АВ AC А ВС В 2
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS