All categories

3 years ago

When programming, the word "execute" means which of these?

Computers and Technology

1 answer:

Inga [223]3 years ago

7 0

Answer:

to run!

Explanation:

hope this is helpful!

You might be interested in

wo non-negative integers x and y are equal if either: Both are 0, or x-1 and y-1 are equal Write a function named equals that re

Mrac [35]

Answer:

Using python programming language.

Explanation:

#to define the function write as below

def equal():

#to get the two integers from the user

#The user is asked for input in the code below.

x = int(input("Enter the value for X"))

y= int(input("Enter the value for y"))

if x==0 and y==0:

print("both numbers are ", "0")

elif: x==1 and y==1: #This test if both x and y are 1

print("true")

elif: x==y: #this line test if both values are equal

print("true")

else:

print("False")

equal() #end of the function

3 0

3 years ago

The ______ manages the hardware components including the cpu, memory storage, and peripheral devices. options operating system d

Alexandra [31]

The answer is the os or operating system

8 0

3 years ago

In understanding "controlling for" a third variable, which of the following is a similar concept? a. Conducting a replication b.

nordsb [41]

Answer:

D) Identifying Subgroups

Explanation:

In data Analytics, a third variable also known as a confounding variable, is a variable that "sits in-between", it has influence on both the independent variable and dependent variable. If this "third variable" is not properly handled, the result of the anlysis will yeild incorrect values. identifying subgroups in a dataset is important for undertanding it

7 0

2 years ago

Plz Help!! How should I answer the second question?

Harman [31]

Answer:

Just keep doing what you were doing explain what you would be doing in the future or where you see yourself in like 5 years and put details and things that make since to you!

4 0

3 years ago

Mergesort uses the divide-and-conquer technique to sort a list. True False

NARA [144]

Answer:

True: Merge Sort sorts a list using divide-conquer approach.

Merge_Sort(B,p,n) //p is the starting index of array B and n is the last index.

1. if(p<n)

2. q ← (p+n)/2 //divides the list into two sub-lists

2. Merge_Sort(B, p, q) //sorts the left half

3. Merge_Sort(B, q+1, n) //sorts the right half.

4. Merge(B, p, q, n)

Merge(B, p, q, n)

1.l ← q-p+1. //no. of elements in left half

2.m ← n-q //no. of elements in right half.

3.for x ← 1 to l

4. Left[x] = B[p+x -1] //The elements of left half are copied to Left array

5.for y ← 1 to m.

6. Right[y]= B[q+y] //The elements of right half are copied to right array

7. x ← 1, y ←1

8.for z ← p to n.

9. if( Left[x] ≤ Right[y] ) // to merge the two lists Left and Right, the //elements are compared.

10. { A[z] ← Left[x] //smaller one comes to the merged list.

11. x++. }

12. else

13. { A[z] ← Right[y]

14. y++ }

Explanation:

The Merge_Sort(A, p, n) algorithm first divides the whole array into two halves. Then again divides the sub-lists into it's halves and so on.

Then using merge algorithm it compares the elements of both halves one by one and keep it in sorted order.

6 0

3 years ago