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

    11
    ReputationRep:
    (Original post by aelahi23)
    for the regex question I got (a ((ba)*c*a)|bb|bc)) |b|c) (a|b|c)*
    You only have to talk about that will end up in the accepting state, I said a(ba)*c*
    Offline

    2
    ReputationRep:
    (Original post by MathsAndChess)
    You only have to talk about that will end up in the accepting state, I said a(ba)*c*
    Did it? I must of misread the question then
    Offline

    4
    ReputationRep:
    So, just finished the paper. Think I did well enough. Answers are roughly as follows, (that I can remember)

    Accounting, Authentication
    Worms and Viruses both replicated, viruses attach themselves to files while worms spread through networks.
    Digital signatures. Calculate a mathematical representation of the message using a hashing algorithm.

    Serial transmission is cheaper and does not require a clock to be in both devices

    Largest negative number was 1000001 01111 (though I accidentally made the exponent 11111)
    Number was -1344
    12 and 3/4 was 1100.11 in standard binary so therefore 0110011 00100 in floating point
    Increase precision by removing leading 0s or 1s

    Turing machine reversed the input 10 became 01

    For the question about psuedo-code, I imagine a lot of people will lose marks if they forgot to set the value of the start pointer if DelItem was the first item in the list.
    Code:
    Procedure DeleteItem(DelItem: String)
      Release(Current) //Incase it was already in use, release allows it to be reused
      If (Start.DataValue = DelItem)
        Current = Start.Next
        Release(Start)
        Start = Current 
       Release(Current)
      Else
        Do
          Release(Previous)
          Previous = Current
          Release(Current)
          Current = Previous.Next
        Until (Current.DataValue = DelItem)
        Release(Previous.Next)
       Previous.Next = Current.Next
        Release(Current)
      EndIf
    EndProcedure
    I used all the Release's as it suggested they needed to be released to be reused later on and therefore my code would need to do the same.

    SQL was
    SELECT SpecifiedSpeed, DateSent, Price, (something else) FROM Parcel, PriceBand WHERE Parcel.Weight <= PriceBand.MaxWeight AND Parcel.Weight >= PriceBand.MinWeight AND PriceBand.SpecifiedSpeed = Parcel.SpecifiedSpeed AND Parcel.CustomerID = 109 ORDERBY DateSend DESC

    Diagram was a Syntax Diagram
    Different diagram was 3 (regex) because it required there to be a + or - preceeding the binary string, while the other two would also accept no sign.
    Regex a(ba)*c*
    Offline

    0
    ReputationRep:
    the regex question was a(ba | c)*
    Offline

    11
    ReputationRep:
    i got (a | (b|c) ) *
    for the delete algorithm i wrote:

    start = 0;
    repeat
    increment start
    Previour.datavalue = current.next
    until current.datavalue = DelItem
    Release[Current.DataValue]

    did anyone get -1344 or -1334 for the mantissa question.
    Offline

    4
    ReputationRep:
    (Original post by KnightCode)
    i got (a | (b|c) ) *
    for the delete algorithm i wrote:

    start = 0;
    repeat
    increment start
    Previour.datavalue = current.next
    until current.datavalue = DelItem
    Release[Current.DataValue]

    did anyone get -1344 or -1334 for the mantissa question.
    Start, Current and Previous were pointers, therefore none should have been integers.

    Some of my answers are above, you can compare.
    Offline

    11
    ReputationRep:
    (Original post by Sharpify)
    Largest negative number was 1000001 11111
    Shouldn't the Mantissa be positive?
    Offline

    11
    ReputationRep:
    (Original post by compFed)
    the regex question was a(ba | c)*
    Yeah, I just realized this.
    Offline

    4
    ReputationRep:
    (Original post by MathsAndChess)
    Shouldn't the Mantissa be positive?
    Whoops.
    Offline

    2
    ReputationRep:
    I don't remember the question asking to write the largest negative number in denary
    In floating point representation i wrote
    Mantissa=1.000000
    Exponent= 01111

    Can someone confrim wether you had to write it in denrary form.

    I got 84 or -84 for converting the given floating point to the denary
    Offline

    11
    ReputationRep:
    why is SaaS different from a conventional thin client - I said because terminals are not dumb terminals
    Offline

    11
    ReputationRep:
    (Original post by Sid1234)
    why is SaaS different from a conventional thin client - I said because terminals are not dumb terminals
    I said SaaS tends to be web servers which are provided by company, there is a reliance on the internet and the company that provides theses SaaS e.g.
    Offline

    11
    ReputationRep:
    (Original post by Sid1234)
    why is SaaS different from a conventional thin client - I said because terminals are not dumb terminals
    The software is not stored on the same network as the client.
    Offline

    11
    ReputationRep:
    Also, what do we reckon for the A* this year?
    Offline

    1
    ReputationRep:
    Regex was a(c|ba)*
    Largest neg number is 1000000 01111
    The second diagram is called a syntax diagram
    The transition function you end up in state S(h) (obviously if you ended in S(r) you should've realised you're wrong) with 01

    For the SQL was price included in parcel or not? I thought it wasn't, so my SQL was:
    SELECT Postcode, OrderDate, Price, OneOtherThing
    FROM Parcel, ParcelPriceBand (whatever it was called)
    WHERE CustomerID = 109
    AND Weight => Minweight
    AND Weight <= Maxweight
    AND Parcel.Speed = ParclePriceBand.Speed
    ORDER BY OrderDate ASC
    Offline

    1
    ReputationRep:
    unofficial markscheme?
    Offline

    11
    ReputationRep:
    (Original post by Sid1234)
    Also, what do we reckon for the A* this year?
    91-94 in my opinion. It was an easier paper compared to previous years.
    Offline

    1
    ReputationRep:
    (Original post by Adamp123)
    unofficial markscheme?
    If someone can remind me of all the questions I can make one
    Offline

    11
    ReputationRep:
    (Original post by MathsAndChess)
    91-94 in my opinion. It was an easier paper compared to previous years.
    its never been that high before - I would have said same difficulty as last year
    Offline

    4
    ReputationRep:
    (Original post by Sid1234)
    its never been that high before - I would have said same difficulty as last year
    Agreed, I would expect
    88 A*
    80 A
    72 B
    64 C

    So on....
 
 
 
  • 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.