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
Enumerate about the concept of container A Container can have a size() operation. We can also ask (somewhat redundantly) whether a Container is empty. And even though a Contain

Explain about Franklin Algorithm We mentioned how the number of possible comparisons of polygons grows as the square of the number of polygons in the scene. Many of the hidden-

Q. Let a binary tree 'T' be in memory. Write a procedure to delete all terminal nodes of the tree.       A n s . fun ction to Delete Terminal Nodes from Binary Tree

Readjusting for tree modification calls for rotations in the binary search tree. Single rotations are possible in the left or right direction for moving a node to the root position

Any Binary search tree has to contain following properties to be called as a red- black tree. 1. Each node of a tree must be either red or black. 2. The root node is always b

Write the algorithm for compound interest

With the help of a program and a numerical example explain the Depth First Traversal of a tree.

Assertions and Abstract Data Types Even though we have defined assertions in terms of programs, notion can be extended to abstract data types (which are mathematical entities).

Deletion Algorithm for dequeue Step 1: [check for underflow]   If front = 0 and rear = 0   Output "underflow" and return Step 2: [delete element at front end]   If front

* Initialise d & pi* for each vertex v within V( g ) g.d[v] := infinity  g.pi[v] := nil g.d[s] := 0; * Set S to empty * S := { 0 }  Q := V(g) * While (V-S)