As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
Here's the last set of resources covering section 2.3. I don't really have that many for the programming project so i'm going to conclude this "Big list" in this post. Anyways, I may have a couple of other miscellaneous resources to share after this but from now on i'm focusing on trying to make my own resources InShaAllah.
Here's the link: 2.3 Algorithms
Hope this helps!
Showing posts with label 2.3 Algorithms. Show all posts
Showing posts with label 2.3 Algorithms. Show all posts
Tuesday, 19 December 2017
Tuesday, 21 November 2017
Road To 200 OCR A Level Computer Science Resources: Linear Search Document
As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
Resource # 194 is yet another algorithms resource. In other news, I've finally finished the summary presentations for section 1.3 of the H046/H446 specification. I'll start posting them as soon as I hit the 200 target InShaAllah.
Here's the link: Linear Search Document
Hope this helps!
Resource # 194 is yet another algorithms resource. In other news, I've finally finished the summary presentations for section 1.3 of the H046/H446 specification. I'll start posting them as soon as I hit the 200 target InShaAllah.
Here's the link: Linear Search Document
Hope this helps!
Monday, 20 November 2017
Road To 200 OCR A Level Computer Science Resources: Data Structures Worksheet w/Answers
As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
Resources # 192 and 193 are a worksheet with accompanying answers for the algorithms section of the spec. I guess you could say that's a double whammy *ba dum tss*. Anyway, I was a bit hesitant about placing these resources under this label since they do cover quite a bit about data structures but the algorithms section has stuff on that as well which is why I went along with it.
Here's the links:
Hope this helps!
Resources # 192 and 193 are a worksheet with accompanying answers for the algorithms section of the spec. I guess you could say that's a double whammy *ba dum tss*. Anyway, I was a bit hesitant about placing these resources under this label since they do cover quite a bit about data structures but the algorithms section has stuff on that as well which is why I went along with it.
Here's the links:
Hope this helps!
Thursday, 16 November 2017
Road To 200 OCR A Level Computer Science Resources: Big O Notation Worksheet
As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
Resource # 187 is another Big O Notation one - but it's not a presentation. This worksheet has 10 questions with answers on some elementary concepts you need to know about this topic.
Here's the link: Big O Notation Worksheet
Hope this helps!
Resource # 187 is another Big O Notation one - but it's not a presentation. This worksheet has 10 questions with answers on some elementary concepts you need to know about this topic.
Here's the link: Big O Notation Worksheet
Hope this helps!
Wednesday, 15 November 2017
Road To 200 OCR A Level Computer Science Resources: Big O Notation Presentation
As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
Resources are becoming extremely scarce now, even though they're not OCR specific. After some digging, I found yet another Big O Notation resource which is meant for the AQA spec I believe, but it works just fine for OCR's spec as well.
Here's the link: Big O Notation Presentation
Hope this helps!
Resources are becoming extremely scarce now, even though they're not OCR specific. After some digging, I found yet another Big O Notation resource which is meant for the AQA spec I believe, but it works just fine for OCR's spec as well.
Here's the link: Big O Notation Presentation
Hope this helps!
Saturday, 11 November 2017
Road To 200 OCR A Level Computer Science Resources: Merge Sort Worksheet PDF
As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
Haven't shared an algorithms resource for a while now so I thought I'd post this merge sort worksheet. Funnily enough, the algorithms section of the spec actually has the most resources on this blog but hey, the more the merrier. Anyway, that's 183 resources now and if I carry on at this rate I should be done before December InShaAllah.
Here's the link: Merge Sort Worksheet
Hope this helps!
Haven't shared an algorithms resource for a while now so I thought I'd post this merge sort worksheet. Funnily enough, the algorithms section of the spec actually has the most resources on this blog but hey, the more the merrier. Anyway, that's 183 resources now and if I carry on at this rate I should be done before December InShaAllah.
Here's the link: Merge Sort Worksheet
Hope this helps!
Thursday, 19 October 2017
Road To 200 OCR A Level Computer Science Resources: 5 Searching & Sorting Algorithms Worksheets
As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
Hit a bit of a goldmine here. These 5 worksheets provide some good practice for implementing the sorting and searching algorithms. There's none for quick sort unfortunately but the other 5 algorithms are covered along with selection sort in some worksheets which you don't need to know.
Anyway, that's 5 resources done in a day so that brings the count up to 176 resources. It's getting harder and harder to find decent resources now so I can't wait to hit this target and start making my own.
I've noticed that the presentations in particular, are of absolute rubbish quality. There's just too much waffle in the slides and sometimes it's not even of relevance to the OCR spec. The first resource or set of resources i'll be making after I've hit this target are summary presentations for each topic in the spec InShaAllah.
Here's the links:
Hope this helps!
Hit a bit of a goldmine here. These 5 worksheets provide some good practice for implementing the sorting and searching algorithms. There's none for quick sort unfortunately but the other 5 algorithms are covered along with selection sort in some worksheets which you don't need to know.
Anyway, that's 5 resources done in a day so that brings the count up to 176 resources. It's getting harder and harder to find decent resources now so I can't wait to hit this target and start making my own.
I've noticed that the presentations in particular, are of absolute rubbish quality. There's just too much waffle in the slides and sometimes it's not even of relevance to the OCR spec. The first resource or set of resources i'll be making after I've hit this target are summary presentations for each topic in the spec InShaAllah.
Here's the links:
- Binary Search Worksheet
- Binary & Linear Search Worksheet
- Bubble & Insertion Sort Worksheet
- Bubble & Insertion Sort Worksheet 2
- Insertion & Merge Sort Worksheet
Hope this helps!
Sunday, 15 October 2017
Road To 200 OCR A Level Computer Science Resources: Big O Notation PDF
As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
Back to the main target now after finally creating my revision guide yesterday. Before I go into today's resource I should probably mention a few things I forgot regarding the revision guide.
Firstly, I don't think I mentioned when version 2.0 was coming out and that's because I have no idea myself. I don't want to rush it for the sake of it. In all probability, it will probably come out after a while - by that I mean a long time.
And that's because I want to make some other resources before I go back into updating my revision guide. So as soon as this target of 200 resources is met, I will begin doing that InShaAllah.
Anyway, today's resource is # 168. Unlike the last few resources which have been on topics that weren't on the Big List, this PDF is on something I've covered a couple of times via some presentations. Yep, that's right -It's Big O Notation.
Aside from binary, this topic has the most resources on it in this blog. I guess that's because both topics are on the mathematical side of the spec. And no, this isn't specific to the OCR spec but is still a useful resource nonetheless as it touches on pretty much the same things written in the spec.
Here's the link: Big O Notation PDF
Hope this helps!
Back to the main target now after finally creating my revision guide yesterday. Before I go into today's resource I should probably mention a few things I forgot regarding the revision guide.
Firstly, I don't think I mentioned when version 2.0 was coming out and that's because I have no idea myself. I don't want to rush it for the sake of it. In all probability, it will probably come out after a while - by that I mean a long time.
And that's because I want to make some other resources before I go back into updating my revision guide. So as soon as this target of 200 resources is met, I will begin doing that InShaAllah.
Anyway, today's resource is # 168. Unlike the last few resources which have been on topics that weren't on the Big List, this PDF is on something I've covered a couple of times via some presentations. Yep, that's right -It's Big O Notation.
Aside from binary, this topic has the most resources on it in this blog. I guess that's because both topics are on the mathematical side of the spec. And no, this isn't specific to the OCR spec but is still a useful resource nonetheless as it touches on pretty much the same things written in the spec.
Here's the link: Big O Notation PDF
Hope this helps!
Wednesday, 11 October 2017
Road To 200 OCR A Level Computer Science Resources: Bubble Sort Document
As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
Another algorithms resource for # 166. This only goes into the theoretical part (and overdoes it a tad bit too much) but to practice implementing this algorithm, I'd recommend Edexcel's (I know it's called Pearson now but who cares) A level Maths D1 papers.
Physics and Maths Tutor has a nice file which only contains bubble and quick sort questions from the D1 papers which I'd highly recommend since you need to know how to perform implementations of both algorithms.
There's also loads of questions for binary search and Dijkstra's algorithm as well. There's not a lot of OCR specific resources for these questions so it's a good idea to use these. It's a bit different in these papers but they give you a general idea on how to perform the algorithms
And if all else fails, there's always Craig 'n' Dave. This post just sounds like a plug for Physics and Maths Tutor and Craig 'n' Dave now for some reason. Anyway, 6 resources down and only 34 to go so I should be done by November InShaAllah.
Here's the link: Bubble Sort Document
Hope this helps!
Another algorithms resource for # 166. This only goes into the theoretical part (and overdoes it a tad bit too much) but to practice implementing this algorithm, I'd recommend Edexcel's (I know it's called Pearson now but who cares) A level Maths D1 papers.
Physics and Maths Tutor has a nice file which only contains bubble and quick sort questions from the D1 papers which I'd highly recommend since you need to know how to perform implementations of both algorithms.
There's also loads of questions for binary search and Dijkstra's algorithm as well. There's not a lot of OCR specific resources for these questions so it's a good idea to use these. It's a bit different in these papers but they give you a general idea on how to perform the algorithms
And if all else fails, there's always Craig 'n' Dave. This post just sounds like a plug for Physics and Maths Tutor and Craig 'n' Dave now for some reason. Anyway, 6 resources down and only 34 to go so I should be done by November InShaAllah.
Here's the link: Bubble Sort Document
Hope this helps!
Sunday, 8 October 2017
Road To 200 OCR A Level Computer Science Resources: 2 A* Algorithm Presentations
As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
After posting yesterday's big list, I had a bit of a revelation. I now have a clear plan on what I want to do with this blog and I know exactly how to do it.
By (or before) the Christmas holidays I want to reach 200 resources on this blog that aren't made by me and from then on I will only post resources that I make. If you do the math, that gives me about 80 days to reach that target and we're already on resource #160 so I have to average a resource every 2 days.
I reckon I'll finish a lot earlier than that InShaAllah but anyway that's the plan from now on. So what happens next? Well, I want to (finally) make a website. I know I said before I didn't want to because it would take too much time and stuff but I feel after I've shared 200 resources on this blog, a website would be a better place to have them all on (let's face it, navigating on a blog can be a bit annoying at times).
I'll also make another big list when I've hit 200 resources InShaAllah. In terms of the resources I want to start creating, I have loads of ideas but I'm not going to share them right now - sorry. Besides, I still have to complete the revision guide that I haven't worked on for so long.
Anyway, let's not get too ahead of ourselves and start working towards more immediate goals. Today's resources are 2 A* algorithm presentations which obviously aren't for the OCR spec but are useful nonetheless (hey, that rhymed - sort of). Oh and they're both a bit complex mind you so don't worry too much if you don't get it at first.
Here's the links:
After posting yesterday's big list, I had a bit of a revelation. I now have a clear plan on what I want to do with this blog and I know exactly how to do it.
By (or before) the Christmas holidays I want to reach 200 resources on this blog that aren't made by me and from then on I will only post resources that I make. If you do the math, that gives me about 80 days to reach that target and we're already on resource #160 so I have to average a resource every 2 days.
I reckon I'll finish a lot earlier than that InShaAllah but anyway that's the plan from now on. So what happens next? Well, I want to (finally) make a website. I know I said before I didn't want to because it would take too much time and stuff but I feel after I've shared 200 resources on this blog, a website would be a better place to have them all on (let's face it, navigating on a blog can be a bit annoying at times).
I'll also make another big list when I've hit 200 resources InShaAllah. In terms of the resources I want to start creating, I have loads of ideas but I'm not going to share them right now - sorry. Besides, I still have to complete the revision guide that I haven't worked on for so long.
Anyway, let's not get too ahead of ourselves and start working towards more immediate goals. Today's resources are 2 A* algorithm presentations which obviously aren't for the OCR spec but are useful nonetheless (hey, that rhymed - sort of). Oh and they're both a bit complex mind you so don't worry too much if you don't get it at first.
Here's the links:
Hope this helps!
Wednesday, 6 September 2017
Another Algorithms Presentation For Implementing Dijsktra's Shortest Path Algorithm
As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
Another algorithms resource coming your way. This time it's a presentation that goes through an implementation of Dijsktra's algorithm on a graph. It finds the shortest path between 2 nodes step by step so you can understand it easily.
I'm not saying you can learn the algorithm just by using this, but it does give you a nice visual representation of how the algorithm works in stages. As with anything practical, the way you get better at it is by practicing so doing questions on the algorithm's implementation would be the most beneficial.
Now where do I find questions on Dijkstra's algorithm, I here you ask? Well, finding questions specifically for OCR is a nightmare so I would highly recommend you do Edexcel's D1 Dijsktra's questions.
You can find D1 papers on Edexcel's website but you can find the specific Dijkstra algorithm questions on Physics & Maths Tutor. Obviously, you can go for AQA and OCR questions as well but I think Edexcel is the easiest to do.
Speaking of questions by topic, I'm going to start grouping OCR past paper questions from both the old and new spec according to their topics as well. I think it would be very useful since you could just focus on the area's of the spec you find challenging rather than do an entire past paper which has parts you can do with ease.
Here's the link: Dijkstra's Algorithm Presentation
Hope this helps!
Another algorithms resource coming your way. This time it's a presentation that goes through an implementation of Dijsktra's algorithm on a graph. It finds the shortest path between 2 nodes step by step so you can understand it easily.
I'm not saying you can learn the algorithm just by using this, but it does give you a nice visual representation of how the algorithm works in stages. As with anything practical, the way you get better at it is by practicing so doing questions on the algorithm's implementation would be the most beneficial.
Now where do I find questions on Dijkstra's algorithm, I here you ask? Well, finding questions specifically for OCR is a nightmare so I would highly recommend you do Edexcel's D1 Dijsktra's questions.
You can find D1 papers on Edexcel's website but you can find the specific Dijkstra algorithm questions on Physics & Maths Tutor. Obviously, you can go for AQA and OCR questions as well but I think Edexcel is the easiest to do.
Speaking of questions by topic, I'm going to start grouping OCR past paper questions from both the old and new spec according to their topics as well. I think it would be very useful since you could just focus on the area's of the spec you find challenging rather than do an entire past paper which has parts you can do with ease.
Here's the link: Dijkstra's Algorithm Presentation
Hope this helps!
Tuesday, 5 September 2017
Here's Another 2 Good Big O Notation Presentations
As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
It may seem like I only have resources on algorithms but I just want to share resources systematically since they're so many! My Google Drive is a it cluttered as well so it makes resources harder to find but nonetheless I've found these 2 presentations that are more relevant than the previous one to the OCR spec.
Now I'm not saying that they're made for the spec or they're completely relevant, but their content doesn't go too much beyond the A level scope. I have a couple of other ones but they're for AQA A level Computer Science so I have decided against posting them yet.
The first presentation is the shorter one and is much easier to understand. It's more of a beginner's guide to Big O Notation but I highly recommend it anyway since it's content is quite relevant to the OCR spec.
The second presentation is a bit longer and more complex, but is still very useful. It's much more detailed than the shorter one but sometimes goes beyond the scope of the OCR spec so as usual, check with your teacher as to what you specifically need to know or just check out the subject content clarification guide.
Big O Notation isn't really that complicated once you get the hang of it. It might look a bit hard at first since there's numbers and graphs involved but there's nothing too mathematical about it. Most of it is actually theoretical knowledge rather than math so for those who aren't good with numbers or if you simply hate math, you have nothing to worry about (not too much anyway).
Anyway, the links are below and as aforementioned I recommend you start with the shorter one for beginners and then move onto to the longer one next.
It may seem like I only have resources on algorithms but I just want to share resources systematically since they're so many! My Google Drive is a it cluttered as well so it makes resources harder to find but nonetheless I've found these 2 presentations that are more relevant than the previous one to the OCR spec.
Now I'm not saying that they're made for the spec or they're completely relevant, but their content doesn't go too much beyond the A level scope. I have a couple of other ones but they're for AQA A level Computer Science so I have decided against posting them yet.
The first presentation is the shorter one and is much easier to understand. It's more of a beginner's guide to Big O Notation but I highly recommend it anyway since it's content is quite relevant to the OCR spec.
The second presentation is a bit longer and more complex, but is still very useful. It's much more detailed than the shorter one but sometimes goes beyond the scope of the OCR spec so as usual, check with your teacher as to what you specifically need to know or just check out the subject content clarification guide.
Big O Notation isn't really that complicated once you get the hang of it. It might look a bit hard at first since there's numbers and graphs involved but there's nothing too mathematical about it. Most of it is actually theoretical knowledge rather than math so for those who aren't good with numbers or if you simply hate math, you have nothing to worry about (not too much anyway).
Anyway, the links are below and as aforementioned I recommend you start with the shorter one for beginners and then move onto to the longer one next.
Hope this helps!
Saturday, 2 September 2017
A Detailed (And A Bit Complex) Presentation For Learning Bubble Sort, Insertion Sort & Big O Notation
As Salamu Alaykum Wa Rahmatullahi Wa Barakatuh World!
Before I get into today's post you may be wondering where was I yesterday? Well, it was Eid al-Adha so I decided to take a little break (plus for some reason I had no idea what to do for yesterday's post).
I have however tagged my posts with labels so they're easier to find according to what you're looking for so I guess that counts for something. Anyway, it has felt like forever since I've posted so without further ado, let today's post begin!
I had to do quite a bit of digging to find this resource so I'm glad that it was actually worth it since this correlates with the Algorithms part of the AS H046 spec quite well. The only fault I could give that perhaps it's too complex at times and has a lot more info than you need.
Nevertheless, it covers pretty much all you need to know about Bubble sort, Insertion sort and Big O Notation so I think it's still a good resource. Obviously this only has 2 algorithms but if you need all the algorithms required for the entire A level specification then just check out one of my earlier posts here.
I believe some of the content in this presentation borders on university level computer science so don't worry if you don't get all of it. You can check with the AS subject content clarification guide to find out what you need to know specifically about these topics. If you're too lazy to click the link then you can just check below the parts of the spec that are addressed in this presentation:
So in summary, for the AS exams you just need to understand the need for the sorting algorithms and be able to implement them. You don't need to know Big O Notation for AS explicitly, but you do need to know the difference that specific algorithms have on speed and memory use.
Here's the link: OCR AS Level Computer Science Algorithms Presentation
Hope this helps!
Before I get into today's post you may be wondering where was I yesterday? Well, it was Eid al-Adha so I decided to take a little break (plus for some reason I had no idea what to do for yesterday's post).
I have however tagged my posts with labels so they're easier to find according to what you're looking for so I guess that counts for something. Anyway, it has felt like forever since I've posted so without further ado, let today's post begin!
I had to do quite a bit of digging to find this resource so I'm glad that it was actually worth it since this correlates with the Algorithms part of the AS H046 spec quite well. The only fault I could give that perhaps it's too complex at times and has a lot more info than you need.
Nevertheless, it covers pretty much all you need to know about Bubble sort, Insertion sort and Big O Notation so I think it's still a good resource. Obviously this only has 2 algorithms but if you need all the algorithms required for the entire A level specification then just check out one of my earlier posts here.
I believe some of the content in this presentation borders on university level computer science so don't worry if you don't get all of it. You can check with the AS subject content clarification guide to find out what you need to know specifically about these topics. If you're too lazy to click the link then you can just check below the parts of the spec that are addressed in this presentation:
Candidates need to understand the need for standard sorting algorithms. Candidates need to understand how the sorting algorithms bubble and insertion work and the situations when each can, and cannot be used. Candidates need to be able to use the algorithms to sort data, and complete, write and correct algorithms to perform each sorting algorithm.
Candidates need to understand how the choice of algorithm can be affected by the data set. Candidates need to understand the impact of specific algorithms on speed and memory use. Candidates are not expected to know about Big O notation, but should be aware of how and when a program can use more memory, or can take longer to run and be able to compare algorithms to determine which will use more/less memory, and which will run faster/slower.
So in summary, for the AS exams you just need to understand the need for the sorting algorithms and be able to implement them. You don't need to know Big O Notation for AS explicitly, but you do need to know the difference that specific algorithms have on speed and memory use.
Here's the link: OCR AS Level Computer Science Algorithms Presentation
Hope this helps!
Subscribe to:
Posts (Atom)