1. CPS 001 12.1 Today’s topics Java Information Retrieval Upcoming Database Programs Reading Great Ideas, Chapter 4

2. CPS 001 12.2 Information Retrieval  Often want to use program for information storage and retrieval  On line phone book is good example  Using “Parallel” or “Corresponding Arrays”  Array (of Strings) for Names  Array (of Strings) for Phone Numbers Name Number “J.Able” “D.Ramm” “R.Odom” “M.Salter” “W.Tars” “613-1978” “660-6532” “732-7616” “681-6326” “684-8111” “613-1978”

3. CPS 001 12.3 Phone Lookup Program public class LookUp extends java.applet.Applet implements ActionListener { TextField gName, gNum, mInstruct; String Name[]={"J.Able", "D.Ramm", "D.Ramm", "R.Odom", "M.Salter", "W.Tars"}; String Num[]= {"613-1978","660-6532","732-7616", "681-6326","684-8111","613-1978"}; Button bByName, bByNum; TextArea mResults; String name, num; int size; public void init() { mInstruct = new TextField(60); mInstruct.setText( "Enter search info; push related button");

4. CPS 001 12.4 Phone Lookup Program.2 gName = new TextField(25); gNum = new TextField(25); bByName = new Button("ByName"); bByNum = new Button("ByNum"); mResults = new TextArea(10, 60); bByName.addActionListener(this); bByNum.addActionListener(this); add(mInstruct); add(gName); add(bByName); add(gNum); add(bByNum); add(mResults); size = 6; } public void actionPerformed(ActionEvent event) { Object cause = event.getSource(); int k=0;

5. CPS 001 12.5 Phone Lookup Program.3 if (cause == bByName) { name = gName.getText(); while (k < size) { if (name.equals(Name[k])) mResults.append("Name: " + name + " shows number: " + Num[k] + "\n"); k = k + 1; } if (cause == bByNum) { num = gNum.getText(); while (k < size) { if (num.equals(Num[k])) mResults.append("Number: " + num + " shows name: " + Name[k] + "\n"); k = k + 1; }

6. CPS 001 12.6 Shortcomings?  Must enter exact match to one of the entries  Typing “ Ramm” gets no answers  Can’t enter partial number either  Imagine Law Enforcement Application  Partial entries desirable  Solving the “phone list” problems solve it here too  How about license plate with “holes” o E.g., A_C-12_45 (where underscore denotes possible missing data)  Require regular expression search  This goes beyond what we can easily do

7. CPS 001 12.7 Search Using a Single Array  Can solve most of the previous problems easily  Put all relevant info about one phone in one string  Need additional String method  indexOf method int indexOf(String key)  Searches for first occurrence of key with object string  Returns starting position of key: must be greater than or equal to 0 (>=0)  What if it doesn’t find the string (key) sought?  Needs to return something that can’t be mistaken for location of string  ?  Resulting program much more flexible

8. CPS 001 12.8 public class Search extends java.applet.Applet implements ActionListener { TextField gKey, mInstruct; String Info[]={"J.Able, 613-1978", "D.Ramm, 660-6532", "D.Ramm, 732-7616", "R.Odom, 681-6326", "M.Salter, 684-8111", "W.Tars, 613-1978"}; Button bSearch; TextArea mResults; String key; int size = 6; public void init() { mInstruct = new TextField(60); mInstruct.setText( "Enter search info; push related button"); gKey = new TextField(35); bSearch = new Button("Search"); Search Program

9. CPS 001 12.9 mResults = new TextArea(10, 60); bSearch.addActionListener(this); add(mInstruct); add(gKey); add(bSearch); add(mResults); } public void actionPerformed(ActionEvent event) { Object cause = event.getSource(); int k=0; if (cause == bSearch) { key = gKey.getText(); while (k < size) { if (Info[k].indexOf(key) >= 0) mResults.append(Info[k]+"\n"); k = k + 1; } Search Program.2

10. CPS 001 12.10 Database  Extend ideas used in phone program  Can have many “parallel” arrays  Design Used Car Database Make Style Color Owner Year “Mercedes” “Ford” “Mercedes” “Datsun” “Ford” “4 door” “truck” “4 door” “2 door” “4 door” “white” “ivory” “blue” “green” “red” “blue” “M.Ramm” “D.Ramm” “M.Ramm” “D.Ramm” “K.Ramm” “D.Ramm” 1987 1972 1971 1978