Answer:
#include <iostream>
using namespace std;
int main() {
int n;
cout<<"Enter any number between 1 to 10000 to generate their Multiplication table"<<endl;//menu
cin>>n;//taking input..
for(int i=1;i<=10;i++)//looping from 1 to 10.
{
cout<<n<<" x "<<i<<" = "<<n*i<<endl;//printing the table..
}
return 0;
}
Output:
Enter any number between 1 to 1000 to generate their Multiplication table
545
545 x 1 = 545
545 x 2 = 1090
545 x 3 = 1635
545 x 4 = 2180
545 x 5 = 2725
545 x 6 = 3270
545 x 7 = 3815
545 x 8 = 4360
545 x 9 = 4905
545 x 10 = 5450
Explanation:
I have taken an integer n for taking input.Then i have looped from 1 to 10 and generating the table and printing it not storing it in the array.Just using loop.
Answer:
They make it easy to quickly see relationships between ideas.
Explanation:
A concept is an idea or a principle that could be used to understand an abstract notion. A conceptual note is one that makes the relationship between ideas easily discernible.
Without breaking much sweat or reading too deeply, the reader would find it easier to easily determine the relationship between ideas and how they relate to the subject matter. Conceptual notes can be taken on a laptop or paper.
Answer:
Option a is the correct answer.
Explanation:
- The information overflow is a state where the coming information will be more in comparison with processing information.
- For example, if there is limited space and any user has more luggage to keep on that space, then we can say that the luggage is overflow.
- So when the information is more and the processing capacity is less then we can say it information overflow condition and it is also asked by the above question. Hence option a is the correct answer.
- While the other is not because:- option b, c and d states some information statements which do not come in any information condition.
Answer:
move 3 right down 1 3 to the left. down 2 2 to the right up one. 1 to the left one up 2 to the right and 2 down and your at the end without going back hope this helps
Explanation: