Hey there Sign in to join this conversationNew here? Join for free

OCR F453 Advanced Computing Theory (June 12th 2012)

Announcements Posted on
Study Help needs new mods! 14-04-2014
Post on TSR and win a prize! Find out more... 10-04-2014
    • Thread Starter
    • 0 followers
    Offline

    ReputationRep:
    As the exam is only 53 days away, I am wondering who else is doing this exam, and how you are finding it. I am finding it quite hard in most areas, object orientated programming, UML, all of the number section (Bacus- Naur form, Reverse Polish notation etc.), RISC, CISC (as we haven't even covered those in class) and so on...

    However, areas such as function of the OS I'm fine with and I think areas such as Translators an computer architecture should be pretty easy to self teach.

    Do any of you have any links to good revision tools, or have any tips yourself?

    I think I may put my all in to coursework as it's worth 20% overall and that might just scrape me a C.
    • 18 followers
    Offline

    It's been a while since you posted and nobody's replied yet...maybe you should check out MarkedbyTeachers.com, TSR's sister site. It has the largest library of essays in the UK.

    They've got over 181,000+ coursework, essays, homeworks etc.. all written by GCSE, A Level, University and IB students across all topics. You get access either by publishing some of your own work, or paying £4.99 for a month's access. Both ways give you unlimited access to all of the essays.

    All their documents are submitted to Turnitin anti-plagiarism software, so it can't be misused, and the site's used by hundreds of thousands of UK teachers and students.

    What's more, you can take a look around the site and preview the work absolutely free. Click here to find out more...
    • 0 followers
    Offline

    ReputationRep:
    I'm doing the exam as well this Summer. Although, I'm still finalising my coursework - its due in next week :eek:
    I will probably start revision soon though and try some past papers.
    Any revision notes would be great
    I am also on the look out for the F453 Jan 2012 paper (and mark scheme) so if anyone has it, please could they upload it. Thanks!
    • 0 followers
    Offline

    ReputationRep:
    http://www.jakewright.net/2012/05/oc...evision-guide/
    This is the best revision document I've found so far and seems to contain pretty much everything.
    Good luck with the exam
    • 1 follower
    Offline

    ReputationRep:
    (Original post by tom95)
    I'm doing the exam as well this Summer. Although, I'm still finalising my coursework - its due in next week :eek:
    I will probably start revision soon though and try some past papers.
    Any revision notes would be great
    I am also on the look out for the F453 Jan 2012 paper (and mark scheme) so if anyone has it, please could they upload it. Thanks!
    Here you go. Sorry it's a bit late but there's a fair amount of time until the exam I've also added the examiner's report in case you need it.
    Attached Files
  1. File Type: pdf January 2012.pdf (59.3 KB, 183 views)
  2. File Type: pdf January 2012 - Advanced Computing Theory.pdf (207.7 KB, 261 views)
  3. File Type: pdf January 2012.pdf (151.9 KB, 188 views)
    • 3 followers
    Offline

    ReputationRep:
    Hey there, do we need to know as part of Data structures Lists - I know Stacks, Queues and trees come up and i went on the Specification and i couldnt find it mentioned anywhere. Thanks
    • 0 followers
    Offline

    ReputationRep:
    (Original post by AlexChurch)
    http://www.jakewright.net/2012/05/oc...evision-guide/
    This is the best revision document I've found so far and seems to contain pretty much everything.
    Good luck with the exam
    This is exactly what I needed, thanks!

    (Original post by RevisionSuccess)
    Here you go. Sorry it's a bit late but there's a fair amount of time until the exam I've also added the examiner's report in case you need it.
    Thanks a lot, I will probably do this paper closer to the exam anyway.


    (Original post by Aadil)
    Hey there, do we need to know as part of Data structures Lists - I know Stacks, Queues and trees come up and i went on the Specification and i couldnt find it mentioned anywhere. Thanks
    We have to know about static data structures (arrays) and dynamic data structures which includes lists, queues, stacks and trees (syllabus reference 3.3.5a). This will include describing the different data structures. However, we only have to describe algorithms for stacks, queues and trees (syllabus reference 3.3.5b).

    I hope that has cleared things up for you.
    • Thread Starter
    • 0 followers
    Offline

    ReputationRep:
    For meging data files, what do we actually have to know?
    • 0 followers
    Offline

    ReputationRep:
    (Original post by Neon-Soldier32)
    For meging data files, what do we actually have to know?
    From what I'm aware of, we are required to actually carry out the process, describe the overall process and write an algorithm in pseudo-code.

    Remember that for two files to be merged, they must have a common key field and they must already be sorted in the order of the key field.

    Carry out the process: check out page 45 of the computing revision guide above, there is an example of merging two lists of numbers

    Describe the process: The two original files remained unchanged but a new file is created which is the merged file. A pointer is used to identify the records in each of the files. (Just simply describe the algorithm below)

    Algorithm:

    Open the existing files (for reading);
    Create a new file (for writing);
    Use pointers to identify records in each of the files;
    REPEAT;
    Compare records indicated by pointers;
    Copy the lower value record to the new file;
    Move pointer of the file that has had the record copied from it;
    UNTIL end of one of the files has been reached;
    Copy all remaining records from other file;
    Close all files.
    • 0 followers
    Offline

    ReputationRep:
    (Original post by tom95)
    From what I'm aware of, we are required to actually carry out the process, describe the overall process and write an algorithm in pseudo-code.

    Remember that for two files to be merged, they must have a common key field and they must already be sorted in the order of the key field.

    Carry out the process: check out page 45 of the computing revision guide above, there is an example of merging two lists of numbers

    Describe the process: The two original files remained unchanged but a new file is created which is the merged file. A pointer is used to identify the records in each of the files. (Just simply describe the algorithm below)

    Algorithm:

    Open the existing files (for reading);
    Create a new file (for writing);
    Use pointers to identify records in each of the files;
    REPEAT;
    Compare records indicated by pointers;
    Copy the lower value record to the new file;
    Move pointer of the file that has had the record copied from it;
    UNTIL end of one of the files has been reached;
    Copy all remaining records from other file;
    Close all files.

    Bearing in mind as well, that algorithm will have 9 or so marks in it, and the question will give you like 6, so you don't need to put everything (although it's very good to, just don't panic over missing a small step). I remember a question where you coud get full marks and not actually do what it asked, provided you did all the close/open files and all that.

    Also, found this question in a paper from the old spec

    (b) (i) Describe the term transparency in a network operating system. [2]
    (ii) Explain how the security of data can be maintained by a network operating system. [4]

    I'm pretty sure it's not on the new one, wanted to be sure.
    • 0 followers
    Offline

    ReputationRep:
    (Original post by A.J10)
    Bearing in mind as well, that algorithm will have 9 or so marks in it, and the question will give you like 6, so you don't need to put everything (although it's very good to, just don't panic over missing a small step). I remember a question where you coud get full marks and not actually do what it asked, provided you did all the close/open files and all that.

    Also, found this question in a paper from the old spec

    (b) (i) Describe the term transparency in a network operating system. [2]
    (ii) Explain how the security of data can be maintained by a network operating system. [4]

    I'm pretty sure it's not on the new one, wanted to be sure.
    No, that is not in our syllabus.

    In the legacy syllabus (module 2509), you were required to:
    describe the main components of a network operating system including transparency, directory services, security and network printing.
    This used to be in the 'Function of Operating Systems' section but was removed.
    • 0 followers
    Offline

    ReputationRep:
    (Original post by tom95)
    No, that is not in our syllabus.

    In the legacy syllabus (module 2509), you were required to:
    describe the main components of a network operating system including transparency, directory services, security and network printing.
    This used to be in the 'Function of Operating Systems' section but was removed.
    Thank you, our college has a pack of questions from the old spec that are still useful and this was on it so I wasn't sure

    This was posted from The Student Room's Android App on my E15i
    • 1 follower
    Offline

    ReputationRep:
    I am pooing it for this exam considering we haven't even covered UML diagrams in class and I'm now having to teach it to myself 3 days before the exam o.O

    Hopefully the Jake Wright revision guide can help me out greatly...
    Anyone else very nervous?
    • Thread Starter
    • 0 followers
    Offline

    ReputationRep:
    I'm just going over past paper, after past paper and on the one I've just done I got 85. I think this unit is decievingly hard - 85 marks for a C!

    I'm not too sure what I need to do to improve it, however. For UML, Nagillum, I think it's easier if you just learn which is which diagram is which.

    Hopefully I'll get 80 - 85 on this exam and, as I'm repeating AS, I think it will be relatively easy to improve on.
    • 0 followers
    Offline

    ReputationRep:
    (Original post by Nagillum)
    I am pooing it for this exam considering we haven't even covered UML diagrams in class and I'm now having to teach it to myself 3 days before the exam o.O

    Hopefully the Jake Wright revision guide can help me out greatly...
    Anyone else very nervous?
    The OCR website has a useful guide on UML

    I need 2/3 of the UMS for an A overall. Also, go look at the teachICT website. It's all our class had to learn for most of the work for this exam

    This was posted from The Student Room's Android App on my E15i
    • 1 follower
    Offline

    ReputationRep:
    (Original post by Neon-Soldier32)
    I'm just going over past paper, after past paper and on the one I've just done I got 85. I think this unit is decievingly hard - 85 marks for a C!
    Which paper was that? I couldn't find any with 85 for a C.
    • 0 followers
    Offline

    ReputationRep:
    For Question 5(d) of Jan 2010 (the one about using a quick sort), are the marks awarded for 'explaining' how it works or 'showing' how it works by actually carrying out the sort? If I produced a table like the one in the mark scheme with annotations such as swap 30 & 22, would that get the marks or are you actually required to write 'repeat, compare numbers being swapped to, if in wrong order swap...'.
    • Thread Starter
    • 0 followers
    Offline

    ReputationRep:
    (Original post by Zues)
    Which paper was that? I couldn't find any with 85 for a C.
    My bad, it wasn't 86 for a B for this specific paper, I saw that on a general guidance mark scheme. It was June 2010 and it was 81 for a B, 92 for an A.

    I've still a few more things to go over: Addressing types, RPN and a little bit on floating point binary. OCR's stupid when it comes to indexed addressing - in two questions on it, it has totally different mark schemes.

    If I get at least 80 I'll be pretty happy.
    • Thread Starter
    • 0 followers
    Offline

    ReputationRep:
    (Original post by tom95)
    For Question 5(d) of Jan 2010 (the one about using a quick sort), are the marks awarded for 'explaining' how it works or 'showing' how it works by actually carrying out the sort? If I produced a table like the one in the mark scheme with annotations such as swap 30 & 22, would that get the marks or are you actually required to write 'repeat, compare numbers being swapped to, if in wrong order swap...'.
    You get the mark for jjust showing the swap. Yes, even though the question says describe, you'd get the marks for showing it.
    • 0 followers
    Offline

    ReputationRep:
    (Original post by Neon-Soldier32)
    OCR's stupid when it comes to indexed addressing - in two questions on it, it has totally different mark schemes.
    I remember that. We got given a sheet with a few past paper questions covering the last week or so when we did addressing types, and I put the same answer for both. Get full marks on one, 0 on the other.

    I hate marking my work with these papers, when you've put down points but because they're not in the markscheme they probably won't be counted...

    Honestly, my knowledge of the subject isn't what's going to lower my marks so much as not knowing what the hell it is they want me to say

Reply

Submit reply

Register

Thanks for posting! You just need to create an account in order to submit the post
  1. this can't be left blank
    that username has been taken, please choose another Forgotten your password?

    this is what you'll be called on TSR

  2. this can't be left blank
    this email is already registered. Forgotten your password?

    never shared and never spammed

  3. this can't be left blank

    6 characters or longer with both numbers and letters is safer

  4. this can't be left empty
    your full birthday is required
  1. By completing the slider below you agree to The Student Room's terms & conditions and site rules

  2. Slide the button to the right to create your account

    Slide to join now Processing…

    You don't slide that way? No problem.

Updated: June 13, 2012
Article updates
Reputation gems:
You get these gems as you gain rep from other members for making good contributions and giving helpful advice.