Scribd Logo
Upload

Welcome to Scribd!

  • Interrogation GL2

    Uploaded by

    Mouad1993
    14 views9 pages
    interrogation GL2

    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
    interrogation GL2

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    14 views9 pages

    Interrogation GL2

    Uploaded by

    Mouad1993
    interrogation GL2

    Copyright:

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

    BBCritredescheminsindpendants,vousdejouer!

    ExtraitdeR.S.Pressman(2001)

    SoftwareEngineering:APractitioner's
    Approach,5thed.McGraw-Hill.
    Entre:
    -1tableaudauplus100
    nombres
    -1bornemin
    -1bornemax
    Retour:
    -Moyennedesnombrescompris
    entreminetmax,
    -Sommedetouslesnombres
    -Sommedesnombrescompris
    entreminetmax

    voidf(intvalue[],inttotal_input,inttotal_valid,
    intsum,doubleaverage)
    inti=0;
    total_input=0;
    total_valid=0;
    sum=0;
    while(value[i]!=-999&&total_input<100)
    {
    total_input++;
    if(value[i]>=min&&value[i]<=max)
    {
    total_valid++;
    sum+=value[i];
    }
    i++;
    }
    if(total_valid>0)
    average=sum/total_valid;
    else
    average=-999;

    90

    BBCritredescheminsindpendants,vousdejouer!
    voidf(intvalue[],inttotal_input,inttotal_valid,
    intsum,doubleaverage)
    inti=0;
    total_input=0;
    total_valid=0;
    sum=0;
    while(value[i]!=-999&&total_input<100)
    {
    total_input++;
    if(value[i]>=min&&value[i]<=max)
    {
    total_valid++;
    sum+=value[i];
    }
    i++;
    }
    if(total_valid>0)
    average=sum/total_valid;
    else
    average=-999;

    ++value[i]<max
    **total_valid++;min+=value[i]
    -+-average!=-999
    -x-average!=sum/total_valid

    91

    BBCritredescheminsindpendants,vousdejouer!
    Nombrecyclomatique:17-13+2=6

    ++value[i]<max
    **total_valid++;min+=value[i]
    -+-average=-999
    -x-average=sum/total_valid

    92

    BBCritredescheminsindpendants,vousdejouer!
    Nombrecyclomatique:17-13+2=6

    Chemin1

    (couvrantmaxsansboucle)

    [1234567893101113]
    DTmin=1,max=10,value={2,-999}

    ++value[i]<max
    **total_valid++;min+=value[i]
    -+-average!=-999
    -x-average!=sum/total_valid

    93

    BBCritredescheminsindpendants,vousdejouer!
    Nombrecyclomatique:17-13+2=6

    Chemin1
    [1234567893101113]
    Chemin2

    Onchangela1redcisionde1uniquement

    [123101113]

    Cheminnonexcutablecar
    total_validrestenul

    donc
    [123101213]
    DTmin=1,max=10,value={-999}

    ++value[i]<max
    **total_valid++;min+=value[i]
    -+-average!=-999
    -x-average!=sum/total_valid

    94

    BBCritredescheminsindpendants,vousdejouer!
    Nombrecyclomatique:17-13+2=6

    Chemin1
    [1234567893101113]
    Chemin2
    [123101213]

    Chemin3
    Onchangela2ndedcisionde1

    [1234101213]
    Cheminnonexcutablenonplus,carla
    conditionestdpendantedetotal_input!

    Donc
    [123(4567893)1004101113]
    DTmin=0max=10valueuntableau
    de100foislavaleur1

    ++value[i]<max
    **total_valid++;min+=value[i]

    -+-average!=-999

    -x-average!=sum/total_valid

    95

    BBCritredescheminsindpendants,vousdejouer!
    Nombrecyclomatique:17-13+2=6

    Chemin1
    [1234567893101113]
    Chemin2
    [123101213]

    Chemin3
    [123(4567893)1004101113]
    Chemin4
    Onchangela4meconditionde1

    [12345693101213]
    DTmin=4max=10value={2,-999}

    ++value[i]<max
    **total_valid++;min+=value[i]
    -+-average!=-999
    -x-average!=sum/total_valid

    96

    BBCritredescheminsindpendants,vousdejouer!
    Nombrecyclomatique:17-13+2=6

    Chemin1
    [1234567893101113]
    Chemin2
    [123101213]

    Chemin3
    [123(4567893)1004101113]
    Chemin4
    [12345693101213]
    Chemin5
    Onchangela5meconditionde1

    [123456793101213]
    DTmin=0max=1value={2,-999}

    ++value[i]<max
    **total_valid++;min+=value[i]
    -+-average!=-999
    -x-average!=sum/total_valid

    97

    BBCritredescheminsindpendants,vousdejouer!
    Nombrecyclomatique:17-13+2=6

    Chemin1
    [1234567893101113]
    Chemin2
    [123101213]

    Chemin3
    [123(4567893)1004101113]
    Chemin4
    [12345693101213]
    Chemin5
    [123456793101213]
    Chemin6
    Onchangela6meconditionde1

    [1234567893101213]
    IMPOSSIBLE
    ++value[i]<max
    **total_valid++;min+=value[i]
    -+-average!=-999
    -x-average!=sum/total_valid

    98

    You might also like