Ask question

Ask question

All categories

3 years ago

9

Describe how you would define the relation Brother-in-Law whose tuples have the form (x, y) with x being the brother-in-law of y

. b. Give appropriate relational algebra and SQL expressions that return the relation Brother-in-Law.

Computers and Technology

1 answer:

damaskus [11]3 years ago

8 0

Answer:

The expression is :

π[cd) + π(g,h) ],[π(e,f)+π(a,b)])

We will use foreign key and primary key

You might be interested in

Placeholders can hold text but not graphics such as photos or charts. True or false?

sasho [114]

False. a placeholder can hold everything

6 0

3 years ago

In Tynker, it is not possible to create a/an __________.

xz_007 [3.2K]

Answer:

yes

Explanation:

7 0

2 years ago

Read 2 more answers

Write a method called all Less that accepts two arrays of integers and returns true if each element in the first array is less t

GaryK [48]

Answer:

The program to this question can be given as:

Program:

#include<iostream> //header file

using namespace std; //using name space

bool allLess (int arr1[], int arr2[]) //defining method allLess

{

int a,b; //define variable

a= *(&arr1 + 1) - arr1; //hold length of arr1

b= *(&arr2 + 1) - arr2; //hold length of arr2

if(a!=b) //checking condition

{

return 1; //return value

}

for(int i=0; i<a; i++) //loop

{

if( arr1[i]>=arr2[i]) //checking condition

{

return 1; //return value

}

}

return 0; //return value

}

int main() //define main method.

{

int arr1[]={1,2,3,4,5}; //define array arr1 and assign value.

int arr2[]={4,5,6,7,8}; //define array arr2 and assign value.

cout<< allLess(arr1,arr2); //function calling

return 0;

}

Output:

1

Explanation:

The Explanation of the C++ language program can be given as follows:

In the above program firstly we include the header file. Then a method is defined that is "allLess" this method accepts two arrays that are "arr1 and arr2". This function returns a boolean value that is true or false.
Inside a function, we define a conditional statement and a loop in the if block we check the length of the arr1 array variable is not equal to arr2 array length. if this condition is true it will return false.
In the loop, we define another if block in this block we check that if arr1 array elements are grater then equal to arr2 array element if this condition is true it will return false. At the end of both if block and loop the function will return a value that is "true".
In the main method, we define two arrays and pass to the function and use (cout function) for print return value.

8 0

3 years ago

Which of the following is not a good technique for photographing groups? Visiting the location.

algol13

I think it's wait until you get started to decide on the props and camera settings...

4 0

3 years ago

The remove() method in the Queue interface ________. Group of answer choices retrieves, but does not remove, the head of this qu

salantis [7]

<h2>Question:</h2>

The remove() method in the Queue interface ________.

A. retrieves, but does not remove, the head of this queue, returning null if this queue is empty

B. retrieves and removes the head of this queue, or null if this queue is empty

C. retrieves, but does not remove, the head of this queue, throwing an exception if this queue is empty

D. retrieves and removes the head of this queue and throws an exception if this queue is empty

<h2>Answer:</h2>

D. retrieves and removes the head of this queue and throws an exception if this queue is empty

<h2>Explanation:</h2>

In Java, the Queue interface is found in the java.util package and inherits from the Collection interface. It is used to store elements which are processed in the order in which they are inserted. This means that the first element will be processed first.

The Queue interface has many methods. Some of them are;

i. add(): allows elements to be added to the queue.

ii. remove(): retrieves and removes elements from the head of the queue. The head of the queue points to the first element of the queue. If the queue is empty, the remove() method throws an exception called the <em>NoSuchElementException</em>

<em />

iii. poll(): retrieves and removes the element at the head of the queue. Unlike the remove() method, if the queue is empty, a <em>null </em>is returned.

iv. peek(): retrieves but does not remove the element at the head of the queue. Just like the poll() method, a <em>null</em> is returned if the queue is empty.

7 0

2 years ago