Information about Data Flow Diagram

Data Flow Diagram

• Definition

   A data flow diagram (DFD) is a graphical representation of the "flow" of data through an information system, modelling its process aspects. A DFD is often used as a preliminary step to create an overview of the system, which can later be elaborated.
  
  
  A DFD shows what kind of information will be input to and output from the system, where the data will come from and go to, and where the data will be stored. It does not show information about the timing of process or information about whether processes will operate in sequence or in parallel(which is shown on a flowchart).
  
  
  
   
  Data flow diagrams are also known as bubble charts.DFD is a designing tool used in the top-down approach to Systems Design.Data flow diagrams can be used in both Analysis and Design phase of the SDLC.There are different notations to draw data flow diagrams (Yourdon & Coad and Gane & Sarson^[6]), defining different visual representations for processes, data stores, data flow, and external entities.
  
  

  External Entity 

  An external entity can represent a human, system or subsystem. It is where certain data comes from or goes to. It is external to the system we study, in terms of the business process. For this reason, people used to draw external entities on the edge of a diagram.

  

  Process

  A process is a business activity or function where the manipulation and transformation of data takes place. A process can be decomposed to finer level of details, for representing how data is being processed within the process. 

   

  

  
  

  Data Store

  A data store represents the storage of persistent data required and/or produced by the process. Here are some examples of data stores: membership forms, database table, etc.
  
  
  
    

  Data Flow

  A data flow represents the flow of information, with its direction represented by an arrow head that shows at the end(s) of flow connector. 
  
  
  
  
  
    

    The DFD may be used for any level of data abstraction. DFD can be partitioned into levels.              Each  level has more information flow and data functional details than the previous level.

   Highest level is Context Diagram. Some important points are:

•  1 bubble (process) represents the entire system.
•  Data arrows show input and output.
•  Data Stores NOT shown. They are within the system.

   

Next Level is Level 0 DFD. Some important points are:

• Level 0 DFD must balance with the context diagram it describes.
• Input going into a process are different from outputs leaving the process.
• Data stores are first shown at this level.

 

Next level is Level 1 DFD. Some important points are:

• Level 1 DFD must balance with the Level 0 it describes.
• Input going into a process are different from outputs leaving the process.
• Continue to show data stores.

A DFD may look similar to a flow chart. However, there is a significant difference with the data flow diagram. The arrows in DFDs show that there is a flow of data between the two components and not that the component is sending the data that must be executed in the following component. A component in DFD may not continue execution when sending data and during execution of the component receiving the data. The component sending data can send multiple sets of data along several connections. In fact, a DFD node can be a component that never ends.

Basic knowledge about C language

What Is C?

C could be a programming language. The C language was 1st developed in 1972 by Dennis Ritchie at AT & T Bell Labs. Ritchie known as his newly developed language C merely because there was a B programming language already.
C could be a high-level programming language. In fact, C is one in every of the foremost common general purpose programming languages.
In the pc world, the any a programming language is from the pc design, the higher the language’s level. you’ll be able to imagine that the lowest-level languages are machine languages that computers perceive and execute directly. The high-level programming languages, on the opposite hand, are nearer to our human languages
High-level programming languages, together with C, have the subsequent advantages:

• Readability: Programs are simple to scan.
• Maintainability: Programs are simple to take care of.
• Portability: Programs are simple to port across completely different pc platforms.

The C language’s readability and maintainability profit directly from its relative close to human languages, particularly English. Each high-level language desires a compiler or an interpreter to translate directions written within the high-level programming language into a machine language that a pc can perceive and execute. machines may have different compilers or interpreters for constant programming language. for example, i exploit Microsoft’s C compiler to compile the C programs during this book for my notebook computer (PC). If I want to run the C programs on a UNIX-based workstation, I actually have to use another form of C compiler to compile these programs. Therefore, the portability of programs written in C is realized by re-compiling the programs with completely different compilers for various machines