Scribd Logo
Upload

Welcome to Scribd!

  • Pengujian White Box Testing: 1. Proses Login

    Uploaded by

    Cornelius Tarigan
    9 views14 pages
    1. The document describes the process of white box testing for 7 processes: login, save data, update, delete, reset, view report, and pay. 2. For each process, it defines the number of regions, edges, nodes, and independent paths. 3. The testing will cover each independent path to thoroughly test all functionality within each process.

    Original Description:

    Original Title

    whitebox

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document describes the process of white box testing for 7 processes: login, save data, update, delete, reset, view report, and pay. 2. For each process, it defines the number of regions, edges, nodes, and independent paths. 3. The testing will cover each independent path to thoroughly test all functionality within each process.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views14 pages

    Pengujian White Box Testing: 1. Proses Login

    Uploaded by

    Cornelius Tarigan
    1. The document describes the process of white box testing for 7 processes: login, save data, update, delete, reset, view report, and pay. 2. For each process, it defines the number of regions, edges, nodes, and independent paths. 3. The testing will cover each independent path to thoroughly test all functionality within each process.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 14

    Pengujian White Box Testing

    1. PROSES LOGIN

    4 R1

    7 12 17

    8 13 18
    9 14 19

    R2 R3
    10 15 20

    11 16 21

    22

    23

    24

    V(G) = R
    = 3 region

    V(G) = E – N + 3
    = 24 – 24 + 3
    =3

    V(G) = P + 1
    = 2+ 1
    =3

    Jalur Independen :
    Jalur 1 : 1 – 2 – 3 – 4 – 5 – 6 – 7 - 8 – 9 – 10 – 11
    Jalur 2 : 1 - 2 - 3 - 4 - 5 - 6 - 12 – 13 – 14 – 15 – 16 – 22 – 23 – 24
    Jalur 3 : 1 - 2 - 3 - 4 - 5 - 6 - 17 – 18 – 19 – 20 – 21 – 22 – 23 – 24
    2. PROSES SIMPAN DATA

    R1
    2

    3 5 11

    R2
    R3 12
    4 6

    13
    7

    8 14

    9 15
    10 16

    17

    18 19

    R4
    20

    21

    22

    23

    24

    25

    26

    27

    28
    V(G) = R
    = 4 region

    V(G) = E – N + 3
    = 28 – 28 + 4
    =4

    V(G) = P + 1
    = 3+ 1
    =4

    Jalur Independen :
    Jalur 1 : 1 – 2 – 3 – 4 – 10 – 21 – 22 – 23 – 24 – 25 – 26 – 27 – 28
    Jalur 2 : 1 - 2 - 5 - 6 – 7 – 8 – 9 – 10 – 21 – 22 – 23 – 24 – 25 – 26 –
    27 – 28
    Jalur 3 : 1 - 2 – 11 – 12 – 13 – 14 – 15 – 16 – 17 – 18 – 21 – 22 – 23 –
    24 – 25 – 26 – 27 - 28
    Jalur 4 : 1 - 2 – 11 – 12 – 13 – 14 – 15 – 16 – 17 – 19 – 20 – 21 – 22 –
    23 – 24 – 25 – 26 – 27 - 28

    3. PROSES UPDATE
    1

    R1
    3

    5 7

    R2 8
    6

    10

    11

    12

    13

    14 15
    16

    17

    18

    19

    20

    21

    22

    23

    24

    V(G) = R
    = 2 region

    V(G) = E – N + 2
    = 28 – 28 + 3
    =2

    V(G) = P + 1
    =1+1
    =2

    Jalur Independen :
    Jalur 1 : 1 – 2 – 3 – 4 – 5 – 6 – 10 – 11 – 12 – 13 – 14 – 17 – 18 – 19 –
    20 – 21 – 22 – 23 – 24
    Jalur 2 : 1 - 2 - 3 - 4 – 7 – 8 – 9 – 10 – 11 – 12 – 13 – 15 – 16 - 17 –
    18 – 19 – 20 – 21 – 22 – 23 – 24

    4. PROSES HAPUS

    3
    R1

    4
    5 9

    R2
    10
    6

    11
    7

    12

    13

    V(G) = R
    = 2 region

    V(G) = E – N + 2
    = 10 – 10 + 2
    =2

    V(G) = P + 1
    =1+1
    =2

    Jalur Independen :
    Jalur 1 : 1 – 2 – 3 – 4 – 5 – 6 – 7 - 8 – 12 - 13
    Jalur 2 : 1 – 2 – 3 – 4 – 9 – 10 – 11 - 12 - 13

    5. PROSES RESET

    R1
    2

    3 5

    R2
    4 6

    V(G) = R
    = 2 region

    V(G) = E – N + 2
    =7–7+2
    =2
    V(G) = P + 1
    =1+1
    =2

    Jalur Independen :
    Jalur 1 :1–2–3–4–7
    Jalur 2 :1–2–5–6-7

    6. PROSES LIHAT LAPORAN

    4 R1

    7
    8

    V(G) = R
    = 1 region

    V(G) = E – N + 1
    =9–9+1
    =1

    V(G) = P + 1
    =0+1
    =1

    Jalur Independen :
    Jalur 1 :1–2–3–4–5–6–7–8–9

    7. PROSES BAYAR

    R1
    2
    3

    4 5

    R2

    13 7

    R3

    14 8

    10

    11

    12

    15
    V(G) = R
    = 3 region

    V(G) = E – N + 3
    = 15 – 15 + 3
    =3

    V(G) = P + 1
    =2+1
    =3

    Jalur Independen :
    Jalur 1 : 1 – 2 – 3 – 4 – 15
    Jalur 2 : 1 - 2 - 3 - 5 - 6 – 13 – 14 – 15
    Jalur 3 : 1 - 2 - 3 - 5 - 6 – 7 – 8 – 9 – 10 – 11 – 12 - 15

    You might also like