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

Ask an Expert

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

Write your message here..

Related Questions

Comparisons between linear and binary search, Comparative Study of Linear a... Comparative Study of Linear and Binary Search Binary search is lots quicker than linear search. Some comparisons are following: NUMBER OF ARRAY ELEMENTS EXAMINED array

Representation of sets?, A set s is conveniently shown in a computer store ... 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

Sorting, Retrieval of information is made simpler when it is stored into so... Retrieval of information is made simpler when it is stored into some predefined order. Therefore, Sorting is a very important computer application activity. Several sorting algorit

What is binary search, What is binary search?   Binary search is most ... What is binary search?   Binary search is most useful when list is sorted. In binary search, element present in middle of the list is determined. If key (the number to search)

Explain thread, Thread By changing the NULL lines in a binary tree to ... Thread By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using either a stack

Define stack lifo, A stack is a last in, first out (LIFO) abstract data typ... A stack is a last in, first out (LIFO) abstract data type and sequential data structure. A stack may have any abstract data type as a component, but is characterized by two fundame

Flow chart, What is tha flow chart of algorithm What is tha flow chart of algorithm

Binary search tree in ascending order, In order to get the contents of a Bi... In order to get the contents of a Binary search tree in ascending order, one has to traverse it in In-order

Splaying algorithm, Insertion & deletion of target key requires splaying of... Insertion & deletion of target key requires splaying of the tree. In case of insertion, the tree is splayed to find the target. If, target key is found out, then we have a duplicat

Diophantine Equations, Implement algorithm to solve 5-1 fifth order equati... Implement algorithm to solve 5-1 fifth order equation given.