Assume that a typical Reference Class called Student is accessible by the following method called linearSearch.  Notice that the code for linearSearch is not complete.  Assume further that the Student class has an attribute  called lastName and that the class has a getter mehod called getLastName() .  Which statements may be used to complete the definition of  the linearSearch method so that the method uses the linear search algorithm and that the method returns true if there is a student in an array of Student with a lastName that matches the searchKey. a. studs[index].getLastName().equals(searchKey) b. studs[index].getLastName().compareTo(searchKey) == 0 c. studs[index].getLastName().equalsIgnoreCase(searchKey) d. studs[index].getLastName().compareToIgnoreCase(searchKey) == 0 e. Not given

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...
icon
Related questions
Question

Assume that a typical Reference Class called Student is accessible by the following method called linearSearch.  Notice that the code for linearSearch is not complete.  Assume further that the Student class has an attribute  called lastName and that the class has a getter mehod called getLastName() .  Which statements may be used to complete the definition of  the linearSearch method so that the method uses the linear search algorithm and that the method returns true if there is a student in an array of Student with a lastName that matches the searchKey.

a. studs[index].getLastName().equals(searchKey)
b. studs[index].getLastName().compareTo(searchKey) == 0
c. studs[index].getLastName().equalsIgnoreCase(searchKey)
d. studs[index].getLastName().compareToIgnoreCase(searchKey) == 0
e. Not given

public boolean linearSearch (Student[] studs, String searchkey) {
boolean result = false;
for (int index = 0; index < studs.length && result == false; index++) {
if (
result = true;
}
return result;
}
Transcribed Image Text:public boolean linearSearch (Student[] studs, String searchkey) { boolean result = false; for (int index = 0; index < studs.length && result == false; index++) { if ( result = true; } return result; }
Expert Solution
steps

Step by step

Solved in 2 steps

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