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
andrew-mc [135]
3 years ago
10

First person to make me laugh will get brainliest.​

Computers and Technology
2 answers:
sergey [27]3 years ago
7 0

Answer:

Made u laugh

Explanation:

galina1969 [7]3 years ago
4 0

Answer:

what did the shark say after eating the clownfish

this taste a little funny

Explanation:

i'm sorry i really tried

You might be interested in
What was the first portable computer called and who made it?
jekas [21]
It was the Osborne 1 made by Adam Osborne in 1981.
6 0
3 years ago
A posting error is:
Sunny_sXe [5.5K]

Answer:

The correct answer to the given question is option D) Any or all of the above.

Explanation:

A posting error is a type of error which is related to ledger and would include the errors like -

Posting wrong amount on the right side of account

Posting right amount on the wrong side of right account

Posting an amount twice and posting omission

Posting wrong amount to wrong side of right account

Posting correct amount on wrong account on right side

So by knowing all the given above points, it is quite clear that the correct option is D.

7 0
3 years ago
Which statement describes how to insert the IF, COUNTIF, or SUM function into a cell?
Gre4nikov [31]

Answer:

B Type an = sign in the cell, followed by the name of the function and the relevant arguments.

Explanation:

always look for =

8 0
3 years ago
An algorithm whose worst-case time complexity is bounded above by a polynomial function of its size is called a(n)
Sedaia [141]

Answer:

polynomial-bounded algorithms

Explanation:

There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.

The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.

4 0
2 years ago
What are some local storage devices?​
german

Pendrive, CD is local storage divices

8 0
3 years ago
Other questions:
  • Page orientation can be either landscape or _____.
    13·1 answer
  • A user has been given Full Control permission to a shared folder. The user has been given Modify permission at the NTFS level to
    11·1 answer
  • Use the _______ command to combine the selected cells and center them. merge across center across selection merge cells merge an
    7·1 answer
  • What are three ways you cite evedince
    5·2 answers
  • Which statement is not true? An audit objective for systems maintenance is to detect unauthorized access to application database
    8·1 answer
  • The algorithm ____ is used to find the elements in one range of elements that do not appear in another range of elements.
    5·1 answer
  • What should be a technicians first step in an A/C system
    7·1 answer
  • Finish the program by choosing the correct terms.
    7·2 answers
  • Suppose that the following elements are added in the specified order to an empty binary search tree: Kirk, Spock, Scotty, McCoy,
    12·1 answer
  • Profitability, consumer relations, and competition are involved in what kinds of concerns in the design process?
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!