1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Alexeev081 [22]
3 years ago
12

Design a database to keep data about college students, their academic advisors, the clubs they belong to, the moderators of the

clubs, and the activities that the clubs sponsor. Assume each student is assigned to one academic advisor, but an advisor counsels many students. Advisors do not have to be faculty members. Each student can belong to any number of clubs, and the clubs can sponsor any number of activities. The club must have some student members in order to exist. Each activity is sponsored by exactly one club, but there might be several activities scheduled for one day. Each club has one moderator, who might or might not be a faculty member. Draw a complete E-R diagram for this Database.
(a) All entities with their attributes must be represented, indicating all candidate keys. You must indicate and justify all assumptions you have made.

(b) Describe non-trivial domains for attributes where needed.

(c) Make a decision about the cardinality and participation constraints of all relationships, and add appropriate symbols to the E-R diagram.

Computers and Technology
2 answers:
alekssr [168]3 years ago
8 0

Answer:

Complete design is attached below.please have a look.

Explanation:

dimaraw [331]3 years ago
4 0

Answer:

This is a typical example of a constraint max/min. The method used to solve this problem is called

the method of Lagrange multipliers. Let’s generalize the situation:

Given: A function: f(x, y, z) and a constraint that we can write as g(x, y, z) = 0.

Goal: Find min or max of f(x, y, z) for (x, y, z) satisfying g(x, y, z) = 0.

To have a “visual grasp” for the concept of Lagrange multipliers one can think about the following

problem:

Take a balloon (here approximated by a perfect sphere centered at the origin) and a box (think of

a cube for example). We want to find the maximum radius of the balloon (this is the function to

maximize) that can fit inside the box (this is the constraint). We start inflating the balloon and we

realize that the maximum radius is obtained when the balloon touches the box. At the touching

point(s) the surface of the balloon and the one of the box are tangent to each other!

This simple experiment is not a special case. In fact in general1

if P0 = (x0, y0, z0) is a point sitting

on the level surface given by the constraint where max/min for f occur, then at this point the level

surface of the constraint is tangent to the level surface of f passing through P0:

If the two surfaces are tangent, then all normal vectors to the two surfaces are parallel to each other.

In particular their gradients at P0 are parallel, that is

O~ f(P0) = λO~ g(P0) (3.1)

for some parameter λ. This parameter is called the Lagrange multiplier.

We discovered that the max/min points for a function f(x, y, z) constraint by g(x, y, z) = 0 are

found among the solutions (x, y, z, λ) for the system

O~ f(x, y, z) − λO~ g(x, y, z) = 0

g(x, y, z) = 0.

Notice that this system contains four equations and four unknowns:

∂

∂x

f(x, y, z) − λ

∂

∂x

g(x, y, z) = 0

∂

∂y

f(x, y, z) − λ

∂

∂y

g(x, y, z) = 0

∂

∂z

f(x, y, z) − λ

∂

∂z

g(x, y, z) = 0

g(x, y, z) = 0.

(3.2)

but in general it is not a linear system!

One can present the method of Lagrange Multipliers in a more efficient (but less illuminating) way.

Define in fact the new function

L(x, y, z, λ) = f(x, y, z) − λg(x, y, z).

The critical points of L solve the vector equation

O~ L(x, y, z, λ) = 0.

But remember that now the variables are (x, y, z, λ) so we need to take four partial derivatives for

L. If one does so then again (3.2) is obtained!

You might be interested in
I'm gonna get grounded for getting a 52 on my test :(
Alla [95]

Answer:

well thats not good

Explanation:

5 0
3 years ago
Finish the format string to get the output shown below.<br> Day<br> &gt;&gt;&gt;{ v8'_format('Day)
Lorico [155]

In C language, a Format string refers to a string utilized to format output or input. The complete format string is: >>>{% v8'_format('Day)

<h3>What is Format String?</h3>

In computer programming, a format string is a string that is used when formatting the input and output of functions.

It is responsible for the format of the input and output. In C language, it always starts with '%'.

Hence the completed format string will be: >>>{% v8'_format('Day).

Learn more about format strings ta:
brainly.com/question/26000102
#SPJ1

Learn more about Format String at:
brainly.com/question/26000102
#SPJ1

8 0
2 years ago
Write a program that reads numbers from a file (or allow user to input data) and creates an ordered binary tree. The program sho
IgorLugansk [536]

Answer:

See explaination

Explanation:

include<bits/stdc++.h>

using namespace std;

typedef struct Node

{

int data;

struct Node *left,*right;

}Node;

bool search(Node *root,int data)

{

if(root==NULL)

return false;

if(root->data==data)

return true;

queue<Node*> q;

q.push(root);

while(!q.empty())

{

Node *temp=q.front();

q.pop();

if(temp->data==data)

return true;

if(temp->left)

q.push(temp->left);

if(temp->right)

q.push(temp->right);

}

return false;

}

Node *insert(Node *root,int data)

{

if(root==NULL)

{

Node *temp=new Node();

temp->data=data;

temp->left=NULL;

temp->right=NULL;

return temp;

}

if(data < root->data)

root->left=insert(root->left,data);

if(data>root->data)

root->right=insert(root->right,data);

return root;

}

Node *get_smallest_element_right_subtree(Node *root)

{

while(root && root->left!=NULL)

root=root->left;

return root;

}

Node *delete_node(Node *root,int data)

