Scribd Logo
Upload

Welcome to Scribd!

  • Adobe Scan 14 Mar 2023 PDF

    Uploaded by

    nivinvk
    11 views10 pages
    1. The program finds the largest and smallest numbers in an array by comparing each number to the values stored in registers. 2. It initializes counters and loads the first array value into a register. 3. It then enters a loop to compare each subsequent array value to the values in registers, updating the registers if a new largest/smallest is found. 4. After completing the loop, the registers contain the largest and smallest numbers from the array. These results are stored in memory.

    Original Description:

    Original Title

    Adobe Scan 14 Mar 2023 (2).pdf

    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 program finds the largest and smallest numbers in an array by comparing each number to the values stored in registers. 2. It initializes counters and loads the first array value into a register. 3. It then enters a loop to compare each subsequent array value to the values in registers, updating the registers if a new largest/smallest is found. 4. After completing the loop, the registers contain the largest and smallest numbers from the array. These results are stored in memory.

    Copyright:

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

    Adobe Scan 14 Mar 2023 PDF

    Uploaded by

    nivinvk
    1. The program finds the largest and smallest numbers in an array by comparing each number to the values stored in registers. 2. It initializes counters and loads the first array value into a register. 3. It then enters a loop to compare each subsequent array value to the values in registers, updating the registers if a new largest/smallest is found. 4. After completing the loop, the registers contain the largest and smallest numbers from the array. These results are stored in memory.

    Copyright:

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

    Pito:3

    p No:3 Pai:2022

    LeRGEST SHOLLEST fRoM tRIES


    Loeaes7 uMBE R RoM Au Axeo

    Jind btga s nmber tn a

    ama e unstqped nunmber


    Predeleinin.ec g l

    Swory S6 incl qqest u tn

    Condlents ade anst


    oen alt,
    must ConPaucl wtt an aubtai
    btqqs nuwber . Jn h s ZxPeimel, Zince oll
    nuuber a Sasel Jo be wnstqnet 8- b t numbers,
    Ae Teqaster has e bqqest runcber ie 3ero,

    low Conupatt utrst nuncber octh e. stsqccler


    ow
    6. u t h e r Conupanisor es oi+h
    roSe t o reqster
    ts ctone
    s biggast nunebu a n e t h s orpau son
    hunuba
    tiulAC ond a aua. l b w 1 t qqst
    8tor ed t memev< as te YeSut
    in reqster 3
    re is
    too all

    tialze douvtder n d

    menuory ocaDon req

    load c o n t e n t a cuulaut

    memor

    ore Contevt

    Joremet y oc aton
    g
    oLremet ouwile

    Courdr =0
    MoY o, 30

    MoV K,

    MOv , t1 o
    Lseps* MoVv , Ro
    C E wop
    eepl: Sc loop
    ov 3,
    eop:INC Ro

    R1, Loop %

    6MP HERE

    to
    e ng a a is peciect
    Erap ts e
    he Raqzster R Cuci
    SAats al 3O. slaqot n umer

    gtored recqtes
    the aua

    Data (3)

    321
    ()

    Le)- 1
    Rst
    eTET Coc

    ewor neuonic
    eddres

    MOV
    dNR Ro, #3o

    ALOI
    30

    AL03
    MoV Fo, tdo

    Fo

    ALo6
    Mov e Ro

    cIE Fo,L41o8

    FO
    ALoq
    FF
    LDF

    ANoC FD
    MOV Fo , 9
    F5

    S Fo

    AC Ro
    DSM2 R, Lo4

    FE
    SMp 4112

    FE
    oo chelt

    slnt

    Srlializ,
    Couiler an-l

    menuory Looattoo
    arl Teq5

    koot h e Coclei a uuud

    emov oc ceon to

    move Colecl to

    increoel euon o capon and


    duscsemet eounter Vaue

    Couilr ed
    .SHALEST uneER RONM 9RRAL

    inet he Swollust unuber n aua


    bit uns
    'qoecl unmbor s Prerltoumn ec

    Jhor inet he Soallus:t nune u ie


    ac e Conlers te arex ust
    oe ConPet h an
    aubite4 oeUr
    umber n h i s exPeimeil gine al e :nupaper

    Saclto be wnsic Pecl 8-bit n ber he eqst

    as he Sw allust nunuou te F ooConurpall the

    is nunuher w t s s , mu &to reqister


    . uther eomDaison & this Soallst unuber

    e end a
    and +his eo u D a i i s on

    he Uos6e Smallut nunuber eqister


    fhe
    ana
    aay.
    &torealt t emoro osth eSult
    # 42
    Mev Re,
    Mor Rs, 8

    t FF
    lov

    loep4 KloY A,@ Ro

    CIMC e, 8,op 3

    SMC Loep
    ov ,

    ttep :MC o

    OSN2 R, Loop
    HERE 3SMP HERE

    Exampu
    helength ehe araspeed io
    Teqeste Ra. alA As ats at A
    Smallss unubu o he 8Hatel
    auaus t

    olada.
    Sec CoDE

    emory Oddiu bject ools H onies

    8 o v e. , # 42

    to 5, #8
    o8
    Hor F, # FF

    4105

    A106 FF Plor A , R o

    E6

    Alo 8
    Fo LNE A,6. 41oe

    NC loF

    Fo o r Fo, A
    ALDO
    AlO E
    IC Ro

    A
    DNz

    A 3
    FE S3 PL12
    [43

    Reqist ]-1
    Vrocesuue : D Snes cpteel startinqro
    rcec e t e h Preqrou ane Vei -Jor result
    egiste
    cheunqe he

    esut uelhlacst and Soallst numba


    Llni

    STIM Kanfur
    Record &Pre paration10
    Performance & Output 10

    Viva 30
    Total
    Signature offaculty

    You might also like