{"id":38269,"date":"2026-04-13T15:10:27","date_gmt":"2026-04-13T08:10:27","guid":{"rendered":"https:\/\/times.edu.vn\/?p=38269"},"modified":"2026-05-08T15:50:27","modified_gmt":"2026-05-08T08:50:27","slug":"igcse-pseudocode-and-flowchart","status":"publish","type":"post","link":"https:\/\/times.edu.vn\/en\/igcse\/igcse-pseudocode-and-flowchart\/","title":{"rendered":"IGCSE Pseudocode &#038; Flowchart 0478: Symbols + Algorithm Conversion"},"content":{"rendered":"<p><strong><a href=\"https:\/\/times.edu.vn\/en\/igcse\/what-is-igcse-a-comprehensive-guide-for-students\/\">IGCSE<\/a><\/strong><strong>\u00a0pseudocode flowcharts<\/strong>\u00a0help you translate an algorithm\u2019s program logic into a clear visual plan before coding.<\/p>\n<p>To answer the keyword directly: <strong>A<\/strong><strong>n IGCSE pseudocode flowchart is a flowchart diagram drawn from IGCSE-style pseudocode<\/strong>, mapping INPUT\/OUTPUT symbols, assignment (process boxes), selection (decision boxes), and iteration (loop-back arrows).<\/p>\n<p>The safest method is line-by-line conversion using standard symbols, then verifying correctness with trace tables.<\/p>\n<p>This approach reduces common exam errors like missing branch joins, incorrect loop conditions, and wrong symbol use.<\/p>\n<h2><strong>Converting IGCSE Pseudocode To Flowchart Diagrams<\/strong><\/h2>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter size-full wp-image-38301\" src=\"https:\/\/times.edu.vn\/wp-content\/uploads\/2026\/04\/3-14.webp\" alt=\"IGCSE Pseudocode and Flowchart 2026: A Simple Guide to Solving Logic Questions with Confidence\" width=\"1000\" height=\"558\" srcset=\"https:\/\/times.edu.vn\/wp-content\/uploads\/2026\/04\/3-14.webp 1000w, https:\/\/times.edu.vn\/wp-content\/uploads\/2026\/04\/3-14-300x167.webp 300w, https:\/\/times.edu.vn\/wp-content\/uploads\/2026\/04\/3-14-768x429.webp 768w\" sizes=\"auto, (max-width: 1000px) 100vw, 1000px\" \/><\/p>\n<p>IGCSE <strong>pseudocode and flowcharts<\/strong>\u00a0are two exam-friendly ways to express an <strong>algorithm<\/strong>: The step-by-step <strong>program logic<\/strong>\u00a0you would use to solve a problem before writing code.<\/p>\n<p>In <strong>Computer Science 0478\/0984<\/strong>, examiners want to see that you can model a solution clearly, not that you can \u201cguess\u201d a programming language\u2019s syntax.<\/p>\n<p>Based on our years of practical tutoring at Times Edu, students improve fastest when they treat <strong>IGCSE pseudocode flowchart<\/strong>\u00a0work as translation, not drawing. Your job is to convert text-based logic (pseudocode) into visual logic (flowchart) while preserving the exact control flow: <strong>S<\/strong><strong>equence<\/strong>, <strong>selection<\/strong>, and <strong>iteration<\/strong>.<\/p>\n<h3><strong>A reliable conversion workflow (the one we teach)<\/strong><\/h3>\n<p>Use this repeatable process every time you convert IGCSE pseudocode to a flowchart:<\/p>\n<p><strong>Step 1: Identify the structure type<\/strong><\/p>\n<ul>\n<li>Mark each line as <strong>Assignment<\/strong>, <strong>Input\/Output<\/strong>, <strong>Selection<\/strong>, or <strong>Iteration<\/strong>.<\/li>\n<\/ul>\n<p><strong>Step 2: Draw the backbone first<\/strong><\/p>\n<ul>\n<li>Start \u2192 main sequence of process boxes \u2192 End. Leave space for branches and loops.<\/li>\n<\/ul>\n<p><strong>Step 3: Add decision points<\/strong><\/p>\n<ul>\n<li>Each IF or loop condition becomes a <strong>Decision box<\/strong>\u00a0(diamond).<\/li>\n<\/ul>\n<p><strong>Step 4: Attach the branches<\/strong><\/p>\n<ul>\n<li>YES\/NO (or TRUE\/FALSE) must be labelled consistently.<\/li>\n<\/ul>\n<p><strong>Step 5: Dry run using trace tables<\/strong><\/p>\n<ul>\n<li>If the flowchart cannot be traced cleanly, the logic is not exam-safe.<\/li>\n<\/ul>\n<p>A critical detail most students overlook in the 2026 exam cycle is that many mark schemes reward clarity of logic\u00a0more than artistic diagramming.<\/p>\n<p>A neat flowchart that misroutes arrows still loses marks, while a simple diagram that correctly implements <strong>selection<\/strong>\u00a0and <strong>iteration<\/strong>\u00a0can score highly.<\/p>\n<h3><strong>Pseudocode-to-flowchart mapping table<\/strong><\/h3>\n<p>Use this as your translation dictionary.<\/p>\n<table>\n<tbody>\n<tr>\n<th colspan=\"1\" rowspan=\"1\"><strong>Pseudocode feature (0478)<\/strong><\/th>\n<th colspan=\"1\" rowspan=\"1\"><strong>Meaning<\/strong><\/th>\n<th colspan=\"1\" rowspan=\"1\"><strong>Flowchart equivalent<\/strong><\/th>\n<\/tr>\n<tr>\n<td colspan=\"1\" rowspan=\"1\">INPUT x<\/td>\n<td colspan=\"1\" rowspan=\"1\">Read a value<\/td>\n<td colspan=\"1\" rowspan=\"1\">Parallelogram (Input\/Output symbols)<\/td>\n<\/tr>\n<tr>\n<td colspan=\"1\" rowspan=\"1\">OUTPUT y\u00a0\/ PRINT y<\/td>\n<td colspan=\"1\" rowspan=\"1\">Display a value<\/td>\n<td colspan=\"1\" rowspan=\"1\">Parallelogram (Input\/Output symbols)<\/td>\n<\/tr>\n<tr>\n<td colspan=\"1\" rowspan=\"1\">Total &lt;- Total + Score<\/td>\n<td colspan=\"1\" rowspan=\"1\">Assignment\/update<\/td>\n<td colspan=\"1\" rowspan=\"1\">Rectangle (Process)<\/td>\n<\/tr>\n<tr>\n<td colspan=\"1\" rowspan=\"1\">IF condition THEN &#8230; ELSE &#8230; ENDIF<\/td>\n<td colspan=\"1\" rowspan=\"1\">Selection<\/td>\n<td colspan=\"1\" rowspan=\"1\">Diamond (Decision boxes) + two branches<\/td>\n<\/tr>\n<tr>\n<td colspan=\"1\" rowspan=\"1\">WHILE condition DO &#8230; ENDWHILE<\/td>\n<td colspan=\"1\" rowspan=\"1\">Pre-test iteration<\/td>\n<td colspan=\"1\" rowspan=\"1\">Diamond with loop-back arrow<\/td>\n<\/tr>\n<tr>\n<td colspan=\"1\" rowspan=\"1\">REPEAT &#8230; UNTIL condition<\/td>\n<td colspan=\"1\" rowspan=\"1\">Post-test iteration<\/td>\n<td colspan=\"1\" rowspan=\"1\">Loop body then decision at end<\/td>\n<\/tr>\n<tr>\n<td colspan=\"1\" rowspan=\"1\">FOR i &lt;- 1 TO 10 &#8230; NEXT i<\/td>\n<td colspan=\"1\" rowspan=\"1\">Count-controlled iteration<\/td>\n<td colspan=\"1\" rowspan=\"1\">Process (init\/update) + decision\/loop-back<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>If you keep the mapping consistent, your <strong>IGCSE pseudocode flowchart<\/strong>\u00a0conversions become mechanical and fast.<\/p>\n<p><strong style=\"color: #f00;\">&gt;&gt;&gt; Read more:<\/strong> <a class=\"xem-them-link\" href=\"https:\/\/times.edu.vn\/en\/igcse\/igcse-ict-vs-computer-science\/\">IGCSE ICT vs Computer Science<\/a> 2026: What\u2019s the Difference and Which Should You Choose?<\/p>\n<h2><strong>Standard Flowchart Symbols For Computer Science<\/strong><\/h2>\n<p>Flowcharts in IGCSE are judged on correctness and symbol discipline. You are expected to use standard <strong>Input\/Output symbols<\/strong>\u00a0and correct <strong>Decision boxes<\/strong>, not random shapes.<\/p>\n<h3><strong>Core symbol set you should memorise<\/strong><\/h3>\n<table>\n<tbody>\n<tr>\n<th colspan=\"1\" rowspan=\"1\"><strong>Symbol<\/strong><\/th>\n<th colspan=\"1\" rowspan=\"1\"><strong>Name<\/strong><\/th>\n<th colspan=\"1\" rowspan=\"1\"><strong>What it represents<\/strong><\/th>\n<th colspan=\"1\" rowspan=\"1\"><strong>Common exam use<\/strong><\/th>\n<\/tr>\n<tr>\n<td colspan=\"1\" rowspan=\"1\">Oval<\/td>\n<td colspan=\"1\" rowspan=\"1\">Terminal<\/td>\n<td colspan=\"1\" rowspan=\"1\">Start \/ End<\/td>\n<td colspan=\"1\" rowspan=\"1\">Begin and finish the algorithm<\/td>\n<\/tr>\n<tr>\n<td colspan=\"1\" rowspan=\"1\">Parallelogram<\/td>\n<td colspan=\"1\" rowspan=\"1\">Input\/Output<\/td>\n<td colspan=\"1\" rowspan=\"1\">Read or display data<\/td>\n<td colspan=\"1\" rowspan=\"1\">INPUT, OUTPUT, PRINT<\/td>\n<\/tr>\n<tr>\n<td colspan=\"1\" rowspan=\"1\">Rectangle<\/td>\n<td colspan=\"1\" rowspan=\"1\">Process<\/td>\n<td colspan=\"1\" rowspan=\"1\">Calculation or assignment<\/td>\n<td colspan=\"1\" rowspan=\"1\">x &lt;- X\u00a0+ 1, compute totals, set flags<\/td>\n<\/tr>\n<tr>\n<td colspan=\"1\" rowspan=\"1\">Diamond<\/td>\n<td colspan=\"1\" rowspan=\"1\">Decision<\/td>\n<td colspan=\"1\" rowspan=\"1\">A test that branches<\/td>\n<td colspan=\"1\" rowspan=\"1\">IF, loop condition tests<\/td>\n<\/tr>\n<tr>\n<td colspan=\"1\" rowspan=\"1\">Arrow<\/td>\n<td colspan=\"1\" rowspan=\"1\">Flow line<\/td>\n<td colspan=\"1\" rowspan=\"1\">Direction of control flow<\/td>\n<td colspan=\"1\" rowspan=\"1\">Shows sequence, loop-back, branch joining<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>From our direct experience with international school curricula, the biggest symbol mistake is students using rectangles for INPUT\u00a0and OUTPUT. That is treated as a logic representation error in many mark schemes, especially when the question explicitly asks for a flowchart.<\/p>\n<h3><strong>Labels are not decoration<\/strong><\/h3>\n<p>Your diamond must contain a Boolean test, not an action. These are exam-safe:<\/p>\n<ul>\n<li>Score &gt;= 50?<\/li>\n<li>Name = &#8220;Admin&#8221;?<\/li>\n<li>Count &lt; 10?<\/li>\n<\/ul>\n<p>These are not exam-safe:<\/p>\n<ul>\n<li>Add Score<\/li>\n<li>Print Result<\/li>\n<li>Total &lt;- Total + Score<\/li>\n<\/ul>\n<p>Also, label branches clearly as <strong>YES\/NO<\/strong>\u00a0or <strong>TRUE\/FALSE<\/strong>. Do not switch labels mid-diagram.<\/p>\n<h3><strong>Where students lose \u201ceasy marks\u201d<\/strong><\/h3>\n<ul>\n<li>Missing <strong>Start<\/strong>\u00a0or <strong>End<\/strong>\u00a0terminal.<\/li>\n<li>Arrows that do not clearly show direction.<\/li>\n<li>Decision branches that never re-join or end.<\/li>\n<li>Multiple arrows entering a process box without a clear join path.<\/li>\n<\/ul>\n<p>The pedagogical approach we recommend for high-achievers is to treat flowcharts like proof-writing: Every arrow is a claim about program flow, and your diagram must be internally consistent.<\/p>\n<p><strong style=\"color: #f00;\">&gt;&gt;&gt; Read more:<\/strong> <a class=\"xem-them-link\" href=\"https:\/\/times.edu.vn\/en\/igcse\/igcse-ict-practical-accuracy\/\">IGCSE ICT Practical Accuracy<\/a> 2026: How to Reduce Small Errors and Score More Consistently<\/p>\n<h2><strong>Mapping Selection And Iteration In Visual Logic<\/strong><\/h2>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter size-full wp-image-38303\" src=\"https:\/\/times.edu.vn\/wp-content\/uploads\/2026\/04\/4-14.webp\" alt=\"IGCSE Pseudocode and Flowchart 2026: A Simple Guide to Solving Logic Questions with Confidence\" width=\"1000\" height=\"558\" srcset=\"https:\/\/times.edu.vn\/wp-content\/uploads\/2026\/04\/4-14.webp 1000w, https:\/\/times.edu.vn\/wp-content\/uploads\/2026\/04\/4-14-300x167.webp 300w, https:\/\/times.edu.vn\/wp-content\/uploads\/2026\/04\/4-14-768x429.webp 768w\" sizes=\"auto, (max-width: 1000px) 100vw, 1000px\" \/><\/p>\n<p>Selection and iteration are where most algorithm marks live. If you can visualize them cleanly, you can also explain them cleanly in pseudocode.<\/p>\n<h3><strong>Selection (IF \/ IF-ELSE \/ Nested IF)<\/strong><\/h3>\n<p><strong>Simple IF (single branch)<\/strong><\/p>\n<p>Pseudocode:<\/p>\n<ul>\n<li>IF x &gt; 0 THEN<\/li>\n<li>OUTPUT &#8220;Positive&#8221;<\/li>\n<li>ENDIF<\/li>\n<li>OUTPUT &#8220;Done&#8221;<\/li>\n<\/ul>\n<p>Flowchart logic:<\/p>\n<ul>\n<li>Decision: X\u00a0&gt; 0?<\/li>\n<li>YES: Output \u201cPositive\u201d<\/li>\n<li>NO: Skip to next step<\/li>\n<li>Then continue to Output \u201cDone\u201d<\/li>\n<\/ul>\n<p><strong>Common misconception:<\/strong>\u00a0Students think the NO branch must do something. In a simple IF, NO can just continue.<\/p>\n<p><strong>IF-ELSE (two branches)<\/strong><\/p>\n<p>Pseudocode:<\/p>\n<ul>\n<li>IF mark &gt;= 50 THEN<\/li>\n<li>OUTPUT &#8220;Pass&#8221;<\/li>\n<li>ELSE<\/li>\n<li>OUTPUT &#8220;Fail&#8221;<\/li>\n<li>ENDIF<\/li>\n<\/ul>\n<p>Flowchart:<\/p>\n<ul>\n<li>Decision: Mark &gt;= 50?<\/li>\n<li>YES \u2192 Output \u201cPass\u201d<\/li>\n<li>NO \u2192 Output \u201cFail\u201d<\/li>\n<li>Branches must re-join before the next step.<\/li>\n<\/ul>\n<p><strong>Nested selection<\/strong><\/p>\n<p>Nested IF means a decision inside a branch. The diagram should show a second diamond placed along the relevant branch, not \u201cstacked\u201d randomly.<\/p>\n<h3><strong>Iteration (loops) that examiners love<\/strong><\/h3>\n<p><strong>WHILE loop (pre-test iteration)<\/strong><\/p>\n<p>Pseudocode:<\/p>\n<ul>\n<li>WHILE count &lt; 5 DO<\/li>\n<li>INPUT score<\/li>\n<li>Total &lt;- Total + score<\/li>\n<li>Count &lt;- Count + 1<\/li>\n<li>ENDWHILE<\/li>\n<\/ul>\n<p>Flowchart pattern:<\/p>\n<ul>\n<li>Decision at top: Count &lt; 5?<\/li>\n<li>YES \u2192 loop body (Input, Assignment, update)<\/li>\n<li>Arrow returns to the same decision<\/li>\n<li>NO \u2192 exit to next step<\/li>\n<\/ul>\n<p><strong>REPEAT UNTIL loop (post-test iteration)<\/strong><\/p>\n<p>Pseudocode:<\/p>\n<ul>\n<li>REPEAT<\/li>\n<li>INPUT password<\/li>\n<li>UNTIL password = &#8220;TimesEdu&#8221;<\/li>\n<\/ul>\n<p>Flowchart pattern:<\/p>\n<ul>\n<li>Body first (Input)<\/li>\n<li>Decision at bottom: Password = &#8220;TimesEdu&#8221;?<\/li>\n<li>YES \u2192 exit<\/li>\n<li>NO \u2192 arrow back to the body<\/li>\n<\/ul>\n<p><strong>FOR loop (count-controlled iteration)<\/strong><\/p>\n<p>In flowcharts, FOR loops are usually represented using:<\/p>\n<ul>\n<li>A process box to initialise i<\/li>\n<li>A decision diamond for the continuation condition<\/li>\n<li>A process box for update i &lt;- I\u00a0+ 1<br \/>\nThis is still valid <strong>program logic<\/strong>\u00a0as long as the count behaviour matches the pseudocode.<\/li>\n<\/ul>\n<h3><strong>A quick visual logic checklist<\/strong><\/h3>\n<p>When you finish a selection or iteration section, validate with these checks:<\/p>\n<ul>\n<li>Each <strong>Decision box<\/strong>\u00a0has exactly two exits (YES\/NO).<\/li>\n<li>Every exit either reaches an End, rejoins, or loops back correctly.<\/li>\n<li>No \u201cdead ends\u201d exist unless End is intended.<\/li>\n<li>Loop variables are updated inside the loop body (Assignment is visible).<\/li>\n<\/ul>\n<p><strong style=\"color: #f00;\">&gt;&gt;&gt; Read more:<\/strong> <a class=\"xem-them-link\" href=\"https:\/\/times.edu.vn\/en\/igcse\/igcse-computer-science-pseudocode-the-must-know-syntax-and-exam-tips\/\">IGCSE Computer Science Pseudocode<\/a> 2026: The Must-Know Syntax and Exam Tips<\/p>\n<h2><strong>Common Errors When Drawing Flowcharts From Pseudocode<\/strong><\/h2>\n<p>Based on our years of practical tutoring at Times Edu, these mistakes appear repeatedly in mock exams and explain why strong students sometimes underperform.<\/p>\n<h3><strong>Error 1: Changing the algorithm while \u201csimplifying\u201d<\/strong><\/h3>\n<p>Students rewrite conditions because they think it looks cleaner. That changes the <strong>algorithm<\/strong>.<\/p>\n<p>Example:<\/p>\n<ul>\n<li>Pseudocode: IF x &gt; 10 THEN<\/li>\n<li>Student draws: IF x &gt;= 10?<br \/>\nThat is not equivalent, and examiners treat it as a logic error.<\/li>\n<\/ul>\n<h3><strong>Error 2: Confusing data movement with control flow<\/strong><\/h3>\n<ul>\n<li>Input\/Output symbols show data interaction.<\/li>\n<li>Arrows show execution order.<\/li>\n<\/ul>\n<p>If you draw a correct parallelogram but connect arrows that skip key steps, your flowchart is wrong.<\/p>\n<h3><strong>Error 3: Missing loop-back arrow<\/strong><\/h3>\n<p>A WHILE flowchart without the loop-back arrow is not iteration. It becomes a one-time IF.<\/p>\n<h3><strong>Error 4: Decision diamond contains actions<\/strong><\/h3>\n<p>Decision boxes must contain a test. Actions belong in process boxes or I\/O symbols.<\/p>\n<h3><strong>Error 5: Branches do not re-join<\/strong><\/h3>\n<p>For IF-ELSE, both branches must merge before the next shared step. If they don\u2019t, the algorithm paths become inconsistent.<\/p>\n<h3><strong>Error 6: Not using trace tables to verify<\/strong><\/h3>\n<p>A flowchart is an executable idea. If you cannot trace it with sample inputs, it is not exam-safe.<\/p>\n<h4><strong>The dry-run method (fast and mark-scheme aligned)<\/strong><\/h4>\n<p>Create a small <strong>trace table<\/strong>\u00a0with columns:<\/p>\n<ul>\n<li>Inputs<\/li>\n<li>Key variables (e.g., count, Total, score)<\/li>\n<li>Outputs<\/li>\n<\/ul>\n<p>Then simulate the flowchart arrow by arrow. This exposes off-by-one loop errors and missing assignments.<\/p>\n<p><strong style=\"color: #f00;\">&gt;&gt;&gt; Read more:<\/strong> <a class=\"xem-them-link\" href=\"https:\/\/times.edu.vn\/en\/igcse\/igcse-ict-0417-practical\/\">IGCSE ICT 0417 Practical Revision Guide<\/a> 2026: What to Practice, What to Memorize<\/p>\n<h2><strong>Grade strategy: How this topic impacts your result and subject profile<\/strong><\/h2>\n<p>From our direct experience with international school curricula, <strong>Algorithms and problem-solving<\/strong>\u00a0questions in Computer Science 0478 are a differentiator because they test transferable thinking, not memorisation.<\/p>\n<p>Strong performance here lifts your Paper performance because selection, iteration, and trace-based reasoning reappear across multiple question styles.<\/p>\n<p>A critical detail most students overlook in the 2026 exam cycle is that boundary outcomes are often decided by consistency on \u201cmedium-mark\u201d algorithm questions. Losing 4\u20138 marks through flowchart technicalities (symbols, branch joins, loop-back arrows) is a common pattern we see in scripts that otherwise look strong.<\/p>\n<p>If you are also building a competitive overseas application profile, subject selection matters. Computer Science pairs well with Mathematics and higher-level analytical subjects when targeting STEM pathways, while students aiming for business or economics can still leverage CS as evidence of structured reasoning and problem-solving.<\/p>\n<p>The optimal decision depends on your target universities, intended major, and how your grades trend across assessment types.<\/p>\n<p><strong style=\"color: #f00;\">&gt;&gt;&gt; Read more:<\/strong> <a class=\"xem-them-link\" href=\"https:\/\/times.edu.vn\/en\/igcse\/igcse-tutor\/\">IGCSE Tutor<\/a> 2026: How to Choose the Right One<\/p>\n<h2><strong>Frequently Asked Questions<\/strong><\/h2>\n<div class=\"hoi-dap-thok-new low-faq\">\n<div class=\"thong-tin-dai\">\n<p class=\"tit-dai\"><strong>How do you turn pseudocode into a flowchart?<\/strong><\/p>\n<div class=\"chi-tiet-thong-tin\">\n<p>Convert line-by-line using a fixed mapping: INPUT\/OUTPUT\u00a0\u2192 <strong>Input\/Output symbols<\/strong>, assignments \u2192 <strong>process rectangles<\/strong>, and any IF\u00a0or loop condition \u2192 <strong>Decision boxes<\/strong>.Draw the main sequence first, then add branches and loop-back arrows. Validate the result by dry running with <strong>trace tables<\/strong>\u00a0to confirm the <strong>program logic<\/strong>\u00a0matches the original algorithm.<\/p>\n<\/div>\n<\/div>\n<div class=\"thong-tin-dai\">\n<p class=\"tit-dai\"><strong>What are the standard flowchart symbols for IGCSE?<\/strong><\/p>\n<div class=\"chi-tiet-thong-tin\">\n<p>IGCSE expects a small standard set: <strong>Terminal (Start\/End oval)<\/strong>, <strong>Input\/Output parallelogram<\/strong>, <strong>Process rectangle<\/strong>\u00a0for calculations and <strong>assignment<\/strong>, <strong>Decision diamond<\/strong>\u00a0for selection and loop conditions, and <strong>flow arrows<\/strong>\u00a0to show direction.Correct use of these <strong>Input\/Output symbols<\/strong>\u00a0and decision diamonds is a frequent marking point in Computer Science 0478\/0984.<\/p>\n<\/div>\n<\/div>\n<div class=\"thong-tin-dai\">\n<p class=\"tit-dai\"><strong>How do you represent a loop in a flowchart?<\/strong><\/p>\n<div class=\"chi-tiet-thong-tin\">\n<p>A loop is represented using a <strong>Decision box<\/strong>\u00a0that controls repetition plus a <strong>loop-back arrow<\/strong>\u00a0that returns execution to the condition (WHILE) or back to the loop body (REPEAT UNTIL).For count-controlled iteration (FOR), show initialisation, a continuation test, and an update step so the iteration count is explicit and traceable.<\/p>\n<\/div>\n<\/div>\n<div class=\"thong-tin-dai\">\n<p class=\"tit-dai\"><strong>What is the difference between pseudocode and flowcharts?<\/strong><\/p>\n<div class=\"chi-tiet-thong-tin\">Pseudocode is text-based, structured English that expresses an <strong>algorithm<\/strong>\u00a0with keywords like INPUT, IF, and WHILE. Flowcharts are visual diagrams using standard symbols to show <strong>program logic<\/strong>\u00a0and execution flow. In exams, pseudocode is often better for precision, while flowcharts help communicate complex branching and iteration at a glance.<\/div>\n<\/div>\n<div class=\"thong-tin-dai\">\n<p class=\"tit-dai\"><strong>How do you represent an IF statement in a flowchart?<\/strong><\/p>\n<div class=\"chi-tiet-thong-tin\">An IF statement is a <strong>Decision box<\/strong>\u00a0containing the Boolean condition, with two labelled exits: YES\/NO (or TRUE\/FALSE). For IF-ELSE, each branch contains its own actions and then both branches re-join before the next shared step. This visual structure directly represents <strong>selection<\/strong>.<\/div>\n<\/div>\n<div class=\"thong-tin-dai\">\n<p class=\"tit-dai\"><strong>What are the IGCSE rules for pseudocode syntax?<\/strong><\/p>\n<div class=\"chi-tiet-thong-tin\">\n<p>IGCSE pseudocode focuses on readable structure over real programming syntax. You should use standard keywords (INPUT, OUTPUT, IF\u2026THEN\u2026ELSE\u2026ENDIF, WHILE\u2026DO\u2026ENDWHILE, FOR\u2026TO\u2026NEXT) and clear <strong>assignment<\/strong>\u00a0notation such as &lt;-.Variables should be used consistently, and conditions must be explicit so the examiner can follow the intended program logic.<\/p>\n<\/div>\n<\/div>\n<div class=\"thong-tin-dai\">\n<p class=\"tit-dai\"><strong>How do you dry run a flowchart with a trace table?<\/strong><\/p>\n<div class=\"chi-tiet-thong-tin\">\n<p>Choose 2\u20133 representative test inputs, then create a <strong>trace table<\/strong>\u00a0with columns for each important variable and outputs.Follow the flowchart arrows step-by-step, updating the table at every <strong>assignment<\/strong>, and recording output whenever you pass an Input\/Output symbol.<\/p>\n<p>If the trace table reveals a variable that never changes inside an iteration, or outputs that happen in the wrong branch, the flowchart logic needs correction.<\/p>\n<\/div>\n<\/div>\n<\/div>\n<h4>Conclusion<\/h4>\n<p>Based on our years of practical tutoring at <a href=\"https:\/\/times.edu.vn\/en\/\">Times Edu<\/a>, the fastest route is a short, high-frequency practice cycle:<\/p>\n<ul>\n<li>10 Minutes converting pseudocode to flowchart<\/li>\n<li>10 Minutes converting flowchart back to pseudocode<\/li>\n<li>10 Minutes dry running using trace tables<\/li>\n<\/ul>\n<p>Do this 3\u20134 times per week for 3 weeks and your error rate drops sharply, especially on selection and iteration.<\/p>\n<p>If you want a personalized academic plan for Computer Science 0478\/0984 (plus a subject combination strategy that supports your overseas application), Times Edu can map a tailored roadmap based on your current school curriculum, target grade, and university direction.<\/p>\n\n\n<div class=\"kk-star-ratings kksr-auto kksr-align-right kksr-valign-bottom\"\n    data-payload='{&quot;align&quot;:&quot;right&quot;,&quot;id&quot;:&quot;38269&quot;,&quot;slug&quot;:&quot;default&quot;,&quot;valign&quot;:&quot;bottom&quot;,&quot;ignore&quot;:&quot;&quot;,&quot;reference&quot;:&quot;auto&quot;,&quot;class&quot;:&quot;&quot;,&quot;count&quot;:&quot;1&quot;,&quot;legendonly&quot;:&quot;&quot;,&quot;readonly&quot;:&quot;&quot;,&quot;score&quot;:&quot;5&quot;,&quot;starsonly&quot;:&quot;&quot;,&quot;best&quot;:&quot;5&quot;,&quot;gap&quot;:&quot;5&quot;,&quot;greet&quot;:&quot;\u0110\u00e1nh gi\u00e1 b\u00e0i vi\u1ebft&quot;,&quot;legend&quot;:&quot;5\\\/5 - (1 vote)&quot;,&quot;size&quot;:&quot;24&quot;,&quot;title&quot;:&quot;IGCSE Pseudocode \\u0026amp; Flowchart 0478: Symbols + Algorithm Conversion&quot;,&quot;width&quot;:&quot;142.5&quot;,&quot;_legend&quot;:&quot;{score}\\\/{best} - ({count} {votes})&quot;,&quot;font_factor&quot;:&quot;1.25&quot;}'>\n            \n<div class=\"kksr-stars\">\n    \n<div class=\"kksr-stars-inactive\">\n            <div class=\"kksr-star\" data-star=\"1\" style=\"padding-right: 5px\">\n            \n\n<div class=\"kksr-icon\" style=\"width: 24px; height: 24px;\"><\/div>\n        <\/div>\n            <div class=\"kksr-star\" data-star=\"2\" style=\"padding-right: 5px\">\n            \n\n<div class=\"kksr-icon\" style=\"width: 24px; height: 24px;\"><\/div>\n        <\/div>\n            <div class=\"kksr-star\" data-star=\"3\" style=\"padding-right: 5px\">\n            \n\n<div class=\"kksr-icon\" style=\"width: 24px; height: 24px;\"><\/div>\n        <\/div>\n            <div class=\"kksr-star\" data-star=\"4\" style=\"padding-right: 5px\">\n            \n\n<div class=\"kksr-icon\" style=\"width: 24px; height: 24px;\"><\/div>\n        <\/div>\n            <div class=\"kksr-star\" data-star=\"5\" style=\"padding-right: 5px\">\n            \n\n<div class=\"kksr-icon\" style=\"width: 24px; height: 24px;\"><\/div>\n        <\/div>\n    <\/div>\n    \n<div class=\"kksr-stars-active\" style=\"width: 142.5px;\">\n            <div class=\"kksr-star\" style=\"padding-right: 5px\">\n            \n\n<div class=\"kksr-icon\" style=\"width: 24px; height: 24px;\"><\/div>\n        <\/div>\n            <div class=\"kksr-star\" style=\"padding-right: 5px\">\n            \n\n<div class=\"kksr-icon\" style=\"width: 24px; height: 24px;\"><\/div>\n        <\/div>\n            <div class=\"kksr-star\" style=\"padding-right: 5px\">\n            \n\n<div class=\"kksr-icon\" style=\"width: 24px; height: 24px;\"><\/div>\n        <\/div>\n            <div class=\"kksr-star\" style=\"padding-right: 5px\">\n            \n\n<div class=\"kksr-icon\" style=\"width: 24px; height: 24px;\"><\/div>\n        <\/div>\n            <div class=\"kksr-star\" style=\"padding-right: 5px\">\n            \n\n<div class=\"kksr-icon\" style=\"width: 24px; height: 24px;\"><\/div>\n        <\/div>\n    <\/div>\n<\/div>\n                \n\n<div class=\"kksr-legend\" style=\"font-size: 19.2px;\">\n            5\/5 - (1 vote)    <\/div>\n    <\/div>\n","protected":false},"excerpt":{"rendered":"<p>IGCSE\u00a0pseudocode flowcharts\u00a0help you translate an algorithm\u2019s program logic into a clear visual plan before coding. To answer the keyword directly: An IGCSE pseudocode flowchart is a flowchart diagram drawn from IGCSE-style pseudocode, mapping INPUT\/OUTPUT symbols, assignment (process boxes), selection (decision boxes), and iteration (loop-back arrows). The safest method is line-by-line conversion using standard symbols, then &#8230; <a title=\"IGCSE Pseudocode &#038; Flowchart 0478: Symbols + Algorithm Conversion\" class=\"read-more\" href=\"https:\/\/times.edu.vn\/en\/igcse\/igcse-pseudocode-and-flowchart\/\" aria-label=\"Read more about IGCSE Pseudocode &#038; Flowchart 0478: Symbols + Algorithm Conversion\">Read more<\/a><\/p>\n","protected":false},"author":7,"featured_media":38277,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"content-type":"","rank_math_title":"","rank_math_description":"IGCSE Computer Science 0478 pseudocode & flowchart guide: standard symbols, converting algorithms, selection vs iteration. A* exam strategy with worked examples.","footnotes":""},"categories":[166],"tags":[],"class_list":["post-38269","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-igcse"],"_links":{"self":[{"href":"https:\/\/times.edu.vn\/en\/wp-json\/wp\/v2\/posts\/38269","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/times.edu.vn\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/times.edu.vn\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/times.edu.vn\/en\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/times.edu.vn\/en\/wp-json\/wp\/v2\/comments?post=38269"}],"version-history":[{"count":3,"href":"https:\/\/times.edu.vn\/en\/wp-json\/wp\/v2\/posts\/38269\/revisions"}],"predecessor-version":[{"id":39557,"href":"https:\/\/times.edu.vn\/en\/wp-json\/wp\/v2\/posts\/38269\/revisions\/39557"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/times.edu.vn\/en\/wp-json\/wp\/v2\/media\/38277"}],"wp:attachment":[{"href":"https:\/\/times.edu.vn\/en\/wp-json\/wp\/v2\/media?parent=38269"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/times.edu.vn\/en\/wp-json\/wp\/v2\/categories?post=38269"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/times.edu.vn\/en\/wp-json\/wp\/v2\/tags?post=38269"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}