SophiaPretty

(5)

$14/per page/Negotiable

About SophiaPretty

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Applied Sciences,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Economics,Engineering,English,Environmental science,Essay writing Hide all
Teaching Since: Jul 2017
Last Sign in: 210 Weeks Ago, 6 Days Ago
Questions Answered: 15833
Tutorials Posted: 15827

Education

  • MBA,PHD, Juris Doctor
    Strayer,Devery,Harvard University
    Mar-1995 - Mar-2002

Experience

  • Manager Planning
    WalMart
    Mar-2001 - Feb-2009

Category > Computer Science Posted 03 Dec 2017 My Price 10.00

Software Quality Assignment Sheet 3 Input Domain

this question are about input domain testing and combinatorical testing

Topics in Software Quality Assignment Sheet 3 Input Domain Testing and Combinatorial Testing Question 1: Derive input space partitioning tests for the LinkedList class with the following methods: void LinkedList() – constructs an empty list void add(int index, Object e) - adds the object e to the specified position in the list, throws exception if the list is too small Object get(int index) – returns the element at the specified position in the list, returns Null if the list is too small Boolean removeFirstOccurrence( Object e) – removes the first occurrence of the object e from the list, returns false if the object is not in the list void clear() – removes all elements from the list Int size() – returns the number of elements in the list Propose possible input domain model(s) for the parameters and the state of the list. Define a base case. Create a test suite with base case coverage. The test suite should check the correctness of the three methods add(i,e), get(i), and removeFirstOccurrence(e). You can assume that the methods LinkedList(), clear() and size() have already been tested and are bugfree. Question 2: Given a function with ten Boolean inputs: ?? is the set of all Boolean vectors of length 10 with exactly i 1s. a. What is the coverage level of the test suite ?0??9? b. What is the coverage level of the test suite ?8? Question 3: What is the smallest theoretically possible test suite (minimum number of test cases) for a pairwise covering test suite of a function with 3 Boolean inputs, one parameter with three values and one parameter with 5 possible values? Can you create a test suite that achieves this minimum size? Question 4: Use the pairwiser site to create a set of 25 pairwise test cases for the illustrated user interface for editing fonts in MS Word. Suggest input partitions for the fields Font:, Font style: Size: Font color: Underline style: and Effects: (Ignore the section on Complex Scripts). Your testing budget is at most 25 test cases. Describe the coverage you achieved (using the analysis provided by pairwiser). You should also use the constraints feature to describe the restrictions on the effects. e.g. It is impossible to have both subscript and superscript at the same time.

Attachments:

Answers

(5)
Status NEW Posted 03 Dec 2017 06:12 AM My Price 10.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)