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
Do you have a library solution for this problem?

what is alphanumerical code

Which are the two standard ways of traversing a graph? i. The depth-first traversal   ii. The breadth-first traversal

Searching is the procedure of looking for something. Searching a list containing 100000 elements is not the similar as searching a list containing 10 elements. We discussed two sea

The Euclidean algorithm is an algorithm to decide the greatest common divisor of two positive integers. The greatest common divisor of N and M, in short GCD(M,N), is the largest in

Q. Describe the representations of graph. Represent the graph which is given to us using any two methods Ans: The different ways by which we can represent graphs are:

what is folding method?


Multidimensional array: Multidimensional arrays can be defined as "arrays of arrays". For example, a bidimensional array can be imagined as a bidimensional table made of elements,

A Sort which relatively passes by a list to exchange the first element with any element less than it and then repeats with a new first element is called as      Quick sort.