Question

(Directory size) Listing 20.7, DirectorySize.java, gives a recursive method for finding a directory size. Rewrite this method without using recursion. Your program should use a queue to store the subdirectories under a directory. The algorithm can be described as follows: long getSize(File directory) \{ long size $=0$; add directory to the queue; while (queue is not empty) \{ Remove an item from the queue into $t$; if ( $t$ is a file) size $+=\mathrm{t}$. length $)$; else add all the files and subdirectories under $t$ into the \} queue; return size; \}

   (Directory size) Listing 20.7, DirectorySize.java, gives a recursive method for finding a directory size. Rewrite this method without using recursion. Your program should use a queue to store the subdirectories under a directory. The algorithm can be described as follows:
long getSize(File directory) \{
long size $=0$;
add directory to the queue;
while (queue is not empty) \{
Remove an item from the queue into $t$;
if ( $t$ is a file)
size $+=\mathrm{t}$. length $)$;
else
add all the files and subdirectories under $t$ into the
\}
queue;
return size;
\}
Show more…
Introduction to Java Programming. Comprehensive Version
Introduction to Java Programming. Comprehensive Version
Y. Daniel Liang 10th Edition
Chapter 20, Problem 18 ↓

Instant Answer

verified

Step 1

Step 1: Create a method called getSize that takes a File object as a parameter and returns a long value representing the size of the directory.  Show more…

Show all steps

lock
AceChat toggle button
Close icon
Ace pointing down

Please give Ace some feedback

Your feedback will help us improve your experience

Thumb up icon Thumb down icon
Thanks for your feedback!
Profile picture
(Directory size) Listing 20.7, DirectorySize.java, gives a recursive method for finding a directory size. Rewrite this method without using recursion. Your program should use a queue to store the subdirectories under a directory. The algorithm can be described as follows: long getSize(File directory) \{ long size $=0$; add directory to the queue; while (queue is not empty) \{ Remove an item from the queue into $t$; if ( $t$ is a file) size $+=\mathrm{t}$. length $)$; else add all the files and subdirectories under $t$ into the \} queue; return size; \}
Close icon
Play audio
Feedback
Powered by NumerAI
Need help? Use Ace
Ace is your personal tutor. It breaks down any question with clear steps so you can learn.
Start Using Ace
Ace is your personal tutor for learning
Step-by-step explanations
Instant summaries
Summarize YouTube videos
Understand textbook images or PDFs
Study tools like quizzes and flashcards
Listen to your notes as a podcast
Continue solving this problem
Create a free account to:
  • View full step-by-step solution
  • Ask follow-up questions with Ace AI
  • Save progress and study later
Continue Free
Numerade

Get step-by-step video solution
from top educators

Continue with Clever
or



By creating an account, you agree to the Terms of Service and Privacy Policy
Already have an account? Log In

A free answer
just for you

Watch the video solution with this free unlock.

Numerade

Log in to watch this video
...and 100,000,000 more!


EMAIL

PASSWORD

OR
Continue with Clever