Integration Testing and its types

Integration Testing:
After completion of dependent programs development & Unit
testing, the programmers interconnect them. Then the programmers verify the
interconnection of the programs in any one of the below four ways.
1. Top-Down Approach
2. Bottom-Up Approach
3. Hybrid Approach
4. System Approach
1.Top-Down Approach:
The interconnection of the main program & some sub-programs is called
the Top-Down Approach. Programmers use temporary programs called stubs
instead of sub-programs, which are under construction. The other name for stubs
is Called Programs. A stub returns the control to the main program.



* In this Approach first Parent Modules are developed
* After that Child Modules are developed
* Then interconnect Parent & Child Modules.

* In the interconnection process is there any the sub-module is under construction
then the developers create temporary program Instead of sub modules that is called
Stub.
2.Bottom  Up Approach:
The interconnection of internal sub-programs without using main
programs is called the bottom up approach. In this approach, programmers use a
temporary program instead of main program, which is under construction. The
temporary program is called Driver or Calling Program.



*In this approach first Child Modules are developed.
* After that parent modules are developed
* Then interconnect Child Modules with Parent Modules.
* In the interconnection Process is there any main module is under construction
then the developers create temporary program that is called 􀂳Driver􀂴.


3.Hybrid Approach:
Also known as Sandwich approach, this is a combination of the Process
Top-Down Approach & Bottom-Up Approaches.




4.System Approach:
It is also known as Big Bang Approach. From this approach, the
programmers interconnect programs after completion of all programs
development & unit Testing.
Build:
A finally integrated set of all programs is called a Build or AUT
(Application Under Testing).


Comments

Post a Comment

Popular posts from this blog

Handling of Skew

Handling of Skew ô€‚„ The distribution of tuples to disks may be skewed — that is, some disks have many tuples, while others may have fewer tuples. ô€‚„ Types of skew: ô€ƒŒ Attribute-value skew. ô€‚¾ Some values appear in the partitioning attributes of many tuples; all the tuples with the same value for the partitioning attribute end up in the same partition. ô€‚¾ Can occur with range-partitioning and hash-partitioning. ô€ƒŒ Partition skew. ô€‚¾ With range-partitioning, badly chosen partition vector may assign too many tuples to some partitions and too few to others. ô€‚¾ Less likely with hash-partitioning if a good hash-function is chosen. Handling Skew in Range-Partitioning ô€‚„ To create a balanced partitioning vector (assuming partitioning attribute forms a key of the relation): ô€ƒŒ Sort the relation on the partitioning attribute. ô€ƒŒ Construct the partition vector by scanning the relation in sorted order as follows. ô€‚¾ After every 1/nth of the relation has been read, the value...
Read more

Fragment-and-Replicate Join

Fragment-and-Replicate Join ô€‚„ Partitioning not possible for some join conditions ô€ƒŒ e.g., non-equijoin conditions, such as r.A > s.B. ô€‚„ For joins were partitioning is not applicable, parallelization can be accomplished by fragment and replicate technique ô€ƒŒ Depicted on next slide ô€‚„ Special case – asymmetric fragment-and-replicate: ô€ƒŒ One of the relations, say r, is partitioned; any partitioning technique can be used. ô€ƒŒ The other relation, s, is replicated across all the processors. ô€ƒŒ Processor Pi then locally computes the join of ri with all of s using any join technique. ô€‚„ General case: reduces the sizes of the relations at each processor. ô€ƒŒ r is partitioned into n partitions,r0, r1, ..., r n-1;s is partitioned into m partitions, s0, s1, ..., sm-1. ô€ƒŒ Any partitioning technique may be used. ô€ƒŒ There must be at least m * n processors. ô€ƒŒ Label the processors as ô€ƒŒ P0,0, P0,1, ..., P0,m-1, P1,0, ..., Pn-1m-1. ô€ƒŒ Pi,j computes the join of ri with sj. In ...
Read more

USER INTERFACE DESIGN FOR ANNA UNIVERSITY SYLLABUS

Unit – I Introduction Objective To Understand the definition and importance of User Interface Design To know about the concept, advantages and applications of GUI and Web interface User Interface Design Definition • User interface design is a subset of a field of study called human-computer interaction (HCI). Human-computer interaction is the study, planning, and design of how people and computers work together so that a person’s needs are satisfied in the most effective way. • The user interface is the part of a computer and its software that people can see, hear, touch, talk to, or otherwise understand or direct. The user interface has essentially two components: input and output. • Input is how people communicate his needs to the system using keyboard or any pointing device and output is how the system returns processing result to user through screen or sound. • The best interface is one which has proper design with combination of effective input and output mechanisms. Importance of...
Read more