Question:

Defining a direction for your database and describing how it will be used is a great first step, and this what you accomplished for Iteration 1, but this is just the beginning of the process. Your goal is a live database that supports the organization or application that uses it; several more components need to be created to make this happen. You will create two such components in this iteration.

Your next step is to design your database at a higher level more formally. Structural database rules are a great place to start, a useful tool to frame and guide your design. Structural database rules are written carefully to ensure that they define specific components and constraints for your database. You create these for your database in this iteration, then create entity?relationship diagram (ERD), a universally accepted method of visualizing database schemas. With your structural database rules and ERD, you can articulate and visualize the data and relationships that exist in your mind for your database. Structural database rules and ERDs are the foundation of your database design.

Project Direction Overview

Update the overview that describes who the database will be for, what kind of data it will contain, how you envision it will be used, and most importantly, why you are interested in it.

Use Cases and Fields

Update the five or more use cases that enumerate steps of how the database will be typically used and identify significant database fields needed to support each use case.

Structural Database Rules

Replace this with a list of structural database rules for all significant entities and relationships, with the constraints defined, based upon the use cases you defined, along with supporting explanations.

Conceptual Entity-Relationship Diagram

Replace this with an initial conceptual ERD that visualizes the structural database rules, along with supporting explanations.

Consider the following Markov chain with the following transition diagram on states {1, 2, 3} al- 2 CO 173 3 (a) Is this Markov chain irreducible? [1 marks] (b) Find the probability of the Markov chain to move to state 3 after two time steps, providing it starts in state 2. [3 marks]ECON20110/ECON30370 1. Consider the regression model: y = Xf u (a) State the Gauss-Markov assumptions required to show that the Ordinary Least Squares estimator of the coefficients is the Best Linear Unbiased Estimator (BLUE) [5 marks] [b) Prove that the OLS estimator is unbiased if the Gauss-Markov assumptions hold Show relevant steps and assumptions [10 marks] (c) Show that the variance covariance matrix of the OLS estimator is Var (8 X) -6-(XX) [5 marks]. Consider a zero-mean WSS complex Gauss-Markov process of order 1 defined by the following equation r =-ar _tv, n=0,1,.... where v ~ /(0, o') and Ela, v* ] = 0 for 1 = +1, 12, .... Multiply both sides by * and take expectation values to find Er, *]. Note that E[rv*] = Ex*v,]. Multiply both sides by r* and take expectation values to show R., [0] = -aR_ [-1] + 0) = -aR* [1]+02. This process is also known as the auto-regressive process of order 1 and is denoted by AR(1). . Now multiply both sides by e* , I = 1, 2...., and take expec- tation values to show R, [!] = -aR,, [[ - 1], 1 =1, 2. .... This result, for a Gauss-Markov process of order P, or an AR(P) process. forms the basis for high resolution spectral estimation of zero-mean WSS random signals.Question 7 Each of the probability distributions listed in the options below is the offspring distribution for a Galton- Watson branching process. Select the THREE options that give distributions for which eventual extinction of the branching process is possible but not certain. Select one or more: Poisson(1.7) D GI() O B(8, 0.125) B(6, 0.2) O Modified geometric with parameters a = 6, b = 2, c = 9 and d = 5 O Negative binomial with range {0,1,...} and parameters r = 5 and p = 0.2