{

if(root==NULL)

return root;

if(data < root->data)

root->left=delete_node(root->left,data);

else if(data > root->data)

root->right=delete_node(root->right,data);

else

{

if(root->left==NULL) //If right only presents means - delete the curr node and return right node

{

Node *temp=root->right;

free(root);

return temp;

}

else if(root->right==NULL) //If left only presents means - delete the curr node and return let node

{

Node *temp=root->left;

free(root);

return temp;

}

else

{

Node *temp=get_smallest_element_right_subtree(root->right);

root->data=temp->data;

root->right=delete_node(root->right,temp->data);

}

return root;

}

}

void inorder(Node *root)

{

if(root!=NULL)

{

inorder(root->left);

cout<<root->data<<" ";

inorder(root->right);

}

}

void postorder(Node *root)

{

if(root!=NULL)

{

inorder(root->left);

inorder(root->right);

cout<<root->data<<" ";

}

}

void preorder(Node *root)

{

if(root!=NULL)

{

cout<<root->data<<" ";

inorder(root->left);

inorder(root->right);

}

}

int main()

{

fstream f;

string filename;

cout<<"\n\n1 - Input through File ";

cout<<"\n\n2 - Input through your Hand";

int h;

cout<<"\n\n\nEnter Your Choice : ";

cin>>h;

Node *root=NULL; // Tree Declaration

if(h==1)

{

cout<<"\n\nEnter the Input File Name : ";

cin>>filename;

f.open(filename.c_str());

if(!f)

cout<<"\n\nError in Opening a file !";

else

{

cout<<"\n\nFile is Being Read ........";

string num;

int value;

int node=0;

while(f>> num)

{

value=stoi(num);

root=insert(root,value);

node++;

}

cout<<"\n\nTree has been successfully created with : "<<node<<" Nodes"<<endl;

}

}

if(h==2)

{

int y;

cout<<"\n\nEnter the Total No of Input :";

cin>>y;

int i=1,g;

while(i!=y+1)

{

cout<<"\n\nEnter Input "<<i<<" : ";

cin>>g;

root=insert(root,g);

i++;

}

cout<<"\n\nTree has been successfully created with : "<<y<<" Nodes"<<endl;

}

if(h>=3)

{

cout<<"\n\nInvalid Choice !!! ";

return 0;

}

int n=0;

while(n!=6)

{

cout<<"\n\n\n1 - Insert Element";

cout<<"\n\n2 - Remove Element";

cout<<"\n\n3 - Inorder (LNR) Display ";

cout<<"\n\n4 - Pre (NLR) Order Display";

cout<<"\n\n5 - Post (LRN) Order Display";

cout<<"\n\n6 - Quit";

cout<<"\n\nEnter Your Choice : ";

cin>>n;

switch(n)

{

case 1:

{

int k;

cout<<"\n\nEnter Element to insert : ";cin>>k;

root=insert(root,k);

cout<<"\n\nElement Sucessfully Inserted !!!!!";

break;

}

case 2:

{

int k;

cout<<"\n\nEnter Element to Remove : ";

cin>>k;

if(search(root,k))

{

root=delete_node(root,k);

cout<<"\n\nValue Successfully Deleted !!!";

}

else

cout<<"\n\n!!!!!!!!!!!!!!!!!!!! No Such Element !!!!!!!!!!!!!!!!!!!!!!";

break;

}

case 3:

{

cout<<"\n\nThe Elements (LNR) are : ";

inorder(root);

break;

}

case 4:

{

cout<<"\n\nThe Elements (NLR) are : ";

preorder(root);

break;

}

case 5:

{

cout<<"\n\nThe Elements (LRN) are : ";

postorder(root);

break;

}

case 6:

{

break;

}

}

}

cout<<"\n\nBye!!!! See You !!!"<<endl;

7 0
4 years ago
Which of the following formats can algorithms NOT be written in:
umka2103 [35]
Hello there.

Which of the following formats can algorithms NOT be written in:

Answers: Flow Chart 
5 0
2 years ago
Read 2 more answers
a(n) ___ loop allows you to cycle through an array without specifying the starting and ending points for the loop
Arte-miy333 [17]

Answer:

enhanced for loop

Explanation:

Enhanced for loop is an improve concept about loops, this features was implemented in Java SE 5.0 version, this method simplify the For structure. For example:

for (int i = 0; i <array.length; i ++) {  

   System.out.print (array [i]);  

}

Enhanced for loop

for (String element : array) {

   System.out.print(element);

}

8 0
3 years ago
Other questions:
  • The IP address 129.53.82.20 falls under what class of IP addresses??
    5·2 answers
  • What effect can camera tilt create? Do you think this is effective? Why or why not?
    13·1 answer
  • Write a Python program to do the following: (a)Use a for loop and a random integer generator to generate 5 random integers in 1
    10·1 answer
  • An IT company revises its process parameters in response to complaints from vendors that products were not ready on time. This w
    15·1 answer
  • One lap around a standard high-school running track is exactly 0.25 miles. Write the function miles_to_laps() that takes a numbe
    8·1 answer
  • What would happen if computers only had input devices?
    9·1 answer
  • Cuáles eran las condiciones de vida de las mujeres durante el renacimiento perduran​
    14·1 answer
  • Activity 1.1.4 What is Technology?
    10·1 answer
  • Suppose we used an internet addressing protocol that used 4 bits to encode a single address. How many devices would be supported
    15·1 answer
  • What is pseudocode? O A way of describing a set of instructions in text form using plain english O A diagrammatic representation
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!