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
write a algorithsm in c to perform push and pop operations stastic implementation using array ?

Define a sparse metrics. A matrix in which number of zero entries are much higher than the number of non zero entries is known as sparse matrix. The natural method of showing m

CMY Model  The cyan, magenta, yellow (CMY) colour model is a subtractive model based on the colour absorption properties of paints and inks. As such it has become the standard

Q. Explain the result of inserting the keys given. F, S, Q, K, C, L, H, T, V, W, M, R, N, P, A, B, X, Y, D, Z, E  in an order to an empty B-tree of degree-3.

Design  and implement  an algorithm  to simulate car  re-organizing of the train at the railway switching junction. You can only use stacks as the data structure to represent the t

Q. Explain the insertion sort with a proper algorithm. What is the complication of insertion sort in the worst case?

Q. Explain Dijkstra's algorithm for finding the shortest path in the graph given to us.  Ans: The Dijkstra's algorithm: This is a problem which is concerned with finding

Q. What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine.    A n

A set s is conveniently shown in a computer store by its characteristic function C(s). This is an array of logical numbers whose ith element has the meaning "i is present in s". As

Q. Implement a stack making use of the linked list. Show the PUSH and POP operations both. A n s . Stack implemantation using linked list # include # include