This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
dido:public:ra:xapend:xapend.g_testing:start [2021/10/02 19:36] nick ↷ Page moved and renamed from dido:public:ra:xapend:xapend.g_testing to dido:public:ra:xapend:xapend.g_testing:start |
dido:public:ra:xapend:xapend.g_testing:start [2021/11/08 16:09] (current) char |
||
|---|---|---|---|
| Line 17: | Line 17: | ||
| Source: [[https://www.tutorialspoint.com/software_testing_dictionary/acceptance_testing.htm]]</WRAP> | | Source: [[https://www.tutorialspoint.com/software_testing_dictionary/acceptance_testing.htm]]</WRAP> | | ||
| | [[dido:public:ra:xapend:xapend.a_glossary:b:blackboxtesting]] | <WRAP>**Black Box Testing** is a type of software testing in which the functionality of the software is not known. The testing is done without the internal knowledge of the products. \\ | | [[dido:public:ra:xapend:xapend.a_glossary:b:blackboxtesting]] | <WRAP>**Black Box Testing** is a type of software testing in which the functionality of the software is not known. The testing is done without the internal knowledge of the products. \\ | ||
| + | |||
| + | Black box testing can be done in the following ways:\\ | ||
| \\ | \\ | ||
| - | Black box testing can be done in the following ways:\\ | ||
| - | |||
| : 1. Syntax Driven Testing – This type of testing is applied to systems that can be syntactically represented by some language. For example- compilers and language that can be represented by context free grammar. In this, the test cases are generated so that each grammar rule is used at least once.\\ | : 1. Syntax Driven Testing – This type of testing is applied to systems that can be syntactically represented by some language. For example- compilers and language that can be represented by context free grammar. In this, the test cases are generated so that each grammar rule is used at least once.\\ | ||
| - | \\ | ||
| : 2. Equivalence partitioning – It is often seen that many type of inputs work similarly so instead of giving all of them separately we can group them together and test only one input of each group. The idea is to [[dido:public:ra:xapend:xapend.a_glossary:p:partition|partition]] the input domain of the system into a number of equivalence classes such that each member of class works in a similar way, i.e., if a test case in one class results in some error, other members of that class would also produce the same error. \\ | : 2. Equivalence partitioning – It is often seen that many type of inputs work similarly so instead of giving all of them separately we can group them together and test only one input of each group. The idea is to [[dido:public:ra:xapend:xapend.a_glossary:p:partition|partition]] the input domain of the system into a number of equivalence classes such that each member of class works in a similar way, i.e., if a test case in one class results in some error, other members of that class would also produce the same error. \\ | ||
| - | \\ | + | \\ |
| Source: [[https://www.geeksforgeeks.org/software-engineering-black-box-testing/]] | Source: [[https://www.geeksforgeeks.org/software-engineering-black-box-testing/]] | ||
| </WRAP> | | </WRAP> | | ||