Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

The text files boynames.txt and girlnames.txt , which are included in the source code for this topic text, contain a list of the 1,000 most

The text files boynames.txt and girlnames.txt , which are included in the

source code for this topic text, contain a list of the 1,000 most popular boy and

girl names in the United States for the year 2003 as compiled by the Social Security

Administration.

These are blank-delimited files, where the most popular name is listed first, the

second most popular name is listed second, and so on, to the 1,000 th most popular

name, which is listed last. Each line consists of the first name followed by a blank

space and then the number of registered births using that name in the year. For

example, the girlnames.txt file begins with

Emily 25494

Emma 22532

Madison 19986

This indicates that Emily was the most popular name with 25,494 registered

namings, Emma was the second most popular with 22,532, and Madison was the

third most popular with 19,986.

VideoNote

Solution to

Programming

Project 10.1

Write a program that reads both the girl and boy files into memory using arrays.

Then, allow the user to input a name. The program should search through both

arrays. If there is a match, then it should output the popularity ranking and the

number of namings. The program should also indicate if there is no match.

For example, if the user enters the name Justice, then the program should output

Justice is ranked 456 in popularity among girls with 655 namings.

Justice is ranked 401 in popularity among boys with 653 namings.

If the user enters the name Walter, then the program should output

Walter is not ranked among the top 1000 girl names.

Walter is ranked 356 in popularity among boys with 775 namings.

This is my code so far but it keeps having errors cann someone help and get the correct output please and thank you

package chap10_prob1;

import java.io.IOException; import java.util.Arrays; import java.util.Scanner;

/** * * @author coleen */ public class Chap10_Prob1 {

/** * @param args the command line arguments */ private String[] nameBoys = new String[1000], nameGirls = new String[1000]; private int[] numBoys = new int[1000], numGirls = new int[1000];

public void readData(String fName) {

String[] names = new String[1000]; int[] total = new int[1000]; String line = null; int countNum = 0; BufferedReader br = new BufferedReader(new FileReader(fName)); while ((line = br.readLine()) != null) { String[] data = line.split(" "); names[countNum] = data[0]; total[countNum] = Integer.parseInt(data[1]); countNum++; } if (fName == "boynames.txt") { this.nameBoys = names; this.numBoys = total; } else { this.nameGirls = names; this.numGirls = total; } br.close(); } public void getNameData() { Scanner scn = new Scanner(System.in); System.out.print("Enter a boy or girl name:"); String name = scn.next(); if (Arrays.asList(this.nameBoys).contains(name)) { int index = Arrays.asList(this.nameBoys).indexOf(name); int occurences = numBoys[index]; System.out.println(name + " is ranked " + (index + 1) + " in popularity " + "among boys with " + occurences + " namings."); } else System.out.println(name + " is not ranked among the top 1000 girl names.");

if (Arrays.asList(this.nameGirls).contains(name)) { int index = Arrays.asList(this.nameGirls).indexOf(name); int occurences = numGirls[index]; System.out.println(name + " is ranked " + (index + 1) + " in popularity " + "among girls with " + occurences + " namings."); } else System.out.println(name + " is not ranked among the top 1000 girl names.");

}

public static void main(String[] args) { System.out.println("ITMP 2650 Java Programming summer 2017"); System.out.println("author: Coleen Feador"); System.out.println("Assignment: Chapter 10 question 1"); Chap10_Prob1 nd= new Chap10_Prob1(); nd.readData("boynames.txt"); nd.readData("girlnames.txt"); nd.getNameData();

}

private static class FileReader {

public FileReader(String fName) { } }

private static class BufferedReader {

public BufferedReader() { }

private BufferedReader(FileReader fileReader) { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. }

private String readLine() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. }

private void close() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } }

private static class FileNotFoundException {

public FileNotFoundException() { }

private void printStackTrace() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } }

}

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Refactoring Databases Evolutionary Database Design

Authors: Scott Ambler, Pramod Sadalage

1st Edition

0321774515, 978-0321774514

More Books

Students also viewed these Databases questions