Question

If the algorithm finds a site that contains the string (that is, Lenovo X200), assume that it then stores all data or all the text on that particular site into a storage area. To understand this problem fully, answer the following questions:

1. What is data mining?

2. What is a character string?

3. What is the worst case run time of this algorithm in terms of p, m, t, n (that is, what is O)?

4. How long do you think it will take this algorithm to run? Note the time complexity as O (run time in terms of n).

5. Assume that each Web site, on average, has character strings of length 10,000 and that the length of the character string "Lenovo X200" is 11. How many computations will the algorithm need to make per site?

6. Why is speed and the analysis of algorithm speed so important?

Inpurt: p(indexed from 1 to m), t (indexed from 1 to n), n

Ouput: i

text_search(p,m, t, n)

{ for i=1 to n−m+1 {

j=1

// i is the index in t of the first character of the substring

// to compare with p, and j is the index in p

// the while loop compares ti⋯ti+m−1 and p1⋯pm while (ti+j−1==pj) {

j=j+1

if (j>m)

return i }

}

return 0

}

Answer 1

1. What is data mining?

Data mining is the way toward dissecting concealed examples of data as indicated by alternate points of view for arrangement into helpful data, which is gathered and collected in like

manner zones, for example, data stockrooms, for productive examination, data mining calculations, encouraging business basic leadership and other data prerequisites to eventually cut expenses and increment income.

Data mining is otherwise called data revelation and information disclosure.

The real advances engaged with a data mining procedure are:

Concentrate, change and burden data into a data distribution center

Give data access to business investigators utilizing application programming

Present examined data in effectively reasonable structures, for example, charts

The initial phase in data mining is gathering pertinent data basic for business.

Value-based data manage everyday activities like deals, stock and cost and so forth.

Non-operational data is typically gauged, while metadata is worried about sensible database plan.

Examples and connections among data components render pertinent data, which may increment authoritative income.

Associations with a solid shopper center arrangement with data mining strategies giving clear pictures of items sold, value, rivalry, and client socioeconomics.

2. What is a character string?

A character string is a progression of characters spoken to by bits of code and sorted out into a solitary variable.

This string variable holding characters can be set to a particular length or investigated by a program to recognize its length.

In numerous sorts of PC programs, character strings are set apart by explicit grammar, which regularly incorporates quotes, and are set up or dimensioned by different programming directions.

These are then used to house various sorts of information that speak to ASCII characters.

Much of the time, a solitary byte speaks to one character by putting away a particular worth comparing to that character.

Distinctive coding shows can utilize Unicode or UTF conventions or "octet" conventions recognizing bytes as the units of activity.

A character string can assume numerous jobs in a PC program.

For instance, a software engineer can make an uninhabited character string with an order in the heap capacity of a program.

A client occasion can enter information into that character string.

In the event that the client types in a word or expression, for example, "hi world," the program can then later peruse that character string and print it, show

it on the screen, hold it for capacity, and so on.

3. What is the worst case run time of this algorithm in terms of p, m, t, n (that is, what is O)?

Finding a site that contains string Lenovo X200 is a quite hard thing, the worst case run time of this algorithm in terms of p,m,t,n

Assume that the search engine crawling the web for String "Lenovo X200". first of all the search engine search for Lenovo x200 and check all the sites which contain the term "Lenovo x200". so the worst case is checking websites one after one.

worst case= O(n)

4. How long do you think it will take this algorithm to run? Note the time complexity as O (run time in terms of n).

To run this algorithm, it takes more and more time(time complexity) because searching in web is not an simple task, it takes more time comlexity

In terms of O, the time complexity is O(n).

5. Assume that each Web site, on average, has character strings of length 10,000 and that the length of the character string "Lenovo X200" is 11. How many computations will the algorithm need to make per site?

"Lenovo X200" is 11, on and average the term taking 6 characters. So, in my opinion 1990 to 2000 computations.

it take nearly 2000 computations on average.

6. Why is speed and the analysis of algorithm speed so important?

In Assessing, we discussed evaluating things, for example, to what extent it goes for to stroll crosswise over town, or to what extent a task will take to wrap up.

In any case, there is another sort of assessing that Logical Software engineers utilize practically every day: evaluating the assets that algorithms use—time, processor, memory, etc.

Given a decision between two different ways of accomplishing something, which do you pick?

You realize to what extent your program keeps running with 1,000 records, however by what method will it scale to 1,000,000?

Incidentally, these inquiries can regularly be addressed utilizing sound judgment, some examination, and a method for composing approximations called the "enormous O" notation.