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

    1
    ReputationRep:
    Anyone have any predictions for what topics will be questioned more in this paper?
    Offline

    0
    ReputationRep:
    (Original post by Adamp123)
    Anyone have any predictions for what topics will be questioned more in this paper?
    This would be much appreciated. Anyone cross referenced with past papers and got any ideas of the less previously examined topics that are likely to come up this year?
    Offline

    0
    ReputationRep:
    Got a mid B last year but am resitting COMP1 & COMP2. COMP1 went quite well but haven't revised for COMP2 yet this year:afraid:. Got 70/75 for COMP4 and hoping for an A* overall. Not sure if I should not bother doing COMP2 and just focus on COMP3 as it is worth more.
    Offline

    2
    ReputationRep:
    (Original post by raraman)
    This would be much appreciated. Anyone cross referenced with past papers and got any ideas of the less previously examined topics that are likely to come up this year?
    Most papers contain a LONG turing machine question. They appear on 4-5/6 past papers!
    Offline

    0
    ReputationRep:
    hi everyone, im also doing comp3 this year (as well as retaking comp2) and i would seriously recommend the wikibooks link thats already been posted, it's really helpful and most textbooks either contain too much or too little in my experience, so this is perfect
    things ive noticed they do a lot: long turing machine qs as previously mentioned, asking the difference between intractable and computable, explaining what stuff written in backus-naur means, the quality of written communication question is likely to be on networking or databases because its hard to come up with long questions for the other topics
    i havent seen many questions regarding reverse polish notation iirc, perhaps that'll come up? similar thing with encryption, i feel like that might also come up.
    Offline

    2
    ReputationRep:
    Guys to get an A* overall in Computing do you need to average 90% across COMP3 and COMP4? (As well as 320 points)
    Offline

    2
    ReputationRep:
    (Original post by the_chosen_one97)
    Guys to get an A* overall in Computing do you need to average 90% across COMP3 and COMP4? (As well as 320 points)
    You need to get A overall and get 90% in A2 so for instance you can get 85% in COMP3 and 95% in COMP4 to achieve an A*
    Offline

    2
    ReputationRep:
    Ok cheers - think I've got 65 raw out of 75 in COMP4 so I guess an A* is no longer possible unless I do insanely well on COMP3 right?
    Offline

    2
    ReputationRep:
    (Original post by the_chosen_one97)
    Ok cheers - think I've got 65 raw out of 75 in COMP4 so I guess an A* is no longer possible unless I do insanely well on COMP3 right?
    Get a total of 360 UMS and its an A*. You don't have to have 90% in COMP3 and COMP4. That rule only applies with mathematics (C3 and C4) I believe.
    Offline

    2
    ReputationRep:
    (Original post by Filipo)
    Get a total of 320 UMS and its an A*. You don't have to have 90% in COMP3 and COMP4. That rule only applies with mathematics (C3 and C4) I believe.
    GCE Advanced subject award (Excluding 6361 Mathematics and 6371 Further Mathematics)Candidates gain A* if they both:
    1. 1 have enough uniform marks (UMS) in total to gain grade A
    2. 2 achieve 90% or more on the uniform marks subtotal of their A2 units.

    http://filestore.aqa.org.uk/admin/sp...TAR-GRADES.PDF
    Offline

    0
    ReputationRep:
    Hey guys,

    I was wondering if anybody had zigzag education's topic based questions for COMP3? I've run out of past-papers and need some more questions to do!

    Cheers!
    Offline

    8
    ReputationRep:
    Just to remind everyone that the text book teaches you about the IEEE standard and the Minifloat format which is not on the specification - so you don't need to know about this. You only need to know the two's complement method ofrepresenting floating numbers.
    Offline

    1
    ReputationRep:
    Does anyone have the June 2012 COMP3 paper, please?
    Offline

    1
    ReputationRep:
    (Original post by thelion786)
    Does anyone have the June 2012 COMP3 paper, please?
    Yes please, I need that too
    Offline

    1
    ReputationRep:
    (Original post by Adamp123)
    Yes please, I need that too
    Turns out I should've checked the first page. Look on there and you'll find it!

    How confident is everyone for this paper, and anyone have any tips? I got an A last year but re-sat COMP2 because I got a very low A. Teacher marked my project to about 69/75 which is borderline A*, but I'm worried COMP3 may pull some very random questions
    Offline

    0
    ReputationRep:
    Which algorithm's pseudo code do you need to be able to write down for the exam?
    Offline

    2
    ReputationRep:
    (Original post by DodaWilliams)
    Which algorithm's pseudo code do you need to be able to write down for the exam?
    For Stacks
    -POP
    -PUSH

    For Priority Queues
    -Adding data
    -deleting data

    For circular Queues
    -Adding data
    -deleting data

    For Linked Lists
    -Adding data
    -deleting data

    Bubble Sort
    Insertion Sort
    Binary Search

    Learn how to traverse a Tree with Breadth First Traversal and Depth First Traversal (DON'T NEED TO MEMORISE)
    Offline

    2
    ReputationRep:
    (Original post by aelahi23)
    For Stacks
    -POP
    -PUSH

    For Priority Queues
    -Adding data
    -deleting data

    For circular Queues
    -Adding data
    -deleting data

    For Linked Lists
    -Adding data
    -deleting data

    Bubble Sort
    Insertion Sort
    Binary Search

    Learn how to traverse a Tree with Breadth First Traversal and Depth First Traversal (DON'T NEED TO MEMORISE)
    Where is the best place to find these algorithms? Got any links?
    Offline

    8
    ReputationRep:
    Anyone got any predictions on what the long 7 mark question could be - simulation maybe? (as that has rarely come up)
    Offline

    2
    ReputationRep:
    (Original post by aelahi23)
    For Stacks
    -POP
    -PUSH

    For Priority Queues
    -Adding data
    -deleting data

    For circular Queues
    -Adding data
    -deleting data

    For Linked Lists
    -Adding data
    -deleting data

    Bubble Sort
    Insertion Sort
    Binary Search

    Learn how to traverse a Tree with Breadth First Traversal and Depth First Traversal (DON'T NEED TO MEMORISE)
    We seriously need to know how to write all of these down? I thought we just had to recognise them when they ask what they are. And be able to trace through them.
 
 
 
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • Poll
    What's your favourite Christmas sweets?
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

    Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

    Quick reply
    Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.