Entity relationship diagram, Data Structure & Algorithms

This question is based on the requirements of a system to record band bookings at gigs. (A 'gig' is an event at which one or more bands are booked to play). You do not need to know about the full system and you should base your answer to this question on the following extract of the design.

Part of the design of the static data is represented by the following entity relationship diagram.

1004_performance.png

The main attributes of these entities are:

87_Band.png

When a booking is made for a gig, the band and the gig need to be identified, and input provided for the length of the spot, and whether the band uses its own sound system. Where the band uses its own sound system the Tech_Phone value should be printed to the screen.

Posted Date: 3/4/2013 8:04:14 AM | Location : United States







Related Discussions:- Entity relationship diagram, Assignment Help, Ask Question on Entity relationship diagram, Get Answer, Expert's Help, Entity relationship diagram Discussions

Write discussion on Entity relationship diagram
Your posts are moderated
Related Questions
Create main method or a test class that creates 2 Element objects that are neighbours of each other, the first element temperature set at 100, the 2nd at 0 and use an appropriate h

Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr

how we can convert a graph into tree

Prim's algorithm employs the concept of sets. Rather than processing the graph by sorted order of edges, this algorithm processes the edges within the graph randomly by building up

For the Oscillating sort to be applied, it is necessary for the tapes to be readable in both directions and able to be quickly reversed. The oscillating sort is superior to the po

This section prescribes additional exercise with the recursive and iterative handling of a binary search tree. Adding to the Binary Search Tree Recursively Add implementation

The number of interchanges needed to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is 5

You are given two jugs, a 4-gallon one and a 3-gallon one. Neither has any measuring marker on it. There is a tap that can be used to fill the jugs with water. How can you get exac

Let us assume a file of 5 records that means n = 5 And k is a sorted array of keys of those 5 records. Let key = 55, low = 0, high = 4 Iteration 1: mid = (0+4)/2 = 2