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
mario62 [17]
3 years ago
9

3. What do you need to do before you can sort and filter data in a database?

Computers and Technology
1 answer:
Digiron [165]3 years ago
5 0

3. format the table

4. idk

You might be interested in
Which of the following items is not found on a web page?
navik [9.2K]
The answer is B. book mark definitely
7 0
3 years ago
A user left a comment. Which best describes where will it be seen?
skelet666 [1.2K]

The correct answer is "It will be highlighted in the text and seen in the right margin."

Comments are known as notes or annotations that gives an author or editor an idea about a common mistake in his or her work. In other words, comments are used to give a heads up to the creator of a specific document.

7 0
3 years ago
Read 2 more answers
Sites like Zillow get input about house prices from a database and provide nice summaries for readers. Write a program with two
qaws [65]

Answer:

Se explaination

Explanation:

/Declaring variables

integer currentPrice

integer lastMonthPrice

integer changeLastMonth

float mortagage

//Reading input

currentPrice = Get next input

lastMonthPrice = Get next input

//Calculating price change

changeLastMonth = currentPrice - lastMonthPrice

//Calculating mortagage

mortagage = (currentPrice * 0.051) / 12

//Printing output

Put "This house is $" to output

Put currentPrice to output

Put "\nThe change is $" to output

Put changeLastMonth to output

Put " since last month." to output

Put "\nThe estimated monthly mortgage is $" to output

Put mortagage to output

3 0
3 years ago
Give an efficient algorithm to find all keys in a min heap that are smaller than a provided valueX. The provided valuedoes notha
OlgaM077 [116]

Answer:

Starting from root, recursively traverse the min-heap. Once we find a key with value less than our X, we know that every key in subtree of that key will be also smaller than our X. Otherwise, we should keep traversing.

Explanation:

The complexity of this algorithm will be O(N) where N is the number of keys in our min-heap.

3 0
3 years ago
What tells the hardware what to do and how to do it?
oksano4ka [1.4K]

Answer:

I think its CPU

Explanation:

8 0
3 years ago
Other questions:
  • Which task can be completed using the Export File menu?
    5·1 answer
  • Students who interact online with others from different cultures should remember that
    5·2 answers
  • Which country began expanding its borders with exploration in the late 16th<br>century?​
    15·1 answer
  • Whay device is recommended to use to install windows 10
    13·1 answer
  • Karel challenges answers
    11·1 answer
  • String member function compare compares two strings (or substrings) and returns 0 if:
    5·1 answer
  • Why now days 3D images are used in cartoons? What are the drawbacks of 2D image?
    14·2 answers
  • What has happened (or is still happening) to make this speech occur? armageddon
    15·1 answer
  • 35 POINTS
    10·1 answer
  • What is the grooming process as it relates to online predators
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!