Software Testing & Quality Assurance- Black-Box Testing

Click here to load reader

  • date post

    10-Jan-2017
  • Category

    Software

  • view

    250
  • download

    3

Embed Size (px)

Transcript of Software Testing & Quality Assurance- Black-Box Testing

  • INSTITUTE OF INFORMATION TECHNOLOGY

    UNIVERSITY OF DHAKA

    Software Testing & Quality Assurance

    Submitted by

    Minhas Kamal

    Roll- BSSE0509

    Submitted to

    Alim-ul-Giash

    Lecturer

    Institute of Information Technology,

    University of Dhaka

    Data: 08-Oct-15

  • Answer to the question no

    Let,

    C1 = Passenger is traveling more than 50000 km/year

    C2 = Passenger pays cash for tickets

    C3 = Passenger has been traveling more than 8 years

    C4 = Passenger travels less than 50000 km/year

    C5 = Passenger has been availing railway services more than 8 years

    E1 = Passenger gets a free round ticket around Bangladesh

    E2 = Passenger does not get a free

    Cause-Effect Graph:

    Answer to the question no- 1

    = Passenger is traveling more than 50000 km/year

    = Passenger pays cash for tickets

    = Passenger has been traveling more than 8 years

    = Passenger travels less than 50000 km/year

    = Passenger has been availing railway services more than 8 years

    = Passenger gets a free round ticket around Bangladesh

    = Passenger does not get a free round ticket around Bangladesh

  • Cause-Effect Table:

    Test Case:

    Test Case ID

    Total Travelling Distance

    Pays Cash

    Total Travelling Years

    Availing Railway Services

    Expected Output

    TC-1 60000 Yes 5 5 Get Free Round Ticket TC-2 55000 No 9 3 Get Free Round Ticket TC-3 30000 Yes 9 9 Get Free Round Ticket TC-4 20000 No 2 3 No Free Round Ticket TC-5 30000 Yes 9 5 No Free Round Ticket TC-6 15000 No 3 11 Get Free Round Ticket

    Answer to the question no- 2

    Let,

    I1 = {: A =90}

    I2 = {: B =90}

    I3 = {: C =90}

    I4 = {: A>90}

    I5 = {: B>90}

    R1 R2 R3 R4 R5

    C1 T T F F T

    C2 T I I I F

    C3 I T I I F

    C4 F F T T F

    C5 I I F T I

    E1 x x x

    E2 x x

  • I6 = {: C>90}

    I7 = {: A< 90, B

  • Answer to the question no

    State Graph:

    State Table:

    State\Input Event Create

    Initial EmptyEmpty Empty

    Holding HoldingFull Full

    Answer to the question no- 3

    Create Add Delete

    Empty Initial Initial Empty Holding/Full Empty

    Holding Holding/Full Empty Full Empty/Holding

    Destroy

    Initial Final Final Final

  • Test Case:

    Test Case ID Test Source Input Expected Output

    Current State Event Output Next State TC-1 Cell-1 Initial Create T2 Empty TC-2 Cell-2 Initial Add T1 Initial TC-3 Cell-3 Initial Delete T1 Initial TC-4 Cell-4 Initial Destroy T1 Initial TC-5 Cell-5 Empty Create T2 Empty TC-6 Cell-6 Empty Add T3/T4 Holding/Full TC-7 Cell-7 Empty Delete T2 Empty TC-8 Cell-8 Empty Destroy T5 Final TC-9 Cell-9 Holding Create T3 Holding

    TC-10 Cell-10 Holding Add T3/T4 Holding/Full TC-11 Cell-11 Holding Delete T2 Empty TC-12 Cell-12 Holding Destroy T5 Final TC-13 Cell-13 Full Create T4 Full TC-14 Cell-14 Full Add T4 Full TC-15 Cell-15 Full Delete T2/T3 Empty/Holding TC-16 Cell-16 Full Destroy T5 Final