Scribd Logo
Upload

Welcome to Scribd!

  • Tutorial 1-1

    Uploaded by

    Ahan Tejaswi
    6 views3 pages
    This document describes a pseudocode algorithm for counting the number of times a character appears in a string. It initializes variables like Count, Index, and Exit to track the loop. It then loops through each character in the string, compares it to the target character, and increments Count if they match. After looping through the entire string, Count will hold the number of occurrences. The algorithm uses basic programming constructs like variables, comparisons, and looping to solve the character counting problem in 3 steps or less.

    Original Description:

    Original Title

    Tutorial 1-1[1]

    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
    This document describes a pseudocode algorithm for counting the number of times a character appears in a string. It initializes variables like Count, Index, and Exit to track the loop. It then loops through each character in the string, compares it to the target character, and increments Count if they match. After looping through the entire string, Count will hold the number of occurrences. The algorithm uses basic programming constructs like variables, comparisons, and looping to solve the character counting problem in 3 steps or less.

    Copyright:

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

    Tutorial 1-1

    Uploaded by

    Ahan Tejaswi
    This document describes a pseudocode algorithm for counting the number of times a character appears in a string. It initializes variables like Count, Index, and Exit to track the loop. It then loops through each character in the string, compares it to the target character, and increments Count if they match. After looping through the entire string, Count will hold the number of occurrences. The algorithm uses basic programming constructs like variables, comparisons, and looping to solve the character counting problem in 3 steps or less.

    Copyright:

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

    fSM> P'Scaoe’

    oude diognm’
    lockECO33|(RY21
    Soxit-O otay C,
    S
    Titt;mea
    count Tìneg=0; -=|;
    Cout Counta
    t=1;
    ContO dle
    MeU Lcp (Tutc
    a)
    Sexit=Soyo CPaoolom -)

    Caxit)

    15)12l2
    ouegam>
    Block P&eudo
    cade
    9Ayist

    coraol
    Temh achudtoe.||dcle
    Convaty

    rrj
    dolom=2 Pa

    laseer
    MuticAut
    fuamaça
    &aitch
    PLDayoaihm
    d'opam
    Blork 9
    teg+ha To Simlal,
    Mte
    dda.
    atomdslo tHe
    Matee
    aoom
    Communi I Blat
    Tentte fuarare
    Conta BlTerast ligualoa
    huaaBlant
    actucta
    Ligid
    Rout kanaro
    Cotton

    imk
    MCU McU
    inteares
    Tent
    toh
    ol
    uoth
    Mroideatoret
    both
    tertg oluatoe
    ban
    o with
    Mcs tomnh

    You might also like