Category: Databases

i uploaded the rubric and you can see it and do based on what it wants only do Phase 2 and i uploaded phase 1 you can see it and uploaded a sample
please use simple english not advanced

Need to create a project for Database Management Systems direction as per attached file which contains project details and requirements.

I chose to repeat my experience with you because I know I survived with you.
I would like to choose the technique that I will use for research
Then show it to a doctor and get approval
Then send me an outline of your research
Then I measure the extent of his comfort with the doctor
Then you go to work

Complete the database design for Heather Sweeney
–Represent relationships (Recall how to transform 1:1, 1:N, N:M relationship)
–Create associative entities (intersection tables) when necessary （for many-to-many relationship)
–Enforce the referential integrity constraint for each relationship
–Develop an MS-Access Database based on the above transformation practices
Submit the MS-Access Database
– save it as (ABKHeatherSweeney.accdb)
–Your Database should contain your tables and define the relationships

Hey , this is a database project so be aware of any thing that is required in the file and make sure to check the Marking Criteria for the Project so you can follow up the requirements
This project worth 14 marks and will be distributed as in the following:
a) Identify the entity types, attributes, keys. (2 marks)
b) Identify the relationship and cardinalities. (2 marks)
c) Draw the ERD. (2 marks)
d) Schemas before Normalization. (1.5 marks)
e) Schemas after Normalization. (1.5 marks)
f) Create the tables. (1.5 marks)
g) Populate your tables with at least 5 rows. (1.5 marks)
h) Execute the requested sample queries. (2 marks)

Hey , this is a database project so be aware of any thing that is required in the file and make sure to check the Marking Criteria for the Project so you can follow up the requirements
This project worth 14 marks and will be distributed as in the following:
a) Identify the entity types, attributes, keys. (2 marks)
b) Identify the relationship and cardinalities. (2 marks)
c) Draw the ERD. (2 marks)
d) Schemas before Normalization. (1.5 marks)
e) Schemas after Normalization. (1.5 marks)
f) Create the tables. (1.5 marks)
g) Populate your tables with at least 5 rows. (1.5 marks)
h) Execute the requested sample queries. (2 marks)

All questions are written on the attached file.
We are a group of 4 girls
Names:
1- Fai Alshammari
2- Jood alzwuaidi
3- Aeshah alshanqiti
4- Sarah alzayer
Please read the instructions carefully and follow them.
Please don’t use images.
We need the codes (basic) not too much advanced
We need a powerpoint presentation for this project.

Hey , this is a database project so be aware of any thing that is required in the file and make sure to check the Marking Criteria for the Project so you can follow up the requirements
This project worth 14 marks and will be distributed as in the following:
a) Identify the entity types, attributes, keys. (2 marks)
b) Identify the relationship and cardinalities. (2 marks)
c) Draw the ERD. (2 marks)
d) Schemas before Normalization. (1.5 marks)
e) Schemas after Normalization. (1.5 marks)
f) Create the tables. (1.5 marks)
g) Populate your tables with at least 5 rows. (1.5 marks)
h) Execute the requested sample queries. (2 marks)

All questions are written on the attached file.
We are a group of 4 girls
Names:
1- Fai Alshammari
2- Jood alzwuaidi
3- Aeshah alshanqiti
4- Sarah alzayer
Please read the instructions carefully and follow them.
Please don’t use images.
We need the codes (basic) not too much advanced
We need a powerpoint presentation for this project.

# Read the networkg = nx.read_pajek(“karate.paj”)# Get basic information about the networkinfo = nx.info(g)print(info)# Get the number of nodesnum_nodes = nx.number_of_nodes(g)print(num_nodes)# Get the number of edgesnum_edges = nx.number_of_edges(g)print(num_edges)# Check if the graph is directedis_directed = nx.is_directed(g)print(is_directed)
Similarly, we can analyze networks in GraphML format:
# Read the networkg = nx.read_graphml(“wikipedia.graphml”)# Get basic information about the networkinfo = nx.info(g)print(info)# Get the number of nodesnum_nodes = nx.number_of_nodes(g)print(num_nodes)# Get the number of edgesnum_edges = nx.number_of_edges(g)print(num_edges)# Check if the graph is directedis_directed = nx.is_directed(g)print(is_directed)Finally, let’s analyze the network in GEXF format:
# Read the networkg = nx.read_gexf(“network.gexf”)# Get basic information about the networkinfo = nx.info(g)print(info)# Get the number of nodesnum_nodes = nx.number_of_nodes(g)print(num_nodes)# Get the number of edgesnum_edges = nx.number_of_edges(g)print(num_edges)# Check if the graph is directedis_directed = nx.is_directed(g)print(is_directed)Once we have converted the networks into graph objects, we can apply various functions on them and visualize the networks using the networkx package. For example, let’s visualize the karate network:
# Read the networkg = nx.read_gml(“karate.gml”)# Visualize the networknx.draw(g, with_labels=True)plt.show()There is a number of nodes and edges in an undirected graph. To visualize this graph, we can use the function nx.draw() and the parameter plt.show(). This allows us to see the graph and interact with it by moving and zooming. We can also save the figure.
For a directed graph, the arrows represent the edges. We can still zoom and analyze specific parts of the graph.
There are different layouts available in NetworkX, such as circular, spectral, and spring layout. Each layout arranges the nodes and edges in a different way.
We can perform basic analysis on the graph, such as checking the degree distribution. Degree distribution tells us how many nodes have a particular degree. We can plot the degree distribution to get a better understanding of the graph.
In the code, we create a function to plot the degree distribution of the graph. We use NetworkX functions to get the degrees of each node and calculate the unique degrees. Then, we can determine how many nodes have each degree.