Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Q2. Write a Java program that has two classes, as follows: Class: HWS 02_YourStudentid Demo You will do the following in the main method of this class: Open a given .txt file (you may hard code the filename) containing n names, and read and store these names into a String array, Ask user to enter a name to search in the array, - Create an object of SortAndsearch class (described below) and use the sort and search methods on this object. The search method retums true if the name exits in the list, else returns false, Print "The given name . exists" if the name is found, else "The given name . is not found", if the name doesn't exist in the list. Class: SortAndsearch, with the following properties: one instance field, i.e. Sring array constructor that sets the String array field with the input String array method 1 (for sorting) accepts the String array of as its argument, sorts it (using Selection sort algorithm), and retums the sorted aray, method 2 (for searching) accepts two arguments: the sorted array and a specific name to search in this array (using Binary search algorithm), and returns rue if the given name exists, otherwise returms faise. Sample output is as below. If the txt file contains the following names (show the working of your program with at least 10 names in the txt file): John Mary Ravi

Q2. Write a Java program that has two classes, as follows: Class: HWS 02_YourStudentid Demo You will do the following in the main method of this class: Open a given .txt file (you may hard code the filename) containing n names, and read and store these names into a String array, Ask user to enter a name to search in the array, - Create an object of SortAndsearch class (described below) and use the sort and search methods on this object. The search method retums true if the name exits in the list, else returns false, Print "The given name . exists" if the name is found, else "The given name . is not found", if the name doesn't exist in the list. Class: SortAndsearch, with the following properties: one instance field, i.e. Sring array constructor that sets the String array field with the input String array method 1 (for sorting) accepts the String array of as its argument, sorts it (using Selection sort algorithm), and retums the sorted aray, method 2 (for searching) accepts two arguments: the sorted array and a specific name to search in this array (using Binary search algorithm), and returns rue if the given name exists, otherwise returms faise. Sample output is as below. If the txt file contains the following names (show the working of your program with at least 10 names in the txt file): John Mary Ravi

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
100%
Q2. Write a Java program that has two classes, as follows: Class: HWS_02_YourStudentid_Demo You will do the following in the main method of this class: - Open a given .trt file (you may hard code the filename) containing n names, and read and store these names into a String array, - Ask user to enter a name to search in the array, - Create an object of SortAndSearch class (described below) and use the sort and search methods on this object. The search method retums true if the name exits in the list, else retums false, - Print "The given name .. exists" if the name is found, else "The given name . is not found", if the name doesn't exist in the list. Class: SortAndSearch, with the following properties: one instance field, i.e. Sring array constructor that sets the String array field with the input String array method 1 (for sorting) accepts the String array of as its argument, sorts it (using Selection sort algorithm), and retums the sorted array; method 2 (for searching) accepts two arguments: the sorted array and a specific name to search in this array (using Binary search algorithm), and returns trus if the given name exists, otherwise returms faise. Sample output is as below. If the txt file contains the following names (show the working of your program with at least 10 names in the txt file): John Mary Ravi Madeeha Pradeep Brandon Stephane Mark Abdul Ram And the user enters the following name to search: Enter the name to search: Mark The sorted array will be as follows: Abdul Brandon Jahn Madeeha Mark Mary Pradeep Ram Ravi Stephane After the search is performed, the program will print: The given name "Mark" exists
Transcribed Image Text:Q2. Write a Java program that has two classes, as follows: Class: HWS_02_YourStudentid_Demo You will do the following in the main method of this class: - Open a given .trt file (you may hard code the filename) containing n names, and read and store these names into a String array, - Ask user to enter a name to search in the array, - Create an object of SortAndSearch class (described below) and use the sort and search methods on this object. The search method retums true if the name exits in the list, else retums false, - Print "The given name .. exists" if the name is found, else "The given name . is not found", if the name doesn't exist in the list. Class: SortAndSearch, with the following properties: one instance field, i.e. Sring array constructor that sets the String array field with the input String array method 1 (for sorting) accepts the String array of as its argument, sorts it (using Selection sort algorithm), and retums the sorted array; method 2 (for searching) accepts two arguments: the sorted array and a specific name to search in this array (using Binary search algorithm), and returns trus if the given name exists, otherwise returms faise. Sample output is as below. If the txt file contains the following names (show the working of your program with at least 10 names in the txt file): John Mary Ravi Madeeha Pradeep Brandon Stephane Mark Abdul Ram And the user enters the following name to search: Enter the name to search: Mark The sorted array will be as follows: Abdul Brandon Jahn Madeeha Mark Mary Pradeep Ram Ravi Stephane After the search is performed, the program will print: The given name "Mark" exists
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS