All categories

3 years ago

Web and mobile applications are created for users to only read information. True False

2 answers:

8 0

I believe it is false
Because the applications are not only for reading. There are many other things it can be used for.

I hope this helps :-)

SIZIF [17.4K]3 years ago

4 0

I think it's false. It's not created just for reading.

You might be interested in

Name various phases of SDLC in Rational Unified Process (RUP)

ss7ja [257]

Answer:

The RUP is an agile software development type of methodologies, and it consists of four phases, which are

• inception,

• elaboration,

• construction

• and transition.

The main aim of the RUP is to come up with a software that is very high in quality, and with a predictable budget, as well as it must be according to the time frame.

Explanation:

Please check the answer section.

6 0

3 years ago

Does anyone have any social media message me

Mademuasel [1]

What's your username on them?

5 0

3 years ago

Piers wants to take a course on XML. He is a certified web designer, but he has not used XML before. How can he use XML to impro

PIT_PIT [208]

Answer:

Check Explanation (last paragraph, please).

Explanation:

The acronym "XML" simply stand for Extensible Markup Language and it is a programming language that is for coding infomation or data.

Extensible Markup Language(XML) is very acceptable and whenever one read or search a website that uses XML, it gives viewers good experience.

Piers can use XML to improve his website creations through the declaration of a namespace which has an integral part to a script element. The tags in XML does not have limitation like other languages. Also, Extensible Markup Language(XML) does not need to be updated all the time in as much as the website itself is being updated.

7 0

3 years ago

Binary is best interpreted by a computer because

Nookie1986 [14]

Because it is the back-end programming. It is the basis of all of the other computer languages and allows the computer to function.

8 0

3 years ago

Read 2 more answers

Oxnard Casualty wants to ensure that their e-mail server has 99.98 percent reliability. They will use several independent server

sattari [20]

Answer:

The smallest number of servers required is 3 servers

Explanation:

Given

$Reliability = 99.98\%$

$Individual Servers = 95\%$

Required

Minimum number of servers needed

Let p represent the probability that a server is reliable and the probability that it wont be reliable be represented with q

Such that

$p = 95\%\\$

It should be noted that probabilities always add up to 1;

So,

$p + q = 1$ '

Subtract p from both sides

$p - p + q = 1 - p$

$q = 1 - p$

Substitute $p = 95\%\\$

$q = 1 - 95\%$

Convert % to fraction

$q = 1 - \frac{95}{100}$

Convert fraction to decimal

$q = 1 - 0.95$

$q = 0.05$

------------------------------------------------------------------------------------------------

To get an expression for one server

The probabilities of 1 servers having 99.98% reliability is as follows;

$p = 99.98\%$

Recall that probabilities always add up to 1;

So,

$p + q = 1$

Subtract q from both sides

$p + q - q = 1 - q$

$p = 1 - q$

So,

$p = 1 - q = 99.98\%$

$1 - q = 99.98\%$

Let the number of servers be represented with n

The above expression becomes

$1 - q^n = 99.98\%$

Convert percent to fraction

$1 - q^n = \frac{9998}{10000}$

Convert fraction to decimal

$1 - q^n = 0.9998$

Add $q^n$ to both sides

$1 - q^n + q^n= 0.9998 + q^n$

$1 = 0.9998 + q^n$

Subtract 0.9998 from both sides

$1 - 0.9998 = 0.9998 - 0.9998 + q^n$

$1 - 0.9998 = q^n$

$0.0002 = q^n$

Recall that $q = 0.05$

So, the expression becomes

$0.0002 = 0.05^n$

Take Log of both sides

$Log(0.0002) = Log(0.05^n)$

From laws of logarithm $Loga^b = bLoga$

So,

$Log(0.0002) = Log(0.05^n)$ becomes

$Log(0.0002) = nLog(0.05)$

Divide both sides by $Log0.05$

$\frac{Log(0.0002)}{Log(0.05)} = \frac{nLog(0.05)}{Log(0.05)}$

$\frac{Log(0.0002)}{Log(0.05)} = n$

$n = \frac{Log(0.0002)}{Log(0.05)}$

$n = \frac{-3.69897000434}{-1.30102999566}$

$n = 2.84310893421$

$n = 3 (Approximated)$

Hence, the smallest number of servers required is 3 servers

6 0

3 years ago