Program Explanation Program: //import statement import java.util.Scanner; import java.io.*; //definition of class "Main" public class Main { // main method public static void main(String[] args) { //declare the scanner object Scanner in = new Scanner(System.in); //get the input from the user System.out.print("Enter a file name: "); String filename = in.nextLine(); /*declare and call the method "getCharacterFrequency"*/ int[] counts = getCharacterFrequency(filename); //display the statement System.out.printf("%-15s%-15s%-15s%-15s\n", "ASCII Code", "Character", "Frequency", "Code"); //create an object for the "Tree" class Tree tree = getHuffmanTree(counts); //declare and call the method "getCode" String[] codes = getCode(tree.root); //check the condition for (int i = 0; i < codes.length; i++) //check the condition if (counts[i] != 0) //display the result System.out.printf("%-15d%-15s%-15d%-15s\n", i, (char)i + "", counts[i], codes[i]); } //definition of "getCode" method public static String[] getCode(Tree.Node root) { //check the condition if (root == null) //return statement return null; /*declare and allocate memory for the "codes" variable */ String[] codes = new String[2 * 128]; //call the method "assignCode" assignCode(root, codes); //return statement return codes; } //definition of "assignCode" method private static void assignCode(Tree.Node root, String[] codes) { //check the condition if (root.left != null) { //calculate the left root value root.left.code = root.code + "0"; //call the "assignCode" method assignCode(root.left, codes); //calculate the right root value root.right.code = root.code + "1"; //call the "assignCode" method assignCode(root.right, codes); } //otherwise else { //calculate the root value codes[(int)root.element] = root.code; } } //definition of "Heap" class public static class Heap<E extends Comparable> { //create an object private java.util.ArrayList<E> list = new java.util.ArrayList<E>(); //create a default constructor public Heap() { } //create a heap from an array of objects public Heap(E[] objects) { //check the condition for (int i = 0; i < objects.length; i++) //add the values add(objects[i]); } //definition of "add" method public void add(E newObject) { //add the values into the list list.add(newObject); //index of the last node int currentIndex = list.size() - 1; //check the condition while (currentIndex > 0) { int parentIndex = (currentIndex - 1) / 2; //check the condition if (list.get(currentIndex).compareTo( list.get(parentIndex)) > 0) { /* swap if the current object is greater than its parent*/ E temp = list.get(currentIndex); list.set(currentIndex, list.get(parentIndex)); list.set(parentIndex, temp); } else //break statement break; currentIndex = parentIndex; } } // definition of "remove" method public E remove() { //check the condition if (list.size() == 0) //return statement return null; //remove the root from the heap E removedObject = list.get(0); list.set(0, list.get(list.size() - 1)); list.remove(list.size() - 1); //declare and set value int currentIndex = 0; //check the condition while (currentIndex < list.size()) { //declare and set value int leftChildIndex = 2 * currentIndex + 1; int rightChildIndex = 2 * currentIndex + 2; //check the condition if (leftChildIndex >= list...

Introduction to Java Programming and Data Structures, Comprehensive Version Plus MyProgrammingLab with Pearson EText -- Access Card Package

11th Edition

ISBN: 9780134694511

Author: Liang, Y. Daniel

Publisher: Pearson Education Canada

See similar textbooks

Videos

Question

Chapter 25, Problem 25.16PE

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 25, Problem 25.15PE

Chapter 25, Problem 25.17PE

Students have asked these similar questions

NO AI USE PLEASE

RSA decryption: You are given the following RSA values: n = 9797, e = 7, d = 4111. Some ciphertext was received: c = 7321. Based on that information, compute the plaintext message m. Show all your work along the way. No Use of AI please

(25 points) What are the use cases in which public key encryption would be useless? In light of what we discussed in class. would the internet be where it is today without the COIS-4370H-A-F01-2025FA-OSH Computer & Info Security Ords. City any sources you use. Remember to frame your answer in light of what was discussed in class.

Chapter 25 Solutions

Introduction to Java Programming and Data Structures, Comprehensive Version Plus MyProgrammingLab with Pearson EText -- Access Card Package

Chapter 25.2, Problem 25.2.1CP Chapter 25.2, Problem 25.2.2CP Chapter 25.2, Problem 25.2.3CP Chapter 25.2, Problem 25.2.4CP Chapter 25.2, Problem 25.2.5CP Chapter 25.3, Problem 25.3.1CP Chapter 25.3, Problem 25.3.2CP Chapter 25.3, Problem 25.3.3CP Chapter 25.3, Problem 25.3.4CP Chapter 25.4, Problem 25.4.1CP

Additional Engineering Textbook Solutions

Find more solutions based on key concepts

ML name and C variable declaration: “let” construct is an expression which binds name to value. Purpose of let ...

Concepts Of Programming Languages

The statement “<? extends Number>” accepts only the objects that are passed as an argument of type Number and s...

Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)

The statement which causes the function to execute is referred as function call. The module is called by its mo...

Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)

if (num2 == 0) System.out.println("Division by zero is not possible."); System.out.println("Please run the prog...

Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)

The reason for difficulty in joining of crystalline ceramics.

Degarmo's Materials And Processes In Manufacturing

To write the lines of code that carry out the task of popping up a message dialog box with â€œTaking Risks Prov...

Introduction To Programming Using Visual Basic (11th 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.