True False Quiz will be on Wednesday. 10/4/06
Main Topics
How to evaluate a search engine.
Make sure to understand the
search programs in the book. How to relate this search program to the search
engine to the other yahoo users and google users. Previously we evaluated the
search engines. What is the criteria for evaluating a search. What kind of
input you test? How would you test? What kind of input do you use to test the
search engine. For example blank space or question mark. We use lower case and
upper case. We look for consistency, someone who is there. What else do we
do? We look at the interface as well. The correctness is important and the
7C's is a good thing to use in real life. Is concise, current, complete? We
looked at the search engine of Google, Yahoo, AltaVista, MSN, Live, AskJeeve,
DogPile.
How to evaluate a webpage.
Look at the 7C Evaluation of the WebPages and try to understand the phase 1 - 6 of your project.
Make sure everybody has a GeoCities Account.

Do you know how to make the seperator? | <----
Press Shift and Back Slash.
Spacebar =  
www.shahezad.com
Use Addr.com
What is SQL?
Structured Query Language
It's a query language with 4 important commands. Select, Update, Delete, Add.
Example 1: SELECT * FROM books WHERE price > 100.00 ORDER BY title
Wikipedia.com search for SQL.
Data manipulation
First there are the standard Data Manipulation Language (DML) elements. DML is the subset of the language used to add, update and delete data.
· INSERT is used to add zero or more rows (formally tuples) to an existing table.
· UPDATE is used to modify the values of a set of existing table rows.
· MERGE is used to combine the data of multiple tables. It is something of a combination of the INSERT and UPDATE elements. It is defined in the SQL:2003 standard; prior to that, some databases provided similar functionality via different syntax, sometimes called an "upsert".
· TRUNCATE deletes all data from a table (non-standard, but common SQL command).
· DELETE removes zero or more existing rows from a table.
Look for a C++ program for search engine.
What is information retreival?
We need world-class engineers to join our engineering team in developing our next-generation search engine and related technologies. We’re working on problems in a number of areas, including cutting-edge information retrieval algorithms, scalability issues related to dealing with huge amounts of data and a rapidly increasing user population, and a variety of novel search features.
www.google.com jobs section.
When the data becomes huge. The search becomes slower and possibly inaccurate.
When it comes programming
and problem solving, the word "algorithm" is frequently used. At first glance,
most people associate the word algorithm with a mathematical term suc as
Logarithm. in programming, algorithm refers to the problem solving steps that
are needed to find a solution to a roblem, such as finding the shortest path
from one city to another or computing emplooyee wages. Where does the word
algorithm come from? It came from Persian scientist Alkharazmi who wrote a book
around 825 A.D. called "algebr and Moghabelah" which translates to "Reduction
and Calculation".
Taken from Dr. Ebrahimi's Programming Easy Ways Volume 1 Page 100.
Is there a way to get to Manhattan without paying the toll?
Sequential Search Program is what we're working on right now. It works with a file. It is context defined. The first word is the file name.
We will discuss Unix/Linux. When you anazlyze your sistem find out if they're Unix based on Windows based.
We're looking for a highly
technical, hands-on Engineering Director to lead a team of 1-2 managers, 4-10+
Google software engineers and systems administrators for the Google.com group.
The Google.com teams are directly responsible for Google's stellar uptime
record, and act as the guardians and custodians of Google's user-visible
services. In this leadership role, you will be responsible for ensuring that
Google users can always reach and use all of the services under your team's
care.
GNU = GNU's not Unix.
A foundation that promotes free software.
Note: These are not programs. They are functions only. This is what would be in the implementation file.
One popular example is showing three functions that produce the same results but go about the problem in three different ways.
The old fashioned way: linear searching: Order O(n) - slow but works on unsorted data
A very efficient way: the binary search: Order O(log n) - fast but requires sorted data
The coolest of the three: the recursive binary search: Order O(log n) - fast but requires sorted data
www.ius.edu website