<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Pranav Madhavan</title>
    <description>The latest articles on DEV Community by Pranav Madhavan (@pranavmadhavan1).</description>
    <link>https://dev.to/pranavmadhavan1</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F794984%2F21782bdf-d6e0-40b1-9cbc-b41aa601a923.jpg</url>
      <title>DEV Community: Pranav Madhavan</title>
      <link>https://dev.to/pranavmadhavan1</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/pranavmadhavan1"/>
    <language>en</language>
    <item>
      <title>NodeJS and Express Done!</title>
      <dc:creator>Pranav Madhavan</dc:creator>
      <pubDate>Mon, 05 Feb 2024 11:33:26 +0000</pubDate>
      <link>https://dev.to/pranavmadhavan1/nodejs-and-express-done-4je8</link>
      <guid>https://dev.to/pranavmadhavan1/nodejs-and-express-done-4je8</guid>
      <description>&lt;p&gt;starting with react js&lt;/p&gt;

</description>
    </item>
    <item>
      <title>Started NodeJS</title>
      <dc:creator>Pranav Madhavan</dc:creator>
      <pubDate>Fri, 29 Dec 2023 04:11:28 +0000</pubDate>
      <link>https://dev.to/pranavmadhavan1/started-nodejs-8hf</link>
      <guid>https://dev.to/pranavmadhavan1/started-nodejs-8hf</guid>
      <description>&lt;p&gt;started to learn nodejs from Node.js and Express.js - Full Course&lt;br&gt;
by John Smilga&lt;/p&gt;

</description>
      <category>webdev</category>
      <category>node</category>
      <category>programming</category>
      <category>learning</category>
    </item>
    <item>
      <title>Not So Consistent!</title>
      <dc:creator>Pranav Madhavan</dc:creator>
      <pubDate>Wed, 20 Dec 2023 19:52:06 +0000</pubDate>
      <link>https://dev.to/pranavmadhavan1/not-so-consistent-71g</link>
      <guid>https://dev.to/pranavmadhavan1/not-so-consistent-71g</guid>
      <description>&lt;p&gt;Struggling with consistency ! Started with my JavaScript Journey 5 Days ago . Decided to start blogging which might help me stay consistent😑&lt;/p&gt;

</description>
      <category>javascript</category>
      <category>beginners</category>
      <category>webdev</category>
    </item>
    <item>
      <title>My 150-Day Full-Stack Web Development Challenge: Day 1</title>
      <dc:creator>Pranav Madhavan</dc:creator>
      <pubDate>Wed, 21 Jun 2023 19:52:45 +0000</pubDate>
      <link>https://dev.to/pranavmadhavan1/my-365-day-full-stack-web-development-challenge-day-1-2pd8</link>
      <guid>https://dev.to/pranavmadhavan1/my-365-day-full-stack-web-development-challenge-day-1-2pd8</guid>
      <description>&lt;p&gt;Introduction:&lt;br&gt;
Hello there, fellow tech enthusiasts! I am Pranav, an 18-year-old B.Tech student embarking on an extraordinary journey towards becoming a full-stack developer. Today marks the beginning of my 150-day challenge, where I'll immerse myself in the world of web development, honing my skills and exploring the vast possibilities of this dynamic field. Join me as I share my triumphs, tribulations, and everything in between.&lt;/p&gt;

&lt;p&gt;Day 1: Reviving HTML and CSS, Building an Amazon Clone&lt;br&gt;
As the sun rose on this exciting endeavor, I found myself eagerly dusting off my HTML and CSS skills. These foundational languages are the building blocks of the web, and it felt invigorating to reconnect with their syntax and structure. With a renewed sense of purpose, I set out to create my very own Amazon clone.&lt;/p&gt;

&lt;p&gt;With every line of code, I felt a surge of anticipation and creative energy. The process of recreating such a widely recognized e-commerce platform was both thrilling and challenging. From crafting the layout and user interface to perfecting the intricate details, every step brought me closer to realizing my vision.&lt;/p&gt;

