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
alexandr1967 [171]
2 years ago
14

How are the number of rows calculated.​

Computers and Technology
1 answer:
Eva8 [605]2 years ago
6 0

Answer:

ROWS function

Explanation:

Hope this helped

You might be interested in
Select the correct term to complete the sentence.
Marat540 [252]

Answer:

A program that searches a database for specific words and returns a list of webpages or documents in which the search term was found. ... A _____ is an application that runs in a

Explanation:

6 0
2 years ago
Read 2 more answers
What is the device used for the calculations of payment and balancing the accounts record s​
Greeley [361]
A calculator or bank? Maybe an atm
6 0
1 year ago
Read 2 more answers
How can photography allow us to view the world around us in different ways?
Nimfa-mama [501]
Photography allows us to view the world around us in different ways, by giving us the sense and feel of what others feel, Photography is art. You are able to use photography to define actions, for example happiness in a marriage or happiness in children playing at the park. Photography also allows you to explore and discover new things, and make something out of that. It makes you think a bout different ways to change the world around you, how do you define the world?
7 0
2 years ago
Read 2 more answers
An IT systems engineer creates a new Domain Name System (DNS) zone that contains a pointer (PTR) resource records. Which zone ty
irina1246 [14]

Answer: Reverse DNS zone

Explo: a reverse DNS zone needs a PTR record since it is in charge of resolving the IP address to a domain or a hostname.

5 0
2 years ago
"What is the running time of HEAPSORT on an array A of length n thatis already sorted in increasing order?
Harrizon [31]

Answer:

The answer to this question is O(NlogN).

Explanation:

The time complexity of Heap Sort on an array A is O(NLogN) even if the array  is already sorted in increasing order.Since the Heap Sort is implemented by creating the heap from the array and then heapifying and then repeatedly swapping first and last element and deleting the last element.The process will be done for the whole array.So the running time complexity is O(NLogN).

5 0
3 years ago
Other questions:
  • A(n) _____ is a type of server that stores computer software, which users can access from their workstations.
    6·1 answer
  • You are adding a new 500 GB hard drive to your computer. The hard drive must be formatted with a file system to organize files i
    8·1 answer
  • Please code this in c++
    10·1 answer
  • You can't cite Wikipedia, what are three ways that you can use it for your research?
    5·1 answer
  • Define a function print_feet_inch_short(), with parameters num_feet and num_inches, that prints using ' and " shorthand. End wit
    6·2 answers
  • Describe how you can use JavaScript to simulate the behavior of the placeholder attribute in older browsers
    8·1 answer
  • 5 differences between a regular mouse and a gaming mouse​
    14·1 answer
  • You are the administrator for the ABC Company. You are looking to install Windows Server 2016, and you need to decide which vers
    13·1 answer
  • This function returns the length of a string:
    13·1 answer
  • The ________ approach to motivation suggests a connection between internal physical states and outward behavior. achievement dri
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!