1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
olasank [31]
3 years ago
7

For a sample of 100 students, the median number of text messages sent per day is 90, the first quartile is 78, and the third qua

rtile is 102.
Select all of the answers that create a true statement
Approximately 25 students in the sample send
more than 90 text messages.
less than 90 text messages.
more than 78 text messages.
more than 102 text messages.
between 90 and 102 text messages.
less than 78 text messages.​
Computers and Technology
1 answer:
crimeas [40]3 years ago
4 0
Less than 78, more than 102,
You might be interested in
What is a expansion card for computer?
4vir4ik [10]
Most computers have expansion slots on the motherboard that allow you to add various types of expansion cards. These are sometimes called PCI<span> (</span>peripheral component interconnect<span>) cards. You may never have to add any </span>PCI<span> cards because most motherboards have built-in video, sound, network, and other capabilities</span>
5 0
3 years ago
What may happen if there is too much harmony in a design?
Rudiy27

Answer:

B It can seem boring.

Explanation:

The repetition of visual effects results in consistency, rhythm, and movement. However, too much repetition can cause monotony and boredom. And this is not good for you certainly. You are certainly going to lose the audience. And too much harmony in design as well in a similar manner causes boredom, or it can seem boring. And hence, the correct option here is B it can seem boring.

5 0
3 years ago
A complete traversal of an n node binary tree is a(n)____ "operation if visiting a node is O(1)for the iterative implementation
ch4aika [34]

Answer:

B.O(n).

Explanation:

Since the time complexity of visiting a node is O(1) in iterative implementation.So the time complexity of visiting every single node in binary tree is O(n).We can use level order traversal of a binary tree using a queue.Which can visit every node in O(n) time.Level order traversal do it in a single loop without doing any extra traversal.

8 0
3 years ago
Why can't you test a program for run-time errors when it has compile-time (syntax) errors
Leno4ka [110]

Answer:

your computer will not allow it

Explanation:

because it is not one of the main dyonostics

6 0
3 years ago
What is the difference between posting and transfer in ICT please I need the answer before TMR​
Radda [10]

Answer: b

Explanation: trust

7 0
2 years ago
Other questions:
  • How do humans feel about being abducted?
    12·2 answers
  • True / False<br> Registers are generally optimized for capacity instead of speed.
    14·1 answer
  • Write a function M-file that takes as input two matrices A and B, and as output produces
    8·1 answer
  • Storing a value in a variable<br> Exponent<br> Variable<br> Assignment<br> Operator
    13·1 answer
  • What kind of battery does a dji spark have?
    12·1 answer
  • The bubble sort algorithm sorts using what technique?
    14·1 answer
  • 2. Which Interface uses
    7·1 answer
  • The objective of this task is to use Scapy to estimate the distance, in terms of number of routers, between your VM and a select
    7·2 answers
  • What are the features of the title bar for the Microsoft word application?​
    15·2 answers
  • The second generation of computer languages is a higher-level language than
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!