Assume you have 100 values that are all different, and use equal width discretization with 10 bins. a) What is the largest number of records that could appear in one bin?
b) What is the smallest number of records that could appear in one bin?
c) If you use equal height discretization with 10 bins, what is largest number of records that can appear in one bin?
d) smallest?
e) Now assume that the maximum value frequency is 20. What is the largest number of records that could appear in one bin with equal width discretization (10 bins)?
f) . What about with equal height discretization (10 bins)?

a) 10

b) 1

C) 10

D) 1

E) 20

F)  10

Explanation:

a) The largest number of records that could appear in one bin

 = 10

B) The smallest number of records that could appear in one bin

= 1

C) The largest number of records that cab appear in one bin

= 10

d) smallest number

= 1

e) With frequency = 20. the largest number of records that could appear in one bin with equal width discretization (10 bins)

= 20

f ) with equal height discretization

= 10

(http) hyper text transfer protocol

which means its an input that allows the "site" to connect with severs.

yes you can very simple, click the heart and then click the follow requests button.