Functions and modelling the data flows, Data Structure & Algorithms

Read the scenario (Pickerings Properties).

(a) List the functions of the system, as perceived by an external user.

(b) List the external entities. Note that because we are modelling the data flows, not use cases, the external entities should be the actual sources and sinks of data rather than the persons keying in the data.

(c) Produce a context (or level 0) data flow diagram using the method described in the unit materials.

 

Posted Date: 3/4/2013 7:56:39 AM | Location : United States







Related Discussions:- Functions and modelling the data flows, Assignment Help, Ask Question on Functions and modelling the data flows, Get Answer, Expert's Help, Functions and modelling the data flows Discussions

Write discussion on Functions and modelling the data flows
Your posts are moderated
Related Questions
Compare zero-address, one-address, two-address, and three-address machines by writing programs to compute: Y = (A – B X C) / (D + E X F) for each of the four machines. The inst

What is called the basic operation of an algorithm? The most significant operation of the algorithm is the operation contributing the most to the total running time is known as

Q. Write down an algorithm to delete the specific node from binary search tree. Trace the algorithm to delete a node (10) from the following given tree. Ans. Algor

Determine the Components of Illumination The light reaching the eye when looking at a surface has clearly come from a source (or sources) of illumination and bounced off the su

Develop a program that accepts the car registration( hint: LEA 43242010)

solve the following relation by recursive method: T(n)=2T(n^1/2)+log n

Q. Write down an algorithm to add an element in the end of the circular linked list.        A n s . Algo rithm to Add the Element at the End of Circular Linked Lists

In what ways we can get the context sensitive F1 help on a field?' Data element documentation. Data element additional text in screen painter. Using the process on help r

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

how to define the size of array