Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 20, Problem 20.20PE
Program Plan Intro
Directory size using Stack
Program plan:
- Import the required packages into the program.
- In the Exercise20_20 class,
- In the main() method,
- Read the directory or a file from user.
- Create an object for Scanner to read inputs.
- Call getSize() method to get the size of file or directory and then display the result.
- In the getSize() method.
- Declare and initialize the variable.
- Create an object for Stack.
- Add the file into stack.
- The while loop executes until the stack size. If yes,
- Remove the file from the stack.
- Check whether the directory or file is present. If yes,
- Assign the removed file into “files”.
- The for loop executes until the files. If yes,
- Add the files into stack.
- Otherwise, calculate the size of files or directory.
- Return the files or directory size.
- In the main() method,
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
(True/False): Local variables are created by adding a positive value to the stack pointer
(True/False): Arrays are passed by reference to avoid copying them onto the stack
(Printing a Sentence in Reverse Order with a Stack) Write a program that inputs a line of text and uses a stack object to print the line reversed.
Chapter 20 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 20.2 - Prob. 20.2.1CPCh. 20.2 - Prob. 20.2.2CPCh. 20.2 - Prob. 20.2.3CPCh. 20.2 - Prob. 20.2.4CPCh. 20.2 - Prob. 20.2.5CPCh. 20.3 - Prob. 20.3.1CPCh. 20.3 - Prob. 20.3.2CPCh. 20.3 - Prob. 20.3.3CPCh. 20.3 - Prob. 20.3.4CPCh. 20.4 - Prob. 20.4.1CP
Ch. 20.4 - Prob. 20.4.2CPCh. 20.5 - Prob. 20.5.1CPCh. 20.5 - Suppose list1 is a list that contains the strings...Ch. 20.5 - Prob. 20.5.3CPCh. 20.5 - Prob. 20.5.4CPCh. 20.5 - Prob. 20.5.5CPCh. 20.6 - Prob. 20.6.1CPCh. 20.6 - Prob. 20.6.2CPCh. 20.6 - Write a lambda expression to create a comparator...Ch. 20.6 - Prob. 20.6.4CPCh. 20.6 - Write a statement that sorts an array of Point2D...Ch. 20.6 - Write a statement that sorts an ArrayList of...Ch. 20.6 - Write a statement that sorts a two-dimensional...Ch. 20.6 - Write a statement that sorts a two-dimensional...Ch. 20.7 - Are all the methods in the Collections class...Ch. 20.7 - Prob. 20.7.2CPCh. 20.7 - Show the output of the following code: import...Ch. 20.7 - Prob. 20.7.4CPCh. 20.7 - Prob. 20.7.5CPCh. 20.7 - Prob. 20.7.6CPCh. 20.8 - Prob. 20.8.1CPCh. 20.8 - Prob. 20.8.2CPCh. 20.8 - Prob. 20.8.3CPCh. 20.9 - How do you create an instance of Vector? How do...Ch. 20.9 - How do you create an instance of Stack? How do you...Ch. 20.9 - Prob. 20.9.3CPCh. 20.10 - Prob. 20.10.1CPCh. 20.10 - Prob. 20.10.2CPCh. 20.10 - Prob. 20.10.3CPCh. 20.11 - Can the EvaluateExpression program evaluate the...Ch. 20.11 - Prob. 20.11.2CPCh. 20.11 - If you enter an expression "4 + 5 5 5", the...Ch. 20 - (Display words in ascending alphabetical order)...Ch. 20 - (Store numbers in a linked list) Write a program...Ch. 20 - (Guessing the capitals) Rewrite Programming...Ch. 20 - (Sort points in a plane) Write a program that...Ch. 20 - (Combine colliding bouncing balls) The example in...Ch. 20 - (Game: lottery) Revise Programming Exercise 3.15...Ch. 20 - Prob. 20.9PECh. 20 - Prob. 20.10PECh. 20 - (Match grouping symbols) A Java program contains...Ch. 20 - Prob. 20.12PECh. 20 - Prob. 20.14PECh. 20 - Prob. 20.16PECh. 20 - (Directory size) Listing 18.10,...Ch. 20 - Prob. 20.20PECh. 20 - (Nonrecursive Tower of Hanoi) Implement the...Ch. 20 - Evaluate expression Modify Listing 20.12,...
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
- (python) 5. Write the python code to create a list inside of another list. The list should contain data like this: 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5arrow_forward(Postfix notation) Postfix notation is a way of writing expressions without using parentheses. For example, the expression (1 + 2) 3 would be writ- ten as 1 2 + 3 *. A postfix expression is evaluated using a stack. Scan a postfix expression from left to right. A variable or constant is pushed to the stack. When an operator is encountered, apply the operator with the top two operands in the stack and replace the two operands with the result. The follow- ing diagram shows how to evaluate 1 2 + 3 *. 1. 3 3 9. 12 + 3 * 12 + 3* 12+3* 12 + 3* 12 +3* scanned scanned scanned scanned scanned Write a program that prompts the user to enter a postfix expression and evalu- ates it.arrow_forward(True/False): In 32-bit mode, the last argument to be pushed on the stack in a subroutine callis stored at location EBP + 8.arrow_forward
- (Summing and Averaging Elements in a List) Write a program that inserts 25 random integers from 0 to 100 in order in a linked list object. The program should calculate the sum of the elements and the floating-point average of the elements.arrow_forward(JAVA)Almost a priority queue. Design a data structure that supports the followingoperations for almost a priority queue:(i) FindSecondSmallest() which returns the second smallest item in the data structure.(ii) Insert(x) which inserts item x to the data structure.(iii) DeleteSecondSmallest() which removes the second smallest item from the datastructure.Your data structure should implement the operation FindSecondSmallest() in O(1), andthe other two operations in O(log n), where n is the number of elements in the datastructure.Problem 4: Binomial heaps. Let H1 and H2 be two binomial heaps. We would like tomerge H1 and H2 to obtain the binomial heap H and also to find the minimum key in H.A standard approach would be to perform the following sequence of operationsH = Merge(H1, H2);m = Min(H).Alternatively, we may perform the following sequence of operationsm1 = Min(H1);m2 = Min(H2);m = min{m1, m2};H = Merge(H1, H2).arrow_forward(Version #1) We start with an empty stack and then execute the following commands: push 8 push 4 pop push 2 push 6 pop push 9 pop pop push 6 push 3 dod push 7 push 2 dod push 3 Draw the resulting stack.arrow_forward
- (Use C++ to solve this.) 1. Create a stack using arrays having 6 integers and enter the values in that stack and display them on screen. 2. Create a stack having 5 integers display the values and then remove the last entered value. Again, display the remaining values. 3. Make a stack containing 5 values and access the 3 value and display it. 4. Change value at the 4th position of a stack having 7 integers.arrow_forward(True/False): The stack frame of a subroutine always includes the caller's return address as well as the subroutine's local variables.arrow_forwardapartmentList is a pointer to the first node in a linked list of nodes. Use this for Parts a, b, and c. Part a. Create an inner class that will hold the following information: the apartment number of the apartment (an int), the number of bedrooms in the apartment (also an int), the current rent of the apartment (a double). Don't forget to include a field for the link! Just create the class itself and the instance variables; you don't need to put any methods into the class.arrow_forward
- (Sedgewick, Exercise 4.6). A letter means push and an asterisk means pop in the following sequence. Give the sequence of values returned by the pop operations when this sequence of operations is performed on an initially empty LIFO stack. E AS* Y * QUE*** ST *** IO * N ***arrow_forwardC++ Please solve this problem WITHOUT using LINKED LIST. Thank you 1. Write a program to create a stack data structure (do not use the built-in stack class) using arrays. It should support Push, Pop and Peek operations. To-do: A. Create a stack using arrays with an array size of 10. B. Push integers 20, 40, 60 into the stack. C. Print the items in stack. D. Pop the item from the stack and print the popped item. E. Peek the stack and print the top-most element of the stack (do not remove it) F. Print the stack. Expected Output: Items in the stack: 60, 40, 20 Popped item is: 60 Peeked item is: 40 Items in the stack: 40, 20arrow_forward# i need solution faster please in c++ or java # assume the processor has many processes that are needed to be processed in the same time , each process needs a time to finished , so the processor puts them in the ordered queue such that the process with minimum time comes first in front of the queue .i.e the processor should serve the fewest time firstly.1. write a function to insert a process , in its proper place.(sort queue). 2. write a function to find the total working time of the processor.Hint : dont use any extra data structure only use queue.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education