Psuedocode - Study guides, Revision notes & Summaries

Contains all the exam reference langugae alongside how to write the same in python. For J277 OCR GCSE. I have made this using every revision material possible including yt channels like Mr Brown CS, craig n dave and the actual OCR textbook. For context I attained grade 9 in 2024 for CS.

the depth of recursion is the number of times that a method calls itself the actions that the jvm must perform any time a method is called overhead look at the following psuedocode algorithm Test14(int x) if(x < 8) returns (2*x) else returns (3*Test14(x-8)+8) end Test14 what is the depth of Test14(9) 14 public static int test2(int x, int y) { if (x<y) { return -5 } else { return (test2(x - y, y + 5) + 6); } } what is returned for test2(30, 20)? 1 ...