Ask question

Ask question

All categories

3 years ago

15

The house belives that works should be compensated for the loss of jobs due to automation? Describe it in against motion of the

debate

Computers and Technology

1 answer:

Dima020 [189]3 years ago

5 0

well they should because without a job people cant live a good life and if they took that from them then they should compensate them at least.

You might be interested in

Using recursion, write a program that asks a user to enter the starting coordinates (row, then column), the ending coordinates (

Luden [163]

Answer:

The program in Python is as follows

def Paths(row,col):

if row ==0 or col==0:

return 1

return (Paths(row-1, col) + Paths(row, col-1))

row = int(input("Row: "))

col = int(input("Column: "))

print("Paths: ", Paths(row,col))

Explanation:

This defines the function

def Paths(row,col):

If row or column is 0, the function returns 1

<em> if row ==0 or col==0: </em>

<em> return 1 </em>

This calls the function recursively, as long as row and col are greater than 1

<em> return (Paths(row-1, col) + Paths(row, col-1))</em>

The main begins here

This prompts the user for rows

row = int(input("Row: "))

This prompts the user for columns

col = int(input("Column: "))

This calls the Paths function and prints the number of paths

print("Paths: ", Paths(row,col))

4 0

2 years ago

Help to how to write pseudo code to insert a new node to Binary Search Tree. Using C++.

dimulka [17.4K]

Answer:

Let the function be Node* ins(Node *root,int k)

if root node is NULL then return new node with data equal to k.

If the k <root->data

root->left=ins(root->left,k);

else if k >root->data

root->right =ins(root->right,k);

At last return root.

Explanation:

Node is always inserted at the at the leaf node.We will search k in the tree if we hit a the leaf node the new node is inserted as the child of the leaf node.

4 0

2 years ago

Identify what algorithm or concept the following code relates to. void Sort(int array[], int tempArray[], int left, int right) {

galina1969 [7]

Answer:

Binary sort

Explanation:

Binary sort is one of the fastest search techniques used on arrays and other iterable data types. It algorithm sorts the array in ascending order then gets the item in the middle from which it divides the array to be searched in two parts. If the searched term is less than the mid item, then it is searched for in the first part, else it would be in the second.

4 0

2 years ago

The rubric given to them by their teacher requires that

Arte-miy333 [17]

Answer:1:navigate to the paragraph command group

2:Click the line and paragraph spacing option

3:Click the space required

Explanation:

3 0

2 years ago

In 4-bit two's complement representation, what is the binary encoding of the number -5?

Katena32 [7]

Answer:

a) 1011

Explanation:

In 4 bit two's complement representation, the first bit is the sign bit.

If the sign bit is 1, the number is negative.

If the sign bit is 0, the number is positive.

What is the magnitude of the sign bit?

In n-bit two's complement representation, the magnitude of the sign bit is:

$2^{n-1}-1$

So, in 4-bit two's complement representation, the magnitude of the sign bit is:

$2^{4-1}-1 = 8$

Since the number is negative, the value of this bit is -8.

The other bits are magnitude bits, positive.

We have that the sum of these bits must be -5, and we already have -8. So what should be the value of these last 3 bits?

First, i am going to solve this equation to find the decimal value of the last three bits.

$-5 = -8 + x$

$x = 3$

So, the last three bits are:

$3_{10} = (011)_{2}$

The binary encoding of the number -5 is:

a) 1011

5 0

2 years ago