All categories

2 years ago

explain why the database system would not allow a tuple to be inserted into the database through this view

1 answer:

6 0

For the view of Exercise 4.18, explain why the database system would not allow a tuple to be inserted into the database through this view.
For reference
For the database of Figure 4.12, write a query to find the ID of each employee with no manager. Note that an employee may simply have no manager listed or may have a null manager. Write your query using an outer join and then write it again using no outer join at all.
OUTER JOIN
select e.ID from employee e left outer join manages m on e.ID = m.ID
where m.manager_id is null;
NO OUTER
select e.ID from employee e where e.ID not in (select m.ID from manages m) or e.ID in (select m.ID from manages m where m.manager_id is null);

You might be interested in

If one employee is assigned to a project and each project has only one employee working on it, there is a(n) ____ relationship b

Len [333]

Answer:

One-to-one is the answer because there is one project and one employee working on one project.

5 0

3 years ago

Can we change our profile name on here and how

TiliK225 [7]

Only by making a new account

4 0

3 years ago

Read 2 more answers

Using functions,

ZanzabumX [31]

Answer:

See explaination

Explanation:

#include <iostream>

using namespace std;

int main()

{

double h, w;

int s, a, b;

cout<<"height in feet: ";

cin>>h;

cout<<"width in feet: " ;

cin>>w;

cout<<"tile size in inches:";

cin>>s;

int height = h*12;

if(height%s==0)

a = height/s;

else

a = height/s + 1;

int width = w*12;

if(width%s==0)

b = width/s;

else

b = width/s + 1;

cout<<"Number of tiles: "<<a*b;

}

8 0

3 years ago

The CEO of CorpNet.xyz has hired your firm to obtain some passwords for their company. A senior IT network administrator, Oliver

MA_775_DIABLO [31]

Answer:

The olennon account's password: See the attached file for this.

The Administrator account's password: 4Lm87Qde

Explanation:

Note: See the attached excel file for the olennon account's password as I was unable to save it here because I was instead getting the following message:

"Oh no! It seems that your answer contains swearwords. You can't add it!"

The olennon account's password and the Administrator account's password can be found as follows:

To see the rear of the computer, click Back from the menu bar above the computer.

Drag the USB Type A connector for the keyboard from the rear of the computer to another USB port on the machine.

Make sure the keyboard is plugged back in.

Expand System Cases on the shelf.

Add the Laptop to the Workspace by dragging it there.

To see the rear of the laptop, click Back from the menu above the laptop.

Drag the keylogger from the computer to the laptop's USB port.

Select Front from the menu above the laptop to see the front of the laptop.

Select Click to display Windows 10 on the laptop.

Toggle between keylogger and flash drive mode by pressing S + B + K.

To control what occurs with detachable drives, select Tap.

To view files, choose Open folder.

To open the file, double-click LOG.txt.

Select Answer Questions in the top right corner.

Respond to the questions.

Choose Score Lab as the option.

Therefore, we have:

The olennon account's password:

The Administrator account's password: 4Lm87Qde

Download docx

7 0

3 years ago

given an array of integers a, your task is to count the number of pairs i and j (where 0 ≤ i < j < a.length), such that a[

Nimfa-mama [501]

Using the knowledge of computational language in C++ it is possible to write a code that given an array of integers a, your task is to count the number of pairs i and j.

<h3>Writting the code:</h3>

// C++ program for the above approach

#include <bits/stdc++.h>

using namespace std;

// Function to find the count required pairs

void getPairs(int arr[], int N, int K)

{

// Stores count of pairs

int count = 0;

// Traverse the array

for (int i = 0; i < N; i++) {

for (int j = i + 1; j < N; j++) {

// Check if the condition

// is satisfied or not

if (arr[i] > K * arr[j])

count++;

}

cout << count;

}

// Driver Code

int main()

{

int arr[] = { 5, 6, 2, 5 };

int N = sizeof(arr) / sizeof(arr[0]);

int K = 2;

// Function Call

getPairs(arr, N, K);

return 0;

}

See more about C++ code at brainly.com/question/17544466

#SPJ4

4 0

1 year ago