Scribd Logo
Upload

Welcome to Scribd!

  • Syahied Hidayatullah 140511001 Tes Implementasi Sistem 1. Source Code

    Uploaded by

    Syahied Hidayatullah
    167 views2 pages
    This document discusses the testing of a calculator application implementation system. It includes the source code, flow chart, and flow graph of the calculator application. It also calculates the cyclomatic complexity of the flow graph as 1 using the formula V(G) = Edges(E) – Nodes(N) + 2.

    Original Description:

    tugas matkul Tes Implementasi sistem

    Original Title

    Flow Graph Program Kalkulator

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses the testing of a calculator application implementation system. It includes the source code, flow chart, and flow graph of the calculator application. It also calculates the cyclomatic complexity of the flow graph as 1 using the formula V(G) = Edges(E) – Nodes(N) + 2.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    167 views2 pages

    Syahied Hidayatullah 140511001 Tes Implementasi Sistem 1. Source Code

    Uploaded by

    Syahied Hidayatullah
    This document discusses the testing of a calculator application implementation system. It includes the source code, flow chart, and flow graph of the calculator application. It also calculates the cyclomatic complexity of the flow graph as 1 using the formula V(G) = Edges(E) – Nodes(N) + 2.

    Copyright:

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

    Syahied Hidayatullah

    140511001
    Tes Implementasi Sistem
    1. Source code

    2. Flow Chart aplikasi kalkulator

    Syahied Hidayatullah
    140511001
    Tes Implementasi Sistem
    3. Flow Graph aplikasi kalkulator

    4. Cyclomatic Complexity
    V(G) = Edges(E) Nodes(N) + 2
    =
    =

    8 - 9 + 2
    1

    You might also like