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
Implement multiple queues in a single dimensional array. Write algorithms for various queue operations for them.

Z-Buffer Algorithm Also known as the Depth-Buffer algorithm, this image-space method simply selects for  display the polygon or portion of a polygon that is nearest to the view

Encryption the plain-text using the round keys: 1. (Key schedule) Implement an algorithm that will take a 128 bit key and generate the round keys for the AES encryption/decryp

Addition of new records in a Binary tree structure always occurs as leaf nodes, which are further away from the root node making their access slower. If this new record is to be ac

i need help in java recursion assignment.

algorithm for multiplication of two sparse matrices using link list

The data structure needed for Breadth First Traversal on a graph is Queue

Define the term counting - Pseudocode Counting in 1s is quite simple; use of statement count = count + 1 would enable counting to be done (for example in controlling a repeat

Explain Dijkstra's algorithm Dijkstra's algorithm: This problem is concerned with finding the least cost path from an originating node in a weighted graph to a destination node

The two famous methods for traversing are:- a) Depth first traversal b) Breadth first