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
mamaluj [8]
3 years ago
9

What is a text based language that can be used to build all kinds of things ????

Computers and Technology
1 answer:
Makovka662 [10]3 years ago
4 0

Answer:

It's easier to define text-based programming languages. These are languages that are typed using a keyboard and stored as text files. A graphical or visual language typically uses drag and drop rather than typing. It may use icons or textual labels on blocks or elements.

You might be interested in
Which 4 elements are commonly contained in a master page?
Arturiano [62]

Answer:

if this is in aspnet then

Step 1: Open new project in visual studio.

Step 2: Add new file in to our project.

Step 3: Design the master page, using HTML.

Step 4: Add web form in to our project.

Explanation:

7 0
3 years ago
Why is it important to create a web maintenance schedule? Check all of the boxes that apply.
Andreas93 [3]
Attach a picture so we can see the question
3 0
3 years ago
CP/IP over Ethernet supports basic frames with a total size of up to 1518 bytes (including both the message payload and headers)
Ne4ueva [31]

Answer:

I think you just add all the Bytes together

6 0
3 years ago
How do mark somebody as brainliest??
svet-max [94.6K]

Answer:

Once more that one person answer, you will get an option next to the heart and the star that would look like a crown

Explanation:

That is how you do it.

4 0
3 years ago
Let T(n) denote the running time for the Sort-and-Count algorithm (below). Sort-and-Count(L) { if list L has one element return
butalik [34]

Answer:

The answer is "\bold{T(n) = 2T(\frac{n}{2}) + n}"

Explanation:

Given:

The Merge-And-Count of (A,B) runs in time |Al+IB|

T(n) recurrence=?

Calculating the value of the recurrence:

\to  T(n) = T(\frac{n}{2}) + T(\frac{n}{2}) + f(|A| + |B|)\\\\  \therefore f(|A| + |B|) = n\\\\ \to T(n) = 2T(\frac{n}{2}) + n

7 0
3 years ago
Other questions:
  • What is the portion of the PowerPoint window that contains the current slide, total slides, zoom options, and various shortcuts
    8·1 answer
  • What purpose would tracking changes be most useful for?
    7·1 answer
  • A page can have High needs met rating even if it is not related To the topic of the query​
    9·1 answer
  • g c 24-hour time (also known in the U.S. as military time) is widely used around the world. Time is expressed as hours since mid
    7·1 answer
  • A ______ is a personal computer which stays in one location (e.g. office) due to its larger form factor.
    5·1 answer
  • A band from the 1970s has reunited. They want to revive their careers, but they do not have the funding they once did. An intern
    15·1 answer
  • What is information associated with a document to help describe that document called?
    12·1 answer
  • 4. Write an interactive program CountOddDigits that accepts an integer as its inputs and prints the number of even-valued digits
    10·1 answer
  • Lol WAKE UP!!! and get ready to answer my questions.
    12·1 answer
  • The counting function uses only ___________________ arguments
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!