Class Notes of Spring 2006

Web and MIS Analysis

Topics of this semester:

1) What is right?

2) What is wrong?

3) 7 C analysis

Refer to Dr. Ebrahimi's website which has a consistency problem.

please pay attention to search on Old Westbury's web page:

The search is connected to the news.

How does search work?

    It takes the request and accesses (go where) the information, which are usually in files. Then it starts to match your request character by character. Use some algorithms. After you match it is either a success or a failure. If the match is a success then you respond back (display)/ look for the next match. Continue to look until End Of File(s) and loop.

Note:  Refer to pages 3 and 4.

A- 65

a- 97

97-65 = 32

32 is the difference of uppercase and lower case

Note: If you hit space and go, you get 100% as the results.

Note: Pages 13 and 15

look at page 13 lines 6 and 7

6. cout<<"ENTER THE SEARCH NAME: ";  //This is a fixed display or literal.

7. cin>>searchname;  //Grab the information and store it to a variable.

Above is the search portion part 1
 

Below is the search portion part 2

8. ifstream fin("data.in");  // Associate a file with the program. The name of the file is fin. You can change the file name manually or by a program. Put any name you want.

Note: Analyze the website/ systems.

Page 13 bottom diagram

What line deals with the match?

 Answer: Line 10 because of the word if

                10. if( strcmp( searchname,name ) == 0){

  Response:

                11. cout<<telephone<<endl

How would you make it more than one accordance?

12. return 0;  //Return means exit or go back.

Answer: delete line 12

\What happens if there isn't a match?

   Note: Loop starts with the word while (example pg. 13 bottom diagram line 9)

        9. while(fin>>name>>telephone){  //Grab the data until there is no more data.

Line 15

15. cout<<"NAME NOT FOUND"<<endl;

This line is at the end of your loop. Meaning that it cannot say not found until you have exhausted all of your resources.

Class Assignment: Pick a search program from the book and relate it to any existing search engine. For example, Google or Old Westbury and try to understand how each program works and how your program works. If there is a problem find the solution.