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

    0
    ReputationRep:
    (Original post by Enginerd.)
    What a brilliant paper, couldn't have asked fr anything better. Myself, i never did the dry run of the equation. Wanted to come back but never had the time, every other question was good, 1 or 2 i may have slipped up.

    Big marker ones were good, compilation, file structures, etc. The programming one was good, as was the BNF and the 3rd Normal form.

    The only one which i had no clue was the "Why not store the age"? I was like why!!!!??? So i just wrote that it will need regular updating? May as well try for the mark. All in all. Good.
    Exactly what I put - store the date of birth so it doesn't require updating every year.

    Did anybody have a Town table for the 3NF question? I was debating whether to put it in but decided against it in the end - for some reason I wasn't very confident on that question.
    Offline

    0
    ReputationRep:
    (Original post by Enginerd.)
    What a brilliant paper, couldn't have asked fr anything better. Myself, i never did the dry run of the equation. Wanted to come back but never had the time, every other question was good, 1 or 2 i may have slipped up.

    Big marker ones were good, compilation, file structures, etc. The programming one was good, as was the BNF and the 3rd Normal form.

    The only one which i had no clue was the "Why not store the age"? I was like why!!!!??? So i just wrote that it will need regular updating? May as well try for the mark. All in all. Good.
    I said the age needed updating. Date of Birth would be better because it would be a constant variable. Bar that dry run question the rest of the paper was amazing
    Offline

    0
    ReputationRep:
    (Original post by PatrickM)
    Exactly what I put - store the date of birth so it doesn't require updating every year.

    Did anybody have a Town table for the 3NF question? I was debating whether to put it in but decided against it in the end - for some reason I wasn't very confident on that question.
    I had tables for bookings, pupils, instructors and branches
    Offline

    6
    ReputationRep:
    (Original post by Huwtrosky)
    I had tables for bookings, pupils, instructors and branches
    Same, my primary key for branches was town though because it said one branch each town o_O
    Offline

    0
    ReputationRep:
    (Original post by archdd)
    Same, my primary key for branches was town though because it said one branch each town o_O
    that should be fine if each town is unique I just did Branch ID as the primary key
    Offline

    6
    ReputationRep:
    What did everyone put for the 10 mark question?
    I was fairly confident with sequential files but not for the other two.

    Sequential:
    Advantage - Faster when many records are to be accessed
    Disadvantage - Slower when individual records are accessed
    Adding - Copy until location , add record, copy rest
    Removing - Copy all and skip the ones to be removed

    Random Access:
    Advantage - Faster for individual/direct access
    Disadvantage - Slower for access to many
    Adding - Hashing algorithm / Overflow area
    Removing - Was not sure, I just said it uses the hashing algorithm to find the location of the record and remove it

    Indexed Sequential:
    Advantage - Two kind of access depending on situation
    Disadvantage - Data integrity issues? I put both files need to be updated and harder to create/maintain
    Adding & Removing I didn't felt the need to repeat it so I just said as above :s
    Offline

    0
    ReputationRep:
    Thought it was a very easy paper, wasn't too sure why computers would need to use analogue data though, other than that it was all fine.
    Offline

    0
    ReputationRep:
    (Original post by archdd)
    Me neither I kept writing it out and it was like 0,1,1,2,3,5,8,13... So I said it was the sum of the last two values of the function.
    fibonacci sequence
    Offline

    18
    ReputationRep:
    (Original post by LewisRichardson)
    What more could you ask on a paper like this? They were practically giving marks away with multiprogramming, compilation and the last question. The BNF and third normal form were straightforward. The only tricky part was the algorithm in the middle I suppose.
    Also above guy, you're right with that database question.
    Oh thats good, DOB would have been a good replacement, but i quickly wrote address down before the time was up. Reckon i have the 2 marks??

    (Original post by PatrickM)
    Exactly what I put - store the date of birth so it doesn't require updating every year.

    Did anybody have a Town table for the 3NF question? I was debating whether to put it in but decided against it in the end - for some reason I wasn't very confident on that question.
    DOB would be a good option, but you reckon address would also give me a mark?
    And theirs only 1 town per branch, so i did branch and primary key as Townname
    Offline

    0
    ReputationRep:
    (Original post by Enginerd.)
    Oh thats good, DOB would have been a good replacement, but i quickly wrote address down before the time was up. Reckon i have the 2 marks??



    DOB would be a good option, but you reckon address would also give me a mark?
    And theirs only 1 town per branch, so i did branch and primary key as Townname
    I used address as the primary key for branch, which is correct. Also Branch id could have been created and used
    Offline

    0
    ReputationRep:
    (Original post by nm786)
    I think i messed this paper up big time!
    how come ? :/
    Offline

    0
    ReputationRep:
    (Original post by nm786)
    I revised a lot for this paper but when I went into the exam hall I just couldn't remember stuff such as definitions such as what scheduling is and I just don't think i got most of the marks :/
    I did finish the paper and wrote down what i could remember but i got a feeling i messed up really badly.
    did you do all the past papers?
    Offline

    0
    ReputationRep:
    What was a computer application for a stack? I couldn't think of one


    Posted from TSR Mobile
    Offline

    0
    ReputationRep:
    (Original post by LewisRichardson)
    What was a computer application for a stack? I couldn't think of one


    Posted from TSR Mobile
    I used the 'undo' function on a word processor - actions placed into a stack or something. I don't think I'll have got full marks for that to be fair.

    (Original post by Huwtrosky)
    that should be fine if each town is unique I just did Branch ID as the primary key
    Ahh of course. I wondered why they mentioned the town was unique - so people could use it as the primary key. I didn't do this though - I did exactly as you did and used Branch ID.

    (Original post by vinnie667)
    Thought it was a very easy paper, wasn't too sure why computers would need to use analogue data though, other than that it was all fine.
    For this I used the example of a microphone recording a signal, and this then being digitised to be stored on a computer. Not sure if that was right though. Probably not according to WJECs Mark Scheme anyway ...
    Offline

    0
    ReputationRep:
    The question which eluded me was the advantages and disadvantages of binary trees over arrays. Wasn't my finest hour that one....
    Offline

    0
    ReputationRep:
    The only reason I used BranchID rather than just the address is that there may be more than one town in the country of the same name, should be okay though.

    I think an ordered binary tree is simply easier/quicker to search for data over an array. Perhaps a disadvantage was that binary trees are more complex to program than arrays.


    Posted from TSR Mobile
    Offline

    18
    ReputationRep:
    For Stack i did Undo button!
    Because you need to wind back nesting of subprograms

    For Queue i did keyboard buffer!
    Because the keys that are pressed should be executed in order.
    Offline

    6
    ReputationRep:
    Sometimes even though I know the answer, I don't know how to write it out clearly and instead I extend my answers until it becomes unconvincing/wrong (epic fail).

    For the analogue question I put recording and outputting sounds which is a form of wave and can be variable o_O

    I think the advantages of a binary tree over an array is that the array would have to go through one by one until the target whereas the binary tree moves closer each step (by comparing the whether to move left or right if the current node is higher or lower than the target). A disadvantage would be accessing all the records where an array would be done at once by looping through the subscript but binary tree would be harder to do so and you might have to go back and forth in steps.

    For stack I put storing return addresses of sub procedures so they could continue where it left off allowing the code to execute in desired order.
    Offline

    0
    ReputationRep:
    (Original post by Enginerd.)
    For Stack i did Undo button!
    Because you need to wind back nesting of subprograms

    For Queue i did keyboard buffer!
    Because the keys that are pressed should be executed in order.
    Keyboard buffer is correct for sure, and I used the example of a systems stack which stores the address of the sub program's to be called winding back etc, you might get the mark for winding back but not sure about undo button


    Posted from TSR Mobile
    Offline

    0
    ReputationRep:
    (Original post by archdd)
    Sometimes even though I know the answer, I don't know how to write it out clearly and instead I extend my answers until it becomes unconvincing/wrong (epic fail).

    For the analogue question I put recording and outputting sounds which is a form of wave and can be variable o_O

    I think the advantages of a binary tree over an array is that the array would have to go through one by one until the target whereas the binary tree moves closer each step (by comparing the whether to move left or right if the current node is higher or lower than the target). A disadvantage would be accessing all the records where an array would be done at once by looping through the subscript but binary tree would be harder to do so and you might have to go back and forth in steps.

    For stack I put storing return addresses of sub procedures so they could continue where it left off allowing the code to execute in desired order.
    I know what you mean, you have it all explained in your head and the me you write the worse your answer becomes...


    Posted from TSR Mobile
 
 
 
  • 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 newspaper do you read/prefer?
  • 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.