Hey sir can you please make video on recersion for my alevels exam ? Please do so as I have my p4 exam on 23 may , ur a really good teacher and I almost did all of my Alevels from you so it would mean a lot if u make a recersion video
Great question. What you need to do is simply change 2 lines of code and you will be able to do it. Change line 26 in the video from: If Cards(Location) > CurrentCard Then to this line of code: If Cards(Location) < CurrentCard Then... Notice the sign has changed from ">" to "" to "
Good afternoon! Sorry for the delay in my response I have been out of town. There are most likley going to be some topics that will definitely show up: Paper 1: Binary/Hexadecimal/Two's Complement and SQL/Normalization/Relational Databases are almost always on these exams across all regions. I would recommend you be familiar with the Fetch Execute Cycle as well as this is a pretty popular choice for Cambridge. Paper 2: Analyzing data types is something that has been on almost every test over the years. This is easy points. The harder part of the exam is being able to read a scenario and write the code to solve the given problem. The more you code the better you will get at solving these. Paper 3: On almost every exam there has been mantissa and exponent so I would definitely recommend being on expert on this. You may also want to familiarize yourself with BNF Syntax diagrams, the steps of a compiler and RPN. These are pretty popular. It would also not hurt to study the 4 layers for sending and receiving data. Paper 4: OOP is almost guranteed to be on the exam and it is a pretty popular choice. The questions regarding OOP are worth quite a bit of points and being an expert in OOP will give you a lot of points towards passing your exams. You also want to be familiar with all ADTs and specifically how to program them. These are: Binary Tree(including traversing a binary tree), Linked List, Queues, Stacks. They will most likely ask you to program one of these so know all of them (I have videos on each one of these as well). Searches are pretty popular and they like to throw recursion in with this. If they have you do a binary search there is a chance they may have you do it recursively. Sorts are the last thing I will mention being familiar with the Insertion Sort and Bubblesort (both as a 1D array and 2D array). Please keep in mind anything on the syllabus is fair game and my predictions are from past exams and having taught this subject for several years. There is a lot of content and I wish you to remember this: You know and remember more than you think you do so do your best and I wish you good luck! I hope this helps.
Hey sir can you please make video on recersion for my alevels exam ? Please do so as I have my p4 exam on 23 may , ur a really good teacher and I almost did all of my Alevels from you so it would mean a lot if u make a recersion video
Thanks for the kind words. I have videos on recursion and I think these will help you. A video on the basics of recursion from a past exam: ua-cam.com/video/XuhY2L-5MGo/v-deo.html A P4 Recursive Question Walkthrough: ua-cam.com/video/ZANcOyjwYIo/v-deo.html Binary Search Written Recursively (Could be on Paper 4): ua-cam.com/video/g_vrbop4_t4/v-deo.html Tracing Recursion and Understanding How it Works: ua-cam.com/video/dWXyiG4Rtns/v-deo.html I hope you find these helpful. If you have any additional questions please let me know. My students are also testing their P3 and P4 exams next week. Good luck on your exam! P.S. I also just created a playlist of all P4 videos. You can check if you missed any or if any of them could be helpful. You can find the playlist here: ua-cam.com/play/PLaxAmCZMlFC2nrMaNcBUk4r1XeB9ouCZi.html
Thank you sir!!! I was having difficulty in understanding insertion sort for my A-level exam and this video helped me a lot
😁
Glad you found it helpful!
man ure awesome, a total life saver, please keep posting more vids!
Hey sir can you please make video on recersion for my alevels exam ? Please do so as I have my p4 exam on 23 may , ur a really good teacher and I almost did all of my Alevels from you so it would mean a lot if u make a recersion video
How do you get it to sort from highest number to lowest?
Great question. What you need to do is simply change 2 lines of code and you will be able to do it.
Change line 26 in the video from:
If Cards(Location) > CurrentCard Then
to this line of code:
If Cards(Location) < CurrentCard Then...
Notice the sign has changed from ">" to "" to "
any predicted question for m/j 2023?
Good afternoon! Sorry for the delay in my response I have been out of town. There are most likley going to be some topics that will definitely show up:
Paper 1: Binary/Hexadecimal/Two's Complement and SQL/Normalization/Relational Databases are almost always on these exams across all regions. I would recommend you be familiar with the Fetch Execute Cycle as well as this is a pretty popular choice for Cambridge.
Paper 2: Analyzing data types is something that has been on almost every test over the years. This is easy points. The harder part of the exam is being able to read a scenario and write the code to solve the given problem. The more you code the better you will get at solving these.
Paper 3: On almost every exam there has been mantissa and exponent so I would definitely recommend being on expert on this. You may also want to familiarize yourself with BNF Syntax diagrams, the steps of a compiler and RPN. These are pretty popular. It would also not hurt to study the 4 layers for sending and receiving data.
Paper 4: OOP is almost guranteed to be on the exam and it is a pretty popular choice. The questions regarding OOP are worth quite a bit of points and being an expert in OOP will give you a lot of points towards passing your exams. You also want to be familiar with all ADTs and specifically how to program them. These are: Binary Tree(including traversing a binary tree), Linked List, Queues, Stacks. They will most likely ask you to program one of these so know all of them (I have videos on each one of these as well). Searches are pretty popular and they like to throw recursion in with this. If they have you do a binary search there is a chance they may have you do it recursively. Sorts are the last thing I will mention being familiar with the Insertion Sort and Bubblesort (both as a 1D array and 2D array).
Please keep in mind anything on the syllabus is fair game and my predictions are from past exams and having taught this subject for several years. There is a lot of content and I wish you to remember this: You know and remember more than you think you do so do your best and I wish you good luck! I hope this helps.
@@erbcomputerscience thankyou very much sir
Hey sir can you please make video on recersion for my alevels exam ? Please do so as I have my p4 exam on 23 may , ur a really good teacher and I almost did all of my Alevels from you so it would mean a lot if u make a recersion video
Thanks for the kind words. I have videos on recursion and I think these will help you.
A video on the basics of recursion from a past exam: ua-cam.com/video/XuhY2L-5MGo/v-deo.html
A P4 Recursive Question Walkthrough: ua-cam.com/video/ZANcOyjwYIo/v-deo.html
Binary Search Written Recursively (Could be on Paper 4): ua-cam.com/video/g_vrbop4_t4/v-deo.html
Tracing Recursion and Understanding How it Works: ua-cam.com/video/dWXyiG4Rtns/v-deo.html
I hope you find these helpful. If you have any additional questions please let me know. My students are also testing their P3 and P4 exams next week. Good luck on your exam!
P.S. I also just created a playlist of all P4 videos. You can check if you missed any or if any of them could be helpful. You can find the playlist here: ua-cam.com/play/PLaxAmCZMlFC2nrMaNcBUk4r1XeB9ouCZi.html
@@erbcomputerscience thank you so much
@@AfshanUsman-mt3fe You are very welcome!