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

    0
    ReputationRep:
    Guys what was in the tree question, all i remember is one of the parts being to write the stuff down in order then say Alphabetical, im sure the whole question wouldnt just be two parts , does anyone remember what else was in this question?
    Offline

    11
    ReputationRep:
    (Original post by saqibjr)
    Guys what was in the tree question, all i remember is one of the parts being to write the stuff down in order then say Alphabetical, im sure the whole question wouldnt just be two parts , does anyone remember what else was in this question?
    you had to fill in the array table for it. was there a specific order required or did it not matter as long as the pointers were right?
    Offline

    0
    ReputationRep:
    (Original post by Sid1234)
    you had to fill in the array table for it. was there a specific order required or did it not matter as long as the pointers were right?
    Which array table did we fill in, I dont remember, I was talking about when we had to do a binary tree search and list the items in the order, and we had to do a tree traversal.
    Offline

    11
    ReputationRep:
    (Original post by saqibjr)
    Which array table did we fill in, I dont remember, I was talking about when we had to do a binary tree search and list the items in the order, and we had to do a tree traversal.
    they then asked you to fill in a table with three columns, as a one dimensional array of records. It had left pointer data item right pointer
    Offline

    0
    ReputationRep:
    (Original post by Sid1234)
    they then asked you to fill in a table with three columns, as a one dimensional array of records. It had left pointer data item right pointer
    I totally forgot about that. Do you remember which question this was? Do you remember how many marks that was? If possible, could you just list for me all the parts to this question, thank you, im trying to put together an unofficial mark scheme

    In the centre there were the nodes, in the left you are meant to put in the memory addresses of the left sub tree. on the right you put in the memory addresses of the right sub tree.
    Offline

    0
    ReputationRep:
    there was one question which had answer nlogn, does anyone remember what that was and the part before it?
    Offline

    11
    ReputationRep:
    (Original post by saqibjr)
    I totally forgot about that. Do you remember which question this was? Do you remember how many marks that was? If possible, could you just list for me all the parts to this question, thank you, im trying to put together an unofficial mark scheme

    In the centre there were the nodes, in the left you are meant to put in the memory addresses of the left sub tree. on the right you put in the memory addresses of the right sub tree.
    that was 3 marks, the question that had the answer O(log n) was asking what the order of complexity of a binary search tree was
    Offline

    0
    ReputationRep:
    (Original post by Sid1234)
    that was 3 marks, the question that had the answer O(log n) was asking what the order of complexity of a binary search tree was
    oh ok, what was the tree traversal question then? and its parts
    Offline

    2
    ReputationRep:
    Just a few more questions I can remember:

    Name 3 types of OS management
    State why Implementation 2 that used hashing was better than Implementation 1 or something similar
    Explain what asynchronous transmission is and how start and stop bit is used
    Tick box for accounting, authentication etc.
    How a digital signature is made
    Advantage of reverse polish
    Why are numbers normalised
    Why is floating point used
    Fill in the boxes for parity bit, stop and start bits
    Name the standard notation used (backus naur?)
    Explain how an algorithm is similar to a turing machine
    Do an in order traversal
    Offline

    10
    ReputationRep:
    (Original post by saqibjr)
    there was one question which had answer nlogn, does anyone remember what that was and the part before it?
    About a search on a binary tree. the answer was nlogn or something as it was a binary search
    Offline

    0
    ReputationRep:
    I have made an unofficial mark scheme with most answers. Please tell me the answers to the questions I missed if you know. This covers>90 of the marks. This is the best I could do given the questions I remember


    EDIT: I HAVE UPLOADED A NEWER VERSION HERE: https://drive.google.com/open?id=0B8...3Rkck5ON1N5VWM
    Attachments Pending Approval
  1. File Type: pdf unofficial comp3 2016 ms.pdf (278.1 KB)
    Offline

    3
    ReputationRep:
    (Original post by saqibjr)
    I have made an unofficial mark scheme with most answers. Please tell me the answers to the questions I missed if you know. This covers>90 of the marks. This is the best I could do given the questions I remember
    This attachment is "pending approval", can you upload somewhere else (e.g. https://mixtape.moe/) for the time being?
    Offline

    2
    ReputationRep:
    (Original post by saqibjr)
    I have made an unofficial mark scheme with most answers. Please tell me the answers to the questions I missed if you know. This covers>90 of the marks. This is the best I could do given the questions I remember
    Good MS

    The only question you are missing is the one about "Why is LinkedList a form of abstraction" - something like that
    Offline

    1
    ReputationRep:
    (Original post by Shrek1234)
    Good MS

    The only question you are missing is the one about "Why is LinkedList a form of abstraction" - something like that
    How did you view it
    Offline

    11
    ReputationRep:
    (Original post by Shrek1234)
    Good MS

    The only question you are missing is the one about "Why is LinkedList a form of abstraction" - something like that
    what was the answer to that?
    Offline

    2
    ReputationRep:
    (Original post by Shrek1234)
    Good MS

    The only question you are missing is the one about "Why is LinkedList a form of abstraction" - something like that
    How did you open the pdf?
    Offline

    1
    ReputationRep:
    (Original post by Sid1234)
    what was the answer to that?
    I mentioned how LinkedList is an Object Orientated Language so it uses objects and predefined methods to run and therefore programmers do not need to know how the program works, just how to implement the objects, similar to abstraction which removes non essential details
    Offline

    8
    ReputationRep:
    (Original post by thelion786)
    I mentioned how LinkedList is an Object Orientated Language so it uses objects and predefined methods to run and therefore programmers do not need to know how the program works, just how to implement the objects, similar to abstraction which removes non essential details
    I said a similar thing. The idea that the class acts as an interface for the 'bigger program' - meaning it is not necessary for the rest of the program to know the details of the implementation.
    Offline

    8
    ReputationRep:
    What did everyone get for the function of the Turing machine?
    Offline

    11
    ReputationRep:
    i said using classes is an example of breaking a problem down into smaller more manageable sub problems which is an example of abstraction by generalisation - any marks ? :/
 
 
 
  • 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.