W11MGT475Program1(1) - H. Klein MGT475 Program (?) 1:...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
H. Klein MGT475 Program (?) 1: Create Tables Create a table or tables that can hold the information we need to solve Will Shortz’s city problem as discussed in class and as described at: http://www.npr.org/2010/12/19/132170541/a-cut-above-average under Next Week’s Challenge. It was summarized on this website as follows: “Name a city in the United States that ends in the letter S. The city is one of the largest cities in its state. Change the S to a different letter and rearrange the result to get the state the city is in. What are the city and state?” The first order of business here is to normalize the data and design/create the tables that result. We will do the normalization in class. You must then create the resulting tables. You will end up having to create two tables, one a state table and one a city table. There is a foreign key relationship between these two tables that you must create After creating both tables, their primary keys, data elements, domains and foreign key relationships, Add data to the tables. Each of you will be responsible to add several states and their corresponding cites to your tables. Here is the breakdown of the states you must each add:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/05/2011 for the course MGT 475 taught by Professor Klein during the Winter '11 term at Grand Valley State University.

Page1 / 2

W11MGT475Program1(1) - H. Klein MGT475 Program (?) 1:...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online