Question

Design class House to describe a house object by using houseID, town, and zip code of String type   and price as integer. Write a program that reads a sequence of houseIDs, towns, zip codes and prices for up to 100 houses from an input file. Store the data in an array that has capacity to hold 100 house objects. Keep track of number of houses in variable count.   Assume that each line of input has houseID, town, zip,and price data in this order and separated by one space.

Design class HouseList with following static methods. All methods have two input parameters: an array named list of House type, and n its actual size (number of occupied positions in the array).

• static void printList(House[] list, int n)                            // prints all n houses in the list
• static House mostExpensive(House[] list, int n)             // returns the most expensive house
• static int countZIP((House[] list, int n, String zip)          // returns the number of houses in given zip
• static void printListReversed(House[] list, int n)            // prints houses from n-th down to the

                                                                                                // first house in the list.

• static String zipOfCheapest(House[] list, int n)              // EXTRA CREDIT returns the zip code of the

// cheapest house in the list. If more than one

                                                                                              // house has the same cheapest price return

                                                                                                // zip code on any one of them.

Class Tester will have main method. In it read data from input file "inData.txt" into array houseList, and update variable count as you read houses from input file. Invoke each of the five methods. You should create an input file, and put data for 7 houses in it.

First three Houses in the input file should be:

H101 NewBritain 06050 165000

H103 Berlin 06037 279900

H105 Newington 06111 325000

and remaining four should be of your choice. Use only towns with one word names, or if town name has two words omit space between them. Input file should be in the same folder where all files from BlueJ for this program are located. Do not forget to append throws IOException to the main method header, and to use following import clauses in the Tester class :                        

import java.io.*;     

import java.util.*;

Answer 1

/**
 * House.java
 */
public class House {
    // private attributes
    private String houseId, town, zip;
    private int price;

    // constructor for initializing the value
    public House(String houseId, String town, String zip, int price) {
        this.houseId = houseId;
        this.town = town;
        this.zip = zip;
        this.price = price;
    }

    // getters and setters
    public String getHouseId() {
        return houseId;
    }

    public void setHouseId(String houseId) {
        this.houseId = houseId;
    }

    public String getTown() {
        return town;
    }

    public void setTown(String town) {
        this.town = town;
    }

    public String getZip() {
        return zip;
    }

    public void setZip(String zip) {
        this.zip = zip;
    }

    public int getPrice() {
        return price;
    }

    public void setPrice(int price) {
        this.price = price;
    }

    @Override
    public String toString() {
        return String.format("House ID: %s\nTown: %s\nZip: %s\nPrice: %d\n", houseId, town, zip, price);
    }
}

/**
 * HouseList.java
 */
public class HouseList {

    static void printList(House[] list, int n) {
        // looping through list and printing values
        for (int i = 0; i < n; i++) {
            System.out.println(list[i]);
        }
    }

    static House mostExpensive(House[] list, int n) {
        int expensiveAmount = Integer.MIN_VALUE;
        House expensiveHouse = null;
        // looping through house list and finding expensive house
        for (int i = 0; i < n; i++) {
            if (list[i].getPrice() > expensiveAmount) {
                expensiveAmount = list[i].getPrice();
                expensiveHouse = list[i];
            }
        }
        // returning the expensive house
        return expensiveHouse;
    }

    static int countZip(House[] list, int n, String zip) {
        int count = 0;
        // looping though house list and finding the count of given zip
        for (int i = 0; i < n; i++) {
            if (list[i].getZip().equalsIgnoreCase(zip))
                count++;
        }
        return count;
    }

    static void printListReversed(House[] list, int n) {
        // printing reversed house list
        for (int i = n - 1; i >= 0; i--) {
            System.out.println(list[i]);
        }

    }

    static String zipOfCheapest(House[] list, int n) {
        int lowestPrice = Integer.MAX_VALUE;
        String lowesPriceZip = null;
        for (int i = 0; i < n; i++) {
            if (lowestPrice > list[i].getPrice()) {
                lowestPrice = list[i].getPrice();
                lowesPriceZip = list[i].getZip();
            }
        }
        return lowesPriceZip;
    }
}

/**
 * Tester.java
 */

import java.io.*;
import java.util.Scanner;

public class Tester {
    public static void main(String[] args) throws IOException {
        final int MAX_HOUSE = 100;
        House list[] = new House[MAX_HOUSE];
        int actualCount = 0;
        String fileName = "inData.txt";
        Scanner fileReader = new Scanner(new File(fileName));
        while (fileReader.hasNextLine() && actualCount < MAX_HOUSE){
            String values[] = fileReader.nextLine().trim().split(" ");
            if(values.length>=4){
                list[actualCount++] = new House(values[0].trim(),
                                                values[1].trim(),
                                                values[2].trim(),
                                                Integer.valueOf(values[3].trim()));
            }

        }
        HouseList.printList(list, actualCount);
        System.out.println("--------------------------------------------------------");
        System.out.println("Most Expensive House\n"+HouseList.mostExpensive(list, actualCount));
        System.out.println("--------------------------------------------------------");
        System.out.println("Count of Zip 06111: "+HouseList.countZip(list, actualCount, "06111"));
        System.out.println("--------------------------------------------------------");
        System.out.println("\nReversed List\n");
        HouseList.printListReversed(list,actualCount);
        System.out.println("--------------------------------------------------------");
        System.out.println("Zip of cheapest house: "+HouseList.zipOfCheapest(list, actualCount));
        System.out.println("--------------------------------------------------------");
    }
}

//OUTPUT

House ID: H101
Town: NewBritain
Zip: 06050
Price: 165000

House ID: H103
Town: Berlin
Zip: 06037
Price: 279900

House ID: H105
Town: Newington
Zip: 06111
Price: 325000

--------------------------------------------------------
Most Expensive House
House ID: H105
Town: Newington
Zip: 06111
Price: 325000

--------------------------------------------------------
Count of Zip 06111: 1
--------------------------------------------------------

Reversed List

House ID: H105
Town: Newington
Zip: 06111
Price: 325000

House ID: H103
Town: Berlin
Zip: 06037
Price: 279900

House ID: H101
Town: NewBritain
Zip: 06050
Price: 165000

--------------------------------------------------------
Zip of cheapest house: 06050
--------------------------------------------------------

Process finished with exit code 0