Answer: E
All decision variables must be integer
Explanation:
The integer-linear program is a program in which the objective function and any constraints are all linear ie all of the variables are restricted to be integers.
A linear program is Np complete. Also every decision variable appear in any constraints must also appear in the objective function, possibly with zero coefficient if needed.
A two dimensional area with recognizable boundary is called a shape
mutualism, commensalism, competition and predation
Answer:
An unsolvable problem is one for which no algorithm can ever be written to find the solution. An undecidable problem is one for which no algorithm can ever be written that will always give a correct true/false decision for every input value.
Answer:
<u>Solution a</u>
- n = int(input("Enter an integer: "))
-
- sum = 0
-
- for x in range(1, n+1):
- sum += x
-
- print(sum)
<u>Solution b</u>
- n = int(input("Enter an integer: "))
-
- for a in range(1, n + 1):
- sum = 0
- for x in range(1, a+1):
- sum += x
- print(sum)
Explanation:
Solution code is written in Python 3.
<u>Solution a</u>
First get the user input for an integer (Line 1).
Create a variable sum and initialize it with zero value (Line 3).
Create a for loop to traverse through the number from 1 to integer n (inclusive) and sum up the current number x (Line 5-6).
Print the sum to terminal (Line 8).
<u>Solution b</u>
Create an outer for loop that traverse through the number from 1 to integer n (inclusive) (Line 3).
Create an inner loop that traverse through the number from 1 to current a value from the outer loop and sum up the current x value (Line 5-6).
Print the sum to terminal (Line 7) and proceed to next iteration and reset the sum to zero (Line 4).
