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
Declaring a two dimensional array   A two dimensional array is declared same to the way we declare a one-dimensional array except that we state the number of elements in both di

Define the term - Array A fixed length, ordered collection of values of same type stored in contiguous memory locations; collection may be ordered in several dimensions.

Determine in brief the Painter Algorithm a) The farthest polygon, namely the rectangle PQRS, is stored first. (b) The next farthest, the quadrilateral ABCD, is superpo

In any singly linked list, each of the elements contains a pointer to the next element. We have illustrated this before. In single linked list, traversing is probable only in one d

While BFS is applied, the vertices of the graph are divided into two categories. The vertices, that are visited as part of the search & those vertices that are not visited as part

Explain the Memory Function method The Memory Function method seeks to combine strengths of the top  down and bottom-up approaches  to  solving  problems  with  overlapping  su

Ask queConsider the following functional dependencies: Applicant_ID -> Applicant_Name Applicant_ID -> Applicant_Address Position_ID -> Positoin_Title Position_ID -> Date_Position_O

What is a Binary Search Tree (BST)? A binary search tree B is a binary tree every node of which satisfies the three conditions: 1.  The value of the left-subtree of 'x' is le

What is Assertions Introduction At every point in a program, there are generally constraints on the computational state that should hold for program to be correct. For ins

implement multiple stacks ina single dimensional array. write algorithams for various stack operation for them.