0478/0984 iGCSE Computer Science Paper 2 - 15 Mark Programming Question Solved | Pseudocode M/J 2024

📌 0478/0984 iGCSE Computer Science – Paper 2: Problem Solving 15 Mark Question (Pseudocode) Video Walkthrough - May/June 2024 Get ready for a 15-mark Paper 2 style question with a full walkthrough focused on problem solving using pseudocode. This video guides you step-by-step through how to analyse, design, and write high-quality pseudocode answers that meet exam mark schemes. 🔹 Skills Covered: ✅ Breaking down complex problems into manageable steps ✅ Writing clear, structured pseudocode using correct conventions ✅ Using selection (IF), iteration (FOR/WHILE), and variables effectively ✅ Maximising marks using examiner tips 📚 Perfect for: ✔️ iGCSE Computer Science (0478/0984) students preparing for Paper 2 ✔️ Students aiming for top marks in problem-solving questions ✔️ Teachers looking for exam-focused walkthroughs 🔔 Subscribe for more exam practice and walkthroughs! ✅ Full Solution here (Angled brackets replaced by words due to YouTube restrictions): // keep asking until Matches is between 1 and 22 REPEAT OUTPUT "How many matches played (max 22)? " INPUT Matches UNTIL Matches MORE THAN EQUAL TO 1 AND Matches LESS THAN EQUAL TO 22 FOR Counter = 1 TO 12 OUTPUT "Enter club name ", Counter INPUT Clubs[Counter] // store name in correct slot ``` // keep asking until W+D+L adds up to Matches REPEAT OUTPUT "Enter won, drawn, lost for ", Clubs[Counter] INPUT Won, Drawn, Lost IF Won + Drawn + Lost NOT EQUAL TO Matches THEN OUTPUT "Total must equal ", Matches, " — try again" ENDIF UNTIL Won + Drawn + Lost = Matches Statistics[Counter, 1] = Won // col 1 = wins Statistics[Counter, 2] = Drawn // col 2 = draws Statistics[Counter, 3] = Lost // col 3 = losses Points[Counter] = Won * 12 + Drawn * 5 // win=12 draw=5 loss=0 ``` NEXT Counter Max = -100 // start below any possible score FOR Maximum = 1 TO 12 IF Points[Maximum] MORE THAN Max THEN Max = Points[Maximum] ENDIF NEXT Maximum Count = 0 FOR TieCheck = 1 TO 12 IF Points[TieCheck] = Max THEN // handles ties Count = Count + 1 TieIndex[Count] = TieCheck // remember which club ENDIF NEXT TieCheck FOR OutLoop = 1 TO Count OUTPUT "Winner: ", Clubs[TieIndex[OutLoop]] OUTPUT "Wins: ", Statistics[TieIndex[OutLoop], 1] NEXT OutLoop OUTPUT "Points total: ", Max // output once after the loop #iGCSEComputerScience #0478 #0984 #Pseudocode #ProblemSolving #ExamPractice