TECHNIQUE’S ALGORITHM, FLOWCHART AND PSEUDOCODE | PPS | LECTURE 06 BY MR. SHARVAN KUMAR | AKGEC

TECHNIQUE’S ALGORITHM, FLOWCHART AND PSEUDOCODE | PPS | LECTURE 06 BY MR. SHARVAN KUMAR | AKGEC

by Mr. Sharvan Kumar · View the channel on PSI

Formal & Physical Sciences Computing & Cybersecurity UMComputer programmingUMBAlgorithms and data structures
🎙 Mr. Sharvan Kumar 👥 23K 📅 October 12, 2026 ⏱ 24 min 👁 23 📄 tutorial 🧭 2026-10-12
Available in: English (current) Français

Keywords

algorithmflowchartpseudocodeproblem solvingprogramming

Summary

This lecture by Mr. Sharvan Kumar from AKGEC introduces fundamental problem-solving techniques in computer science. It begins by defining an algorithm as a sequence of steps to solve a problem, and discusses its key properties: finiteness, definiteness, input, output, and effectiveness. Several examples are given, including making noodles, printing good morning, computing rectangle area, and checking voting eligibility. The video then explains flowcharts as diagrammatic representations of algorithms, detailing standard symbols (terminal, process, decision, input/output, etc.) as per ANSI and ISO standards. It covers advantages and limitations of flowcharts, and provides examples like calculating simple interest and finding the bigger of three numbers. Pseudocode is introduced as an informal, human-readable way to write algorithms, with common conventions for input, output, conditionals, and loops. The lecture concludes with a comparison of algorithm, flowchart, and pseudocode, emphasizing sequence, branching, and looping control structures. Overall, it serves as a solid foundation for beginners in programming.

152 words

Critical Evaluation

Value of the Information & Strength of the Argument

The video effectively explains core concepts with clear definitions and concrete examples, making the material accessible. The argumentation is straightforward, building from algorithm properties to flowchart symbols and pseudocode conventions. However, it does not critically evaluate different approaches or discuss edge cases in depth. The logical flow is coherent, and the examples reinforce understanding.

Scientific Rigor, Source Quality, Title Accuracy

The lecture relies on widely accepted definitions and standards (ANSI/ISO symbols) without offering external citations. The title matches the content well. The presentation is systematic, but the lack of references reduces the ability to verify specific claims. Since no comments are provided, public reception cannot be assessed.

116 words

Title / Content Match

The title accurately reflects the lecture's content, covering algorithm, flowchart, and pseudocode.

Quality & Reliability

7/10

The lecture provides clear, standard explanations of algorithms, flowcharts, and pseudocode, based on established computer science concepts. However, it lacks citations or references to specific sources, and the depth is introductory.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

Concurring Sources

Contribution & Novelties

This video offers a clear, structured introduction to algorithm, flowchart, and pseudocode for beginners. It systematically lists properties of algorithms and flowchart symbols, and provides multiple worked examples. While not presenting new research, it serves as a useful educational resource for students learning programming fundamentals.

Pour aller plus loin:

  • Algorithm — Foundational concept explained in detail.
  • Flowchart — Symbol conventions and examples.
  • Pseudocode — Conventions and usage in programming.
  • Donald Knuth — Author of The Art of Computer Programming, which defines algorithm properties.

83 words

Radar Profile

The radar profile shows a balanced but modest assessment, with higher scores for information quantity and quality, moderate technical level, and overall reliability. This reflects a solid introductory tutorial with no outstanding weaknesses but also no deep innovation.

Reliability 7/10