All categories

2 years ago

One limitation of high-level programming languages is

Computers and Technology

1 answer:

faltersainse [42]2 years ago

4 0

Answer:

One limitation of high-level programming languages is It takes additional translation times to translate the source to machine code

<em>High level programs are comparatively slower than low level programs. Compared to low level programs, they are generally less memory efficient. Cannot communicate directly with the hardware.</em>

You might be interested in

How can I convert a string to a int? in Java

Deffense [45]

Answer:

int

Explanation:

5 0

2 years ago

QUESTION 6 Which of the following is a class A IPv4 address? a. 118.20.210.254 b. 183.16.17.30 c. 215.16.17.30 d. 255.255.0.0

shepuryov [24]

Answer:

a. 118.20.210.254

Explanation:

Here are the few characteristics of Class A:

First bit of the first octet of class A is 0.

This class has 8 bits for network and 24 bits for hosts.

The default sub-net mask for class A IP address is 255.0.0.0

Lets see if the first bit of first octet of 118.20.210.254 address is 0.

118 in binary (8 bits) can be represented as : 1110110

To complete 8 bits add a 0 to the left.

01110110

First bit of the first octet of class A is 0 So this is class A address.

For option b the first octet is : 183 in the form of bits = 10110111 So it is not class A address

For option c the first octet is 215 in the form of bits = 11010111 So it is not class A address

For option d the first octet is 255 in the form of bits = 11111111. The first bit of first octet is not 0 so it is also not class A address.

3 0

2 years ago

13. An Internet Service Provider (ISP) is a company that builds the routers and wired connections that allow individuals to acce

valentinak56 [21]

Answer:

C. redundant networks are more reliable.

Explanation: I just got a 100 on a test and that question was asked.

7 0

2 years ago

Directions

Aneli [31]

Would you like me to answer with a paragraph or essay,

3 0

2 years ago

Suppose you wish to develop a matrix-multiplication algorithm that is asymptotically faster than Strassen’s algorithm. Your algo

Kazeer [188]

Answer:

The number of subproblems are given as $T(n)=a*T(n/8)+\theta(n^2)$ while the value of T(n) to be less than S(n) is for 342.

Explanation:

The number of subproblems are given as

$T(n)=a*T(n/8)+\theta(n^2)$

Asymptotic running time for Strassen’s algorithm is $S(n)=\theta(n^{log(7)})$

Now, when a increases, number of subproblems determines the asymptotic running time of the problem and case 1 of master theorem applies. So, in worst case, asymptotic running time of the algorithm will be

$T(n)=\theta(n^{logb(a)})=\theta(n^{log8(a)})=\theta(n^{log_{2}(a^{1/3})})$

Now, for T(n) to be smaller than S(n)

$n^{loga^{1/3}}$

So,

$log(a^{(1/3)})$

So,

a=342

5 0

3 years ago