if you see this it means you're NOT cooked. remember that there are people that haven't even clicked on this video. YOU are at an advantage. YOU got this. even if its 5 minutes before the exam, you got this!
I know right? I swear this guy got me through my GCSEs and is now gonna help me through my A-levels too (and perfect timing cause I’ve got mocks currently)
You're literally a life saver, ty so much for your content. You are so underrated, computer science as an A level is getting more popular so I'm really surprised why you dont have atleast 20k subscribers.
Time for paper 2. Paper 1 wasn't as easy as it was in 2023, a bit harder, still think I did better - was not expecting the page rank question. I struggle more with paper 2, likely going to be the same trend, probs will be still easy but not as easy as the 2023 paper, so got to prepare. Thanks s1perry! The FDE Cycle explanation was really good.
Beautiful video you cooked massively. Small refinement: On the 2018 paper, OCR said performance modelling examples were Testing it with a large number of simultaneous orders (stress testing) Testing it with a large number of customers/items/orders
Those were example answers for that particular question in that particular paper - just remember that performance modelling encompasses more than just those two examples.
watching this at midnight before the exam. good luck to you all, and s1perry, big love broski for uploading these :). word of note, might want to add proper playlists with these videos + the topics themselves in more in depth explanatory videos to properly boost our knowledge 🙏
Hi, thanks for this video. I'm retaking computer science as an external student, and I have been the only one sitting the exam this year in my school-they must have changed to a different exam board. Do you think OCR is becoming less popular for computer science?
Variable x=3 name=“Bob” Array array names[5] names[0]=”Ahmad” names[1]=”Ben” names[2]=”Catherine” names[3]=”Dana” names[4]=”Elijah” Both are straight from the specification.
When looking at recursion at 10 minutes, does the recursive one not lose its count each times its recalled with a lower number? Thank you for the video either way haha
@@Conquermindbodyandsoul isn’t the pointer already pointing to the next free space so u put ur data there and then u increase the pointer to show the next free space
Hey perry i just wanted to confirm if the depth first search was correct becayse everywhere i look its explained differently. So in the casw of the example you had up, the way i thought it went and how its generally explain when i search it up would be F,B,A,C,D,E,G,I,H
Sorry for the inconvenience but I’m going to help out a bit The Depth-First Traversal shown here IS for Post-Order; there are 3 types of Depth-First Traversal: Pre-Order, In-Order & Post Order, so it’s likely you could’ve seen any traversals following the former two
@@L39-GN I thought that, in order, post order, and pre order were only applicable to binary search trees and depth first and breadth first are applicable to both regular and binary trees
Question, are we required to know the written algorithm of each search and sort, or is it more of a recommended thing? If it's required, what's the best way to help remember? Writing them down?
You need to know the simpler ones and may be asked to code them. If you know the basic algorithms, that should enough, you don't have to memorise a particular implementation in 1 language. Approximately right will get you most of the marks.
You might... but it has only come up once since 2017. The 2021 paper asked you to complete a table for an A* algorithm. Other than that, the papers usually ask you to describe the difference between Dijkstra's algorithm and A*.
If you watch the whole video and think "Yeah, this is all stuff i know off by heart" then you would be in a very strong position. It is a summary of key points, though - for example I cover the main coding constructs, but how you put them together in an exam question can get very complicated!
I thought that all elements from the specification can end up in either paper can you confirm this please or do i need to just revise paper 1 content for paper 1 and paper 2 content for paper 2 at a level. thanks
Some elements are on both specs, for example OOP or data structures. You can always get some coding on Paper 1, but it will be tied into the Paper 1 spec in some way.
a few may come up, but only from the second half of the spec and that are relevant/intertwined with paper 2 knowledge. At this short notice it's probably best just focusing on paper 2 because the amount of marks that could be gained for paper 1 knowledge is negligible
if you see this it means you're NOT cooked. remember that there are people that haven't even clicked on this video. YOU are at an advantage. YOU got this. even if its 5 minutes before the exam, you got this!
no cap
Good luck guys.😊😊😊
fr
hell yeah
We're cooked
Who's watching the day before the exam 😭
🙋🏿
🙋
👍
Mee
🙋♂️
when the world needed him the most, he returned.
Thanks!
I know right? I swear this guy got me through my GCSEs and is now gonna help me through my A-levels too (and perfect timing cause I’ve got mocks currently)
@@CFGalt frr same ive got a mock tmr for alevel 😭😭😭
whos here in 17th June
Hell yeah
what other time would we be, last minute goes cold
i know right
dude I give up 😭
on the 18th
So cooked man may god accept all our prayers inshallah 🙏
You got this dude
inshallah my brother
@@mikeyparker8207 u too bro 👍
Amen brother
amen brother :D
good luck to everyone taking paper 2 on the 18th today :)
im cooked for paper 2... watching this 5 hours before and idk half of these topics
Good luck to y'all
You too, bro.
You're literally a life saver, ty so much for your content. You are so underrated, computer science as an A level is getting more popular so I'm really surprised why you dont have atleast 20k subscribers.
Thanks!
Really needed this, havent revised CS in 3 months cos of NEA, tytytytyty
Glad it helped!
Your long-awaited return graces us, Your Majesty. The realm eagerly awaits your wisdom and entertainment once more.
Thank you, kind sir.
thanks thee sire for returning back whence we were about to fail.
No worries!
s1perry my glorious king THANK YOU ‼️‼️‼️ for potentially saving my cs grade
I’m watching this an hour before the exam cramming is wild
i cant code for shit so this video + a cheeky inshallah before the exam better save me
no cap
I was here two years ago for the GCSE and here I am again. Thanks s1perry
this video and the paper 1 video have gotten me through the past 2 weeks 🙏 this is gonna carry the day before revision
Time for paper 2. Paper 1 wasn't as easy as it was in 2023, a bit harder, still think I did better - was not expecting the page rank question. I struggle more with paper 2, likely going to be the same trend, probs will be still easy but not as easy as the 2023 paper, so got to prepare. Thanks s1perry! The FDE Cycle explanation was really good.
id never heard of it before :((((
Paper 2 Comeback in'sha'Allah
come on, im learning python right now
Who's watching the hell outta this on the day of the exam 😭😭😭😭
Hello 😭
🥲🥲
We will cook
😭😭
😭👋
Lord be with us all 🫡
Who else is doing an all nighter before their exam?
me lmao im done for
Me
bro why 😭
@@Mill763 ended up sleeping for a few hours 😭😭
@@sami023 that's why you don't pull an all nighter on exam day lmao, gotta be at peak performance. Get your ass to college though
Wish I did more on heuristics but other than that it was a good paper it’s been an honor S1perry saved my Cs revision🙏
Paper 2 will bring down my overall grade.
same and people say its the easier paper but imo its really not
@@sameehah2360yk what I’ve seen a lot of u guys comment on both videos and I hope we all cook man it is what it is inshallah we got those As
@@dayyan8475 In Sha Allah we do !! gonna be praying for all of us🙏
chat who else is cooked 🔥🗣
tremendously cooked
Me 🙏
nah its just you, revise next time. Guess you gotta retake.
Who is here revising to bump up their grades because paper 1 was a shock?
Paper 1 was light
@@ZAza77934 🤓☝️
@@ZAza77934 u do As?
who's watching the morning before the exam🔥
we got this brother
@@Mill763 hopefully, good luck mate
it is what it is at this point
The goat has returned 🎉🎉🎉🎉🎉
Cheers!
Beautiful video you cooked massively. Small refinement: On the 2018 paper, OCR said performance modelling examples were
Testing it with a large number of simultaneous orders (stress testing)
Testing it with a large number of customers/items/orders
Those were example answers for that particular question in that particular paper - just remember that performance modelling encompasses more than just those two examples.
@@s1perry ah ok, thanks for explaining!
Thanks for saving my grade (again)
watching this at midnight before the exam. good luck to you all, and s1perry, big love broski for uploading these :). word of note, might want to add proper playlists with these videos + the topics themselves in more in depth explanatory videos to properly boost our knowledge 🙏
Good luck guys, its time to cook again
brilliant video
70/70 nea, did great in paper 1, lets hope i dont fumble the easy paper 2 🙏
you bastard
@@adzbest5621lol
silence fool.
Im curious what you did for your NEA? I got something like a 63/70 making a game in Godot engine
Watching this an hour before, wish me luck 😭
thank you so much this is exactly what I needed for tomorrow!
You're so welcome!
i’m watching it on the day of the exam
same lol
THANK YOU SO MUCH!! You’re a life saver!!!
You're welcome!
watching on the day of the exam you know the rules
yep, gl brother
whos here on 18th june?
on god we survive brothers
whos watching after the exam
who's here 18th june
me, dw we got this in the bag
Thank you for your service s1perry, the exam was not too bad tbh
guys am i cooked💀🙏
This video is a get out of jail card for paper 2
hi sir, ali here. thanks for the video! have a good rest of your easter break
Thanks, you too!
Who’s watching day of the exam
Youre the best!!! I wish id found you for my gcses lol
Thanks - good luck in your exams!
@@s1perry Still doing my L6 exams, but the videos are great!
Thank you sir! He’s the goat 🐐
You are welcome!
its over
Owari da
Cest fini
Khalas
Real
no cap
what’s a pseudocode, am i cooked?
who’s watching right before the exam starts😭
Me 😭 (I'm not actually watching it)
Thank you for this lifesaver of a video!! 🙏 I spotted a goof at 38:54, it seems you say "sorting algorithms" twice?
I LOVE U. U SAVED ME FOR GCSE AND NOW A LEVEL. Last thing any predicted papers or any predictions for Paper 1 or 2?
I would dare to hazard a guess! The exam board always try to stay one step ahead.
Hi, thanks for this video. I'm retaking computer science as an external student, and I have been the only one sitting the exam this year in my school-they must have changed to a different exam board. Do you think OCR is becoming less popular for computer science?
sigma
I believe is the most popular overall (certainly for GCSE), but there have been issues in recent years so some schools have changed.
in the 2021 november paper 2 Q2 is about the best worst anverage time complexity its different from what you have at 36:09
S1 Perry could you do walkthrough of any of the computer scinece paper 2 as that would be helpfull 👍
That's a good idea!
Am i cooked? Pull it back on paper 3
sorry to break it to yo ahh but there aint no paper 3 😭
lolllllllllllllllllllllllll
Just finished the exam what was that man in cooked 😭
Depth first traversal is done wrong in the video
Exam is in 10 minutes make dua for me🙏
hi sir how do we answer it if it says to declare an array or variable? its on 6c in 2022 paper but there is no example answer
Variable
x=3
name=“Bob”
Array
array names[5]
names[0]=”Ahmad”
names[1]=”Ben”
names[2]=”Catherine”
names[3]=”Dana”
names[4]=”Elijah”
Both are straight from the specification.
@@s1perry cheers sir do you know if there will be a 12 marker? ive not been taught the difference in how to answer it from 9 marker
@@Mohammed-xx6sz Probably! I wouldn't say the technique is different - just write more points!
Good luck with the exam XD
When looking at recursion at 10 minutes, does the recursive one not lose its count each times its recalled with a lower number? Thank you for the video either way haha
there better be a 12 marker on big o notation
Your defo gay if you want that
@@Rahmzzz.1 it's a free 12 marks just memorise the table lol
Are we cooking today?????
hell yeah brother
Yes sirr
YEAH
51:37 isn’t top meant to be after stack top as it it adding one but then referencing it
I think top here is the pointer, not the next free space
So we add top by from the current top to the next free space ontop
@@Conquermindbodyandsoul isn’t the pointer already pointing to the next free space so u put ur data there and then u increase the pointer to show the next free space
In the exam they are gonna use pointers not top but if top is an item and highest on the stack them it kind of works as a base model
Thank you
thank you thank you thank you thank you thank you
Im here 6 hrs before exam
saved me thank you!
You're welcome!
Hey perry i just wanted to confirm if the depth first search was correct becayse everywhere i look its explained differently.
So in the casw of the example you had up, the way i thought it went and how its generally explain when i search it up would be F,B,A,C,D,E,G,I,H
Sorry for the inconvenience but I’m going to help out a bit
The Depth-First Traversal shown here IS for Post-Order; there are 3 types of Depth-First Traversal: Pre-Order, In-Order & Post Order, so it’s likely you could’ve seen any traversals following the former two
@@L39-GN I thought that, in order, post order, and pre order were only applicable to binary search trees and depth first and breadth first are applicable to both regular and binary trees
thanks tcho papi
26 min till exam am I cooked?
Will memorising this video without knowing how to code get me 80 marks?
Probably not!
So its not just me who has 0 idea how to code xD
Lol just watching this on exam day to cram things in. Quite useful though.
mate youre a legend
Thanks!
Question, are we required to know the written algorithm of each search and sort, or is it more of a recommended thing? If it's required, what's the best way to help remember? Writing them down?
You need to know the simpler ones and may be asked to code them. If you know the basic algorithms, that should enough, you don't have to memorise a particular implementation in 1 language. Approximately right will get you most of the marks.
Can you expand on that? Which basic algorithms in particular are you referring to that we should know?@@s1perry
@@shanyewest2009 bubble sort , linear search , binary search maybe insertion sort
THANK YOU!
You're welcome!
3 hours before the exam is fine😂
😭😭
Does anyone have any links for quick videos to teach the actual code?
How do i write pseudocode by mrbrowncs
who’s here 10 minutes before the exam on 2x
Who's watching the morning of the exams 😭🙏
Would we ever be expected to have to write one of the more complex algorithms out completely by memory with no guiders, for example quicksort?
So unlikely, its usually gapfill for the harder ones or just the easy algorithms like linear search
@@Matt-rz2hs unlikely but i don't trust ocr after the pagerank 12 marker 😭
I love you s1perry
do i need to know how the A star algorithm works on a set of data for component two paper?
You might... but it has only come up once since 2017. The 2021 paper asked you to complete a table for an A* algorithm. Other than that, the papers usually ask you to describe the difference between Dijkstra's algorithm and A*.
@@s1perry i did my mock paper and it didn’t come up 😁
If we were to learn everything in this video off by heart could we get full marks? or is this just a simplification of the key points we need to know?
If you watch the whole video and think "Yeah, this is all stuff i know off by heart" then you would be in a very strong position. It is a summary of key points, though - for example I cover the main coding constructs, but how you put them together in an exam question can get very complicated!
watching this at 3am on the day of the exam. Am I cooked?
SAME I DIDNT EVEN REVISE LOL
@@selener2625 we are so cooked 🤣
@@asdasdasda5857 we fr might be
isnt depth first the same as a preorder traversal
Isn’t Is post order?
Depth first is split into post order, pre order and in order but you only have to know post order for the exam (I think)
ur the goat
I thought that all elements from the specification can end up in either paper can you confirm this please or do i need to just revise paper 1 content for paper 1 and paper 2 content for paper 2 at a level. thanks
Some elements are on both specs, for example OOP or data structures. You can always get some coding on Paper 1, but it will be tied into the Paper 1 spec in some way.
is there a chance that paper 1 topics come up for paper 2?
a few may come up, but only from the second half of the spec and that are relevant/intertwined with paper 2 knowledge. At this short notice it's probably best just focusing on paper 2 because the amount of marks that could be gained for paper 1 knowledge is negligible
@@thomascarey7731 okay thanks
✝
qq o governo brasileiro ta fazendo aq? kkkk
@@keikinho Estamos procurando novas formas de taxar o povo. Amém.
Lifesaver
Chat, did we cook on paper 1? I cooked an outstanding 5 course meal
was cooking until a 9 marker on page rank
amen brotha, we have cooketh
@@Sam_bcafc I thought it was quite a nice question tbh. Big up to craig n dave. Way better than getting a question on ethics 💀
@@00f169 it was ok just didn’t think there was much to talk about. Preferred the question about different cultures using different colours
@@00f169 how do you manage to watch craig n dave? Personally, I can't bear it
Do you have any useful videos on pseudocode?
Not a video specifically about that, no. But all the examples of code in this video are exam appropriate pseudocode.
can we have a new paper 1 video
The spec hasn't changed since I created that video, so no, not for this year, i'm afraid.
Day of the exam gang😂
can i do OOP in python in the exam as i prefer to do it over pseudocode?
idk if you'll have to write OOP in this paper cuz it was already done in paper 1
Yes, as long as it clear what you are doing. For example, Python does not do private and public attributes so add comments to make this clear.
oop is in both papers @@jezzaboy07
@@s1perry self.__name isnt private ? or do you mean when first declaring?
@@ynv the exam board want you to comment attributes as private, for example.