&lt;p&gt;As I delved deeper into the project, I encountered moments of frustration and doubt. But I reminded myself that growth often emerges from facing challenges head-on. With determination as my guide, I sought solutions, referring to documentation, seeking guidance from online communities, and experimenting with different approaches. Each hurdle I overcame provided invaluable lessons and bolstered my confidence.&lt;/p&gt;

&lt;p&gt;Throughout the day, I witnessed my Amazon clone taking shape, slowly but surely. It was awe-inspiring to witness the transformation of a blank canvas into a visually appealing and functional website. The feeling of accomplishment washed over me, igniting a fire within to continue this incredible journey.&lt;/p&gt;

&lt;p&gt;Closing Thoughts:&lt;br&gt;
Day 1 of my 365-day full-stack web development challenge was a captivating experience, fueling my passion for coding and igniting my ambition to master every facet of this dynamic domain. Brushing up my HTML and CSS skills while building an Amazon clone reminded me of the boundless possibilities that lie ahead.&lt;/p&gt;

&lt;p&gt;As I prepare for the next phase of my journey, I am brimming with excitement and curiosity. The road may be long, filled with ups and downs, but I am determined to persist, learn, and grow. Join me as I continue to document my progress, sharing insights, discoveries, and, undoubtedly, a few humorous anecdotes along the way.&lt;/p&gt;

&lt;p&gt;Stay tuned for the next chapter of my adventure, where I dive deeper into the realm of web development, unraveling the secrets of JavaScript and beyond. Until then, fellow coders, keep coding and dreaming big!&lt;/p&gt;

&lt;p&gt;Signing off,&lt;br&gt;
Pranav&lt;/p&gt;

</description>
    </item>
    <item>
      <title>CS50 Problem Set 2 , Readability</title>
      <dc:creator>Pranav Madhavan</dc:creator>
      <pubDate>Tue, 07 Jun 2022 15:17:37 +0000</pubDate>
      <link>https://dev.to/pranavmadhavan1/cs50-problem-set-2-readability-1m8</link>
      <guid>https://dev.to/pranavmadhavan1/cs50-problem-set-2-readability-1m8</guid>
      <description>&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;//CS50 Problem Set 2 (Fall 2022): Readability
//Author: Pranav Madhavan

#include &amp;lt;cs50.h&amp;gt;
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;string.h&amp;gt;
#include &amp;lt;ctype.h&amp;gt;
#include &amp;lt;math.h&amp;gt;

int count_letters(string text, int str);
int count_words(string text, int str);
int count_sentences(string text, int str);

int main(void)
{
    //ask user for string and store in s
    string s = get_string("Text: ");
    //find length of a string using srlen function
    int strl = strlen(s);

    int letters = count_letters(s, strl);  //count of Letters
    int words = count_words(s, strl);  //count of Words
    int sentences = count_sentences(s, strl);  //count of sentences

    float L = 100 * (float) letters / (float) words;//Letters Per Hundred words
    float S = 100 * (float) sentences / (float) words; //Sentences Per Hundred Words

    int index = round(0.0588 * L - 0.296 * S - 15.8); //Coleman-Liau index


    //to print grade
    if (index &amp;lt; 1)
    {
        printf("Before Grade 1\n");
    }
    else if (index &amp;lt; 16)
    {
        printf("Grade %i\n", index);
    }
    else
    {
        printf("Grade 16+\n");
    }

}

//function to count number of letters.
int count_letters(string text, int str)
{

    //variable which stores no of Letters.
    int l = 0;

    for (int i = 0; i &amp;lt; str; i++)
    {

        if (isalpha(text[i]) != 0)
        {
            l++;
        }
    }
    return l;
}

int count_words(string text, int str)
{
    //count of spaces.
    int w = 0;

    for (int i = 0; i &amp;lt; str; i++)
    {
        if (isspace(text[i]) != 0)
        {
            w++;
        }
    }

    //no of words.
    w = w + 1;
    return w;
}

