Answer:
Following are the program in the C++ Programming Language:
#include <iostream>//header file
using namespace std;//namespane
//set main method
int main() {
int a[100]; //set integer type array variable
int value, i = 0; //set integer variables
cout<<"Enter less than 0 to exit:"<<endl; //message for exit
cout<<"Enter the integer numbers:"<<endl; //message to enter numbers
do{ //set do while
cin>>value; //get input from the user
a[i++] = value; //append elements in array
}while(value>=0);
i--;
cout<<"\nArray are:"<<endl;//message for array
for(int k = 0;k<i;k++){ //set for loop
cout<<a[k]<<" "; //print array
}
return 0;
}
<u>Output</u>:
Enter less than 0 to exit:
Enter the integer numbers:
1
2
3
4
5
-1
Array are:
1 2 3 4 5
Explanation:
Here, we set the integer data type main method "main()" and inside it:
- we set integer type array variable with index value 100.
- we set two integer type variable "value" and "i" initialize value 0.
- we set the do-while loop in which we get the input from the user and and append in the array and pass condition if the value is greater then equal to 0.
- Finally, set for loop and print the elements of an array.
Answer:
False
Explanation:
In our current market, we can find some messaging apps and social media designed for corporation organization setting. One example of messaging apps widely used in corporate world is Slack. The Slack enable user to set up different communication channel with their colleagues and flexibly set their working status.
FB also releases a corporate version of social media which is Workplace. The main attracting point is the contents are ad-free and you can expect to see company update or department news from the nesfeed.
Spam refers to large unsolicited email irregardless of the recipients views on the matter
Answer: True
Explanation:
Subset sum problem and Knapsack problem can be solved using dynamic programming.
In case of Knapsack problem there is a set of weights associative with objects and a set of profits associated with each object and a total capacity of knapsack let say C. With the help of dynamic programming we try to include object's weight such that total profit is maximized without fragmenting any weight of objects and without exceeding the capacity of knapsack, it is also called as 0/1 knapsack problem.
Similar to knapsack problem, in subset sum problem there is set of items and a set of weights associated with the items and a capacity let say C, task is to choose the subset of items such that total sum of weights associated with items of subset is maximized without exceeding the total capacity.
On the basis of above statements we can say that subset sum problem is generalization of knapsack problem.
