Answer:
Join
Explanation:
Five basic set operators in relational algebra are as follows:
- Selection - tuple selection
- Projection - extract columns
- Cartesian product - cross product of relations
- Set union - union of two relations
- Set difference - minus operation on two relations
As we can see, Join is not part of the basic set operations but it is implemented using the Cartesian Product operator.
Answer:
n! = n*(n-1)*(n-2)*(n-3)* ... *2*1
Explanation:
The factorial operator is simply a mathematical expression of the product of a stated integer and all integers below that number down to 1. Consider these following examples:
4! = 4 * 3 * 2 * 1
4! = 12 * 2 * 1
4! = 24
6! = 6 * 5 * 4 * 3 * 2 * 1
6! = 30 * 4 * 3 * 2 * 1
6! = 120 * 3 * 2 * 1
6! = 360 * 2 * 1
6! = 720
So, the factorial of n would follow the same as such:
n! = n * (n-1) * (n-2) * ... * 2 * 1
Cheers.
Answer:
of which std this question is
Answer:
hope this helps and do consider giving a brainliest to the ans if it helped.
Explanation:
//program to check if the entered grid is magic square or not
/**c++ standard libraries
*/
#include<bits/stdc++.h>
using namespace std;
/**function to check whether the entered grid is magic square or not
*/
int isMagicSquare(int arr[3][3]){
int i,j,sum=0,sum1=0,rsum,csum;
for(i=0;i<3;i++){
sum+=arr[i][i];
sum1+=arr[i][2-i];
}
if(sum!=sum1){
return 0;
}
for(i=0;i<3;i++){
rsum=0;
csum=0;
for(j=0;j<3;j++){
rsum+=arr[i][j];
csum+=arr[j][i];
}
if(sum!=rsum){
return 0;
}
if(sum!=csum){
return 0;
}
}
return 1;
}
/** main function to get user entries and
* call function
* and print output
*/
int main(){
int i,j,arr[3][3]={0};
for(i=0;i<3;i++){
for(j=0;j<3;j++){
cout<<"Enter the number for row "<<i<<" and column "<<j<<" : ";
cin>>arr[i][j];
}
}
int ret = isMagicSquare(arr);
if(ret==1){
cout<<"This is a Lo Shu magic square"<<endl;
}
else{
cout<<"This is not a Lo Shu magic square"<<endl;
}
return 0;
}