int count_sentences(string text, int str)
{
    //count of sentences
    int s = 0;
    //count of . ! and ?
    for (int i = 0; i &amp;lt; str ; i++)
    {
        if (text[i] == 33 || text[i] == 46 || text[i] == 63)
        {
            s++;
        }
    }

    return s;

}
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



</description>
    </item>
    <item>
      <title>DATA TYPES AND MODIFIERS</title>
      <dc:creator>Pranav Madhavan</dc:creator>
      <pubDate>Mon, 17 Jan 2022 19:54:42 +0000</pubDate>
      <link>https://dev.to/pranavmadhavan1/data-types-and-modifiers-6c0</link>
      <guid>https://dev.to/pranavmadhavan1/data-types-and-modifiers-6c0</guid>
      <description>&lt;h2&gt;
  
  
  LEARNING C++ DAY-2
&lt;/h2&gt;

&lt;h2&gt;
  
  
  Variables
&lt;/h2&gt;

&lt;p&gt;A variable is a container (storage area) used to hold data.&lt;br&gt;
Each variable should be given a unique name (identifier).&lt;br&gt;
int a=2;&lt;/p&gt;

&lt;p&gt;Here a is the variable name that holds the integer value 2.&lt;br&gt;
The value of a can be changed, hence the name variable.&lt;br&gt;
There are certain rules for naming a variable in C++&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Can only have alphabets, numbers and underscore.&lt;/li&gt;
&lt;li&gt;Cannot begin with a number.&lt;/li&gt;
&lt;li&gt;Cannot begin with an uppercase character.&lt;/li&gt;
&lt;li&gt;Cannot be a keyword defined in C++ language (like int is a keyword).&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;Fundamental Data Types in C++&lt;/p&gt;

&lt;p&gt;Data types are declarations for variables. This determines the type and size of data associated with variables which is essential to know since different data types occupy different size of memory.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--UAFJI1lz--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/s0u36h0tw95ap9zl68mw.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--UAFJI1lz--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/s0u36h0tw95ap9zl68mw.png" alt="Image description" width="800" height="450"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;1 int&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;This data type is used to store integers.&lt;/li&gt;
&lt;li&gt;It occupies 4 bytes in memory.&lt;/li&gt;
&lt;li&gt;It can store values from -2147483648 to 2147483647.
Eg. int age = 18&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;2 float and double&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Used to store floating-point numbers (decimals and exponentials)&lt;/li&gt;
&lt;li&gt;Size of float is 4 bytes and size of double is 8 bytes.&lt;/li&gt;
&lt;li&gt;Float is used to store upto 7 decimal digits whereas double is 
used to store upto 15 decimal digits.
Eg. float pi = 3.14
 double distance = 24E8 // 24 x 108&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;3 char&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;This data type is used to store characters.&lt;/li&gt;
&lt;li&gt;It occupies 1 byte in memory.&lt;/li&gt;
&lt;li&gt;Characters in C++ are enclosed inside single quotes ͚ ͚.&lt;/li&gt;
&lt;li&gt;ASCII code is used to store characters in memory.
Eg͘ char ch= 'a';&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;4 bool&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;This data type has only 2 values ʹ true and false.&lt;/li&gt;
&lt;li&gt;It occupies 1 byte in memory.&lt;/li&gt;
&lt;li&gt;True is represented as 1 and false as 0.
Eg. bool flag = false
&lt;/li&gt;
&lt;/ul&gt;
&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;#include &amp;lt;iostream&amp;gt;
using namespace std;
int main(){
    int a; //declaration
    a=12;

    cout&amp;lt;&amp;lt;"size of int "&amp;lt;&amp;lt;sizeof(a)&amp;lt;&amp;lt;endl;

    float b;
    cout&amp;lt;&amp;lt;"size of float "&amp;lt;&amp;lt;sizeof(b)&amp;lt;&amp;lt;endl;

    char c;
    cout&amp;lt;&amp;lt;"size of char "&amp;lt;&amp;lt;sizeof(c)&amp;lt;&amp;lt;endl;

    bool d;
    cout&amp;lt;&amp;lt;"size of bool "&amp;lt;&amp;lt;sizeof(d)&amp;lt;&amp;lt;endl;

return 0;
}
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;


&lt;p&gt;&lt;strong&gt;OUTPUT&lt;/strong&gt;&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;
size of int 4
size of float 4
size of char 1
size of bool 1

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h1&gt;
  
  
  C++ Type Modifiers
&lt;/h1&gt;

&lt;p&gt;Type modifiers are used to modify the fundamental data types.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--d47lZxeZ--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/9wkkswlzohuqapz1rgjg.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--d47lZxeZ--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/9wkkswlzohuqapz1rgjg.png" alt="Image description" width="607" height="515"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;*************** THANK YOU ALL FOR READING   **********************&lt;/p&gt;

&lt;p&gt;@pranvmadhavan1&lt;/p&gt;

&lt;p&gt;INSTAGRAM : @_pra.n.v&lt;/p&gt;

</description>
    </item>
    <item>
      <title>DAY 1 OF LEARNING C++</title>
      <dc:creator>Pranav Madhavan</dc:creator>
      <pubDate>Sun, 16 Jan 2022 20:05:42 +0000</pubDate>
      <link>https://dev.to/pranavmadhavan1/day-1-of-learning-c-1hko</link>
      <guid>https://dev.to/pranavmadhavan1/day-1-of-learning-c-1hko</guid>
      <description>&lt;h2&gt;
  
  
  INTRODUCTION TO C++
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--M4FW8C2F--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/05qp9rt66qry9543q92m.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--M4FW8C2F--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/05qp9rt66qry9543q92m.png" alt="Image description" width="800" height="336"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;A Program is a Set of Instructions that tells computer what to 
do in order to come up with a solution to a particular program. 
Programs are written using a programming language. There are two 
major types of programming languages: low-level languages and
high-level languages.&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  Low-Level Languages
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;A low-level language is a programming language that provides 
little or no abstraction of programming concepts and is very 
close to writing actual machine instructions.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Eg : Machine Language , Assembly Language.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Machine language&lt;/strong&gt;, or machine code, is the only language that is
understood by the computer, and it does not need to be 
translated. It is in binary numbers (1s' and 0s'). 
A program instruction in machine language may look something 
like this:&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--MWjD2caC--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/5x5b4r8nbxgfj0x85b44.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--MWjD2caC--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/5x5b4r8nbxgfj0x85b44.png" alt="Image description" width="800" height="521"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;-&lt;strong&gt;Assembly Language&lt;/strong&gt;  is the first step to improve programming &lt;br&gt;
 structure and make machine language more readable by humans. An &lt;br&gt;
 assembly language consists of a set of symbols and letters.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;A translator is required to translate the assembly language to &lt;br&gt;
 machine language called the 'assembler.'&lt;/strong&gt;&lt;/p&gt;
&lt;h2&gt;
  
  
  High-Level Languages
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;&lt;p&gt;It allow programmer's to write instructions in a language that &lt;br&gt;
is easier to understand.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Compiler&lt;/strong&gt;    : It converts HLL(High Level Language) to &lt;br&gt;
machine language in one run.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Interpreter&lt;/strong&gt; : It converts HLL(High Level Language) to &lt;br&gt;
machine language Line by Line.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Source Code&lt;/strong&gt; : Program written in High Level Language.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Object Code&lt;/strong&gt; : Program in Machine Language. &lt;/p&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h2&gt;
  
  
  Algorithm
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;Algorithm is Step by Step procedure to write a Program.&lt;/li&gt;
&lt;/ul&gt;
&lt;h2&gt;
  
  
  Flowchart
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;Graphical representation of algorithm is known as Flowchart.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--0e2YYPkl--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/y7d78j4kfva6rvkmd9it.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--0e2YYPkl--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/y7d78j4kfva6rvkmd9it.png" alt="Image description" width="482" height="454"&gt;&lt;/a&gt;&lt;/p&gt;
&lt;h2&gt;
  
  
  Pseudocode
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;Pseudocode is a method of describing computer algorithm using a 
combination of natural language and programming.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Example 1&lt;/strong&gt;&lt;br&gt;
 Write a flowchart and pseudocode for finding the sum of 2 &lt;br&gt;
 numbers.&lt;/p&gt;

&lt;p&gt;PSEUDOCODE&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;1. Start
2. Input 2 numbers ʹ number1 and number2
3. Add number1 and number2 to find sum
4. Print sum
5. End

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;FLOWCHART&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--icIkh-oF--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/t16s7jmjkq1osa7lo1jw.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--icIkh-oF--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/t16s7jmjkq1osa7lo1jw.png" alt="Image description" width="308" height="425"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Example 2&lt;/strong&gt;&lt;br&gt;
 Write a flowchart and pseudocode to find maximum of three given &lt;br&gt;
 numbers.&lt;/p&gt;

&lt;p&gt;PSEUDOCODE&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;1. Start
2. Read three numbers ʹ a,b and c
3. Compare a and b, if a &amp;gt; b
      Compare a and c, if a &amp;gt; c
                 Print a
      Else
                 Print c
    Else
      Compare b and c, if b &amp;gt; c
                 Print b
      Else
                 Print c
4. End

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;FLOWCHART&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--GM2h0kl2--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/v0hxld3d1sklf143nfzb.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--GM2h0kl2--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/v0hxld3d1sklf143nfzb.png" alt="Image description" width="515" height="514"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Example 3&lt;/strong&gt;&lt;br&gt;
 Write a flowchart and pseudocode to find a number is prime or not.&lt;/p&gt;

&lt;p&gt;PSEUDOCODE&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;1. Start
2. Read a number n
3. Initialise divisor = 2
4. Repeat till divisor &amp;lt; n
     If n is divisible by divisor
         Print ͞Non-Prime͟
         End
     Else
         divisor = divisor + 1
5. Print ͞Prime͟
6. End

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;FLOWCHART&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--wY-R6Cz8--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/8czk3pz13xhbl3fpjemu.jpg" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--wY-R6Cz8--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/8czk3pz13xhbl3fpjemu.jpg" alt="Image description" width="800" height="788"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Example 3&lt;/strong&gt;&lt;br&gt;
 Write a flowchart and pseudocode to find a number is prime or not.&lt;/p&gt;

&lt;p&gt;PSEUDOCODE&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;1. Start
2. Read a number n
3. Initialise divisor = 2
4. Repeat till divisor &amp;lt; n
     If n is divisible by divisor
         Print ͞Non-Prime͟
         End
     Else
         divisor = divisor + 1
5. Print ͞Prime͟
6. End

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;FLOWCHART&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--wY-R6Cz8--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/8czk3pz13xhbl3fpjemu.jpg" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--wY-R6Cz8--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/8czk3pz13xhbl3fpjemu.jpg" alt="Image description" width="800" height="788"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Example 4&lt;/strong&gt;&lt;br&gt;
 Write a flowchart and pseudocode to find sum of n natural &lt;br&gt;
 numbers.&lt;/p&gt;

&lt;p&gt;PSEUDOCODE&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;1. Start
2. Read a number n
3. Repeat the following till n becomes equal to 0
                        Add n in sum
                        Decrement n
4. Print sum
5. End

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;FLOWCHART&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--oPbg6smC--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/hxsnqjrnjf7llpjwwbse.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--oPbg6smC--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/hxsnqjrnjf7llpjwwbse.png" alt="Image description" width="140" height="338"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;***************  THANK YOU ALL FOR READIND **********************&lt;/p&gt;

&lt;p&gt;@pranvmadhavan1&lt;/p&gt;

&lt;p&gt;INSTAGRAM :  &lt;a href="https://www.instagram.com/_pra.n.v/"&gt;@_pra.n.v&lt;/a&gt;&lt;/p&gt;

</description>
    </item>
  </channel>
</rss>
