Lecture 1 : Flowchart & Pseudocode + Installation | DSA Series by Shradha Khapra Ma'am | C++

Main ideas & lessons (clearly outlined)

Purpose of the DSA series (why it exists)

• Many students only receive pseudo-code or incomplete explanations, leading to a false sense of preparedness.
• The series aims to provide complete clarity: concepts should remain in the learner’s mind through full coverage and practice.
• It addresses the problem of scattered/extra practice questions by ensuring:
  • Practice is included within the series
  • Content is structured so it doesn’t waste time
• Placement/interview oriented goal:
  • Build confidence so learners can solve questions and apply concepts during interviews.

Why study DSA (data structures & algorithms)?

• Most tech companies ask for DSA-related questions in interviews and coding tests.
• Stronger grasp of DSA → better problem-solving → better engineering performance.
• Interview problem-solving involves:
  • Identifying which data structures to use
  • Choosing appropriate algorithms
  • Writing an optimal solution

Learning strategy of the course

• Start with fundamentals, with “baby steps”:
  • Learn C++ programming basics first
  • Then begin DSA concepts
• Notes + practice approach:
  • Take a rough notebook
  • Write rough/fair notes for easy repetition and retention
  • Practice the concepts multiple times to remember them (like “ABC/DEF” repetition)
• Don’t panic if you find early topics confusing; later lectures will make them click.

---

Methodology / step-by-step process taught for solving problems

Using the example “sum of two numbers a and b,” the instructor explains a general workflow:

1. Understand the problem statement
   • What is being asked?
2. Identify inputs
   • Determine what values are given (example: inputs are a and b)
3. Find/construct the solution
   • Example: solution form is a + b
4. Convert the paper logic into code
   • Once the logic is clear on paper, coding becomes easier

Focus of Lecture 1

• Use flow charts and pseudo code to express logic before coding.
• Coding itself comes later; first build logic.

---

Flow charts: what they are and how they’re built

Concept

• A flow chart is a diagram representing a solution’s logic step-by-step.

Typical components explained (with shapes)

• Start/Exit (oval)
  • Oval shape, contains “Start” or “Exit”
• Input/Output (parallelogram)
  • Used to show reading inputs and printing outputs
• Process (rectangle)
  • Used for calculations/operations (e.g., computing sum = a + b)
• Flow direction (arrows)
  • Connect steps to show order of execution
• Decision (diamond)
  • Used when the program must choose based on a condition
  • Outputs typically split into Yes/No paths

Example flow chart logic shown

• Start → Input a and b → Process sum = a + b → Output sum → Exit

---

Pseudo code: what it is and how to write it

Concept

• Pseudo code is “fake code” written in a language-agnostic, English-like way.
• It captures the algorithmic logic in steps understandable by developers using different programming languages.

How pseudo code is written in the lecture

• Start step is typically ignored (pseudo code uses step numbering from logic flow)
• Steps for “sum of two numbers”:
  1. Input a and b
  2. Compute sum = a + b
  3. Print sum
  4. Exit
• Pseudo code can be written with minor formatting differences; logic matters more than strict style.

---

Worked DSA logic examples (with key concepts)

1) Minimum of two numbers (uses a decision block)

Goal: Print the smaller of a and b

• Compare via condition:
  • If a < b → print a
  • Else → print b
• Core learning:
  • Decision block determines which output path is taken.
  • Only the chosen minimum value gets printed.

2) Odd or Even (uses modulo operator and a decision)

Goal: Determine whether n is odd or even

• Key logic:
  • Even if n mod 2 == 0
  • Odd otherwise
• Programming concept highlighted:
  • Uses the modulo operator (written like a % b)
  • Equality check in programming uses == (not =)
• Flow chart logic:
  • Start → input n → decision (n % 2 == 0) → print “Even” or “Odd” → exit
• Pseudo code:
  • If (n % 2 == 0) print even; else print odd; exit

3) Sum of numbers from 1 to n (uses looping logic)

Goal: Compute 1 + 2 + ... + n for any n

• Math formula is mentioned as known, but instructor emphasizes:
  • DSA is about logic, not just using formulas
• Logic method:
  • Maintain:
    • sum initialized to 0
    • count starting from 1
  • Repeat:
    • Add count to sum
    • Increment count
  • Stop when count exceeds n
• Flow-chart learning:
  • Loop structure involves:
    • Initialization
    • Process block (sum update)
    • Condition check
    • Repeating until condition fails
• Pseudo code introduces while loop
  • Loop continues while condition is true:
    • “while count <= n” do the work
• Additional shorthand in code discussed:
  • sum += count instead of sum = sum + count
  • count += 1 instead of count = count + 1

4) Prime or Non-prime (uses nested looping idea, explained conceptually)

Goal: Determine if a number n is prime or non-prime

• Instructor’s definition approach:
  • Prime if n has no divisors except 1 and itself
• Key optimization mentioned:
  • Not using the “best possible prime optimization” yet (later lectures will improve),
  • but current method checks divisibility by trying possible factors.
• Logic described:
  • Try dividing n by every i from 2 to n-1
  • If any division yields remainder 0 → non-prime
  • If no division yields remainder 0 → prime
• Loop behavior explained:
  • Main loop iterates i
  • Inside it, a decision checks n % i == 0
• “Dry run” concept is mentioned:
  • Manually simulate steps to verify correctness

---

Homework assigned (from the lecture)

Instructor gives these tasks as homework, requiring flow chart + pseudo code:

1. Simple Interest
   • Inputs: P, R, T
   • Formula: Interest = p * r * t
2. Maximum of two numbers
   • Similar structure to minimum, but choose the larger value
3. Factorial of a number n
   • n! = 1 * 2 * 3 * ... * n
   • Emphasizes loop-based logic
4. Driving License eligibility
   • Yes if age >= 18, otherwise No

---

Installation / setup methodology (what is needed to start coding)

Overall coding workflow taught

• Problem understanding → analyze inputs → write solution → convert to code → run it

Why tools are necessary

• Computers can’t directly run C++ source code; you need:
  • A compiler (translator) to convert C++ into an executable
  • Then the executable runs and produces output

Tools recommended

• Visual Studio Code (VS Code) as the editor
• C++ compiler setup
  • Separate setup guidance for Windows vs Mac (links provided)
• Avoid browser-based coding sites long-term:
  • Recommended to use VS Code for long-term productivity

Where to download

• VS Code download from: visualstudio.com (choose OS version)

Troubleshooting stance

• Installation errors can happen and are “normal”
• If an error occurs:
  • Copy the error text
  • Search for step-by-step fixes online
• Learning DSA is long-term; having proper setup is important for future company interviews.

---

Additional learning consistency system (meta-learning)

• After completing a lecture:
  • Comment “Lecture 1 completed on [date]”
  • Build a sense of achievement and consistency
• “Learning in public” challenge:
  • Share what was learned daily to maintain motivation and track progress

---

Speakers / sources featured

• Shradha Khapra Ma’am (main instructor/speaker)