Answer:
scalene
Step-by-step explanation:
you can tell by the shape
Answer:
Population is all students from grades 3-12.
Sample is the students who participated in the survey.
Step-by-step explanation:
Given : A survey of third- to twelfth-grade students with a sample size of 2026 found that they devoted an average of 1 hour and 46 minutes per day to using entertainment media.
To find : Identify the population and the sample.
Solution :
The population is defined as it contain all individuals which we want to collect the information.
So, the population consists of all third- to twelfth grade students.
Therefore, Population is all students from grades 3-12.
The sample is defined as a part of population of which information was actually collected.
So, the sample is only the respondents in the survey conducted in 2026.
Therefore, Sample is the students who participated in the survey.
Answer:
Step-by-step explanation:
Juan has 20 books to sell. He sells the books for $15 each.
The range of the function is the set of all possible values of the dependent variable. The dependent variable here is the amount of money that is made and this amount depends on
the number of books, x sold
The amount of money Juan makes from selling books is represented by a fucntion. f(x)=15x
The maximum amount that can be made from 20 books at a rate of $15 each would be 20×15 = $300
The minimum amount that fan be made is $0 and this is when no book is sold. Let y = f(x). So the range is
0 lesser than or equal to y lesser than or equal to 300
Answer:
Step-by-step explanation:
Rewrite this quadratic in standard form: 3x^2 + 7x - 1.
The coefficients of x are {3, 7, -1}, and so the discriminant is b^2 - 4ac, or
7^2 - 4(3)(-1), or 49 + 12, or 61. Because the discriminant is positive, this quadratic has two real, unequal roots
Answer:
Step-by-step explanation:
a.) The worst-case height of an AVL tree or red-black tree with 100,000 entries is 2 log 100, 000.
b.) A (2, 4) tree storing these same number of entries would have a worst-case height of log 100, 000.
c.) A red-black tree with 100,000 entries is 2 log 100, 000
d.) The worst-case height of T is 100,000.
e.) A binary search tree storing such a set would have a worst-case height of 100,000.
