Algorithm and Flowchart to calculate the frequency of punctuation marks in a given string

[300 views]



A string is a sequence of characters, where each character has an assigned index. It is similar to an array of characters. It can contain any character like a-z, A-Z, 0-9, white spaces and special characters. The index of the characters in a string starts from 0 and goes till length of the string – 1. Special characters and white spaces also have an assigned index.
For example, if we consider the string “It’s okay.”

The indexing will be as follows:
Characters I t ‘ s  o k a y .
Index  0 1 2 3 4 5 6 7 8 9

We can perform a lot of string manipulation tasks using various programming languages. With the help of these indexes, we can calculate the frequency of each character present in the array. In this article, we will see how we can calculate the frequency of punctuation marks present in a string given by the user.

Algorithm to calculate the frequency of punctuation marks in a given string:

1. Start 2. Read the string from the user, say ‘s’ 3. Calculate the length of the string, say ‘l’ 4. Initialize frequency = 0 5. Initialize loop variable i = 0 6. Repeat, while i < l – 1: 6.1: c = Character at position i 6.2: if c equals ‘,’ OR c equals ‘.’ OR c equals ‘?’ OR c equals ‘!’ OR c equals ‘ ’ ’ OR c equals ‘;’ OR c equals ‘:’ OR c equals ‘ ” ’ OR c equals ‘-’ OR c equals ‘/ ’, then: 6.2.a: Increment frequency by 1 6.3: Increment i by 1 7. Display frequency 8. Stop

Explanation:

In this algorithm, we first take the string as input from the user. Then, we calculate the length of the string and store it in a variable, say ‘l’. After that, we initialize the frequency of punctuations, say ‘f’ as zero. We initialize a loop variable, say i as zero and start a loop which runs from i to length of the string – 1. We now find out the character present at index i and store it in a variable say ‘c’.

We will now compare c with each of the punctuation mark: ‘,’ , ‘.’ , ‘;’ , ‘/’, ‘-‘ , ‘:’, ‘?’, ‘!’, ‘ “ ‘. If a match is found, we increment the frequency by 1. Once the execution of this loop ends, we will have the frequency of the punctuation marks in the variable f. We can now print this frequency.

Let us consider an example:
Input: “ It’s sunny outside, isn’t it? ”
Here, the punctuations in the string are:’ ‘ ‘, ‘,’ and ‘?’
So, the output will be: 4

Flowchart to calculate the Count of Punctuation marks in a given string:

Algorithm and Flowchart to calculate the frequency of punctuation marks in a given string
Remove WaterMark from Above Flowchart

        



Having Difficulty understanding above Algorithm and Flowchart? Buy my personal Notes



Are You Good enough in Algorithms? Prove it!


Getting any Errors while coding? Ask us on our new Forum:




Liked Article? Please Buy Author a Coffee


Comments



Search
For Sponsored Advertisement OR Freelance Programming Article Submission, Contact us at atechdailyweb@gmail.com
Recommended Deal Ends in











Quizzes:
Online Games
Play 2048 Game Online and Relax.
Play 2048 Game Online

Why does everyone hate Java?
How much JavaScript to learn for Web Development
How to Convert EPOCH to Date in Java
Search Tags

    Pseudocode to count punctuation marks in a given string

    Flowchart to count punctuation marks in a given string