The Student Room Group

COMP3 - JUN 2016 Discussion Thread

Scroll to see replies

Original post by cybernatural
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


What did you end up with at the end in the tape from the turing machine question.
Also did you use all of the given table boxes in the question?
Original post by aelahi23
What did you end up with at the end in the tape from the turing machine question.
Also did you use all of the given table boxes in the question?



The final tape read 01, as it reverses the original string
I used all the boxes and ended in S(h) which is the end state
Do you think you would lose marks for having an extra inner join? I used an inner join on the customers table as well, but only displayed the required fields..
Original post by aelahi23
What did you end up with at the end in the tape from the turing machine question.
Also did you use all of the given table boxes in the question?


Yeah all of them were used up for me, I also got 01 and in the state Sh
Original post by thelion786
Yeah all of them were used up for me, I also got 01 and in the state Sh


I didn't use all of them and got ###01
I don't know where i went wrong and i think i. Ended in the Sr state
Original post by aelahi23
I didn't use all of them and got ###01
I don't know where i went wrong and i think i. Ended in the Sr state


The # were changed to blank boxes, that's why they were not there in the end, to what I done anyways
For the question about the relation ship between a turing machine and an algorithm what did you guys say?
Unofficial mark scheme?
Reply 148
Original post by Shrek1234
Unofficial mark scheme?


I could try writing one if someone could list questions, at least ones you remember. Heres the ones i remember so far:

1)
Authentication, accounting tick boxes (2)
Viruses and worm comparison (4)
Digital signature creation before transmission (4)

2)
RPN Convert (2)
Advantage of RPN over infix (1)

3)
Most negative number (2)
Conversion (2)
Conversion (3)
Why normalise? (2)
How to make more precise without changing no. of bits (2)

12)
Name of diagram? (1)
Which one is different in syntax and why? (1)
FSM -> Regex (1)

Heres the questions i have so far, could you guys please add and I will create a mark scheme, thanks
Original post by saqibjr
I could try writing one if someone could list questions, at least ones you remember. Heres the ones i remember so far:

1)
Authentication, accounting tick boxes (2)
Viruses and worm comparison (4)
Digital signature creation before transmission (4)

2)
RPN Convert (2)
Advantage of RPN over infix (1)

3)
Most negative number (2)
Conversion (2)
Conversion (3)
Why normalise? (2)
How to make more precise without changing no. of bits (2)

12)
Name of diagram? (1)
Which one is different in syntax and why? (1)
FSM -> Regex (1)

Heres the questions i have so far, could you guys please add and I will create a mark scheme, thanks


There was the one with asynchronous transmission

the linked list one as well as the database

the 8 marker was on thin vs rich client computing with that part on SaaS

SQL query
Reply 150
Original post by Shrek1234
There was the one with asynchronous transmission

the linked list one as well as the database

the 8 marker was on thin vs rich client computing with that part on SaaS

SQL query


were there any other parts on the thin vs rich question?


also, were there any other parts on the pseudocode questions?

do you remember them? and how many marks,

DBMS question had ER diagram(3), Update table DDL(3) , SQL query (6) and Alter relations(3)

Turing Machine: Memory(1), Processor(1), Turing machine trace(6), what it does(1) and relationship between an algorithm and turing machine (1)

Fill Start Stop and Parity bit (2), Asynchronous Data Transmission start stop bits (4), FSM bit pattern (1), Last digit is what? (1), Why is serial used in short distance situation? (2)

please add any other questions and parts and how many marks u think they had
(edited 7 years ago)
Original post by saqibjr
were there any other parts on the thin vs rich question?


also, were there any other parts on the pseudocode questions?

do you remember them? and how many marks,

DBMS question had ER diagram(3), Update table DDL(3) , SQL query (6) and Alter relations(3)

Turing Machine: Memory(1), Processor(1), Turing machine trace(6), what it does(1) and relationship between an algorithm and turing machine (1)

Fill Start Stop and Parity bit (2), Asynchronous Data Transmission start stop bits (4), FSM bit pattern (1), Last digit is what? (1), Why is serial used in short distance situation? (2)

please add any other questions and parts and how many marks u think they had


Would it not be a program for the turing machine? As it said transitional function, not the thing performing the transitional function.
Reply 152
Original post by Shrek1234
Would it not be a program for the turing machine? As it said transitional function, not the thing performing the transitional function.


yeah sorry i dont know why i wrote processor here i meant program
Reply 153
Original post by Shrek1234
Would it not be a program for the turing machine? As it said transitional function, not the thing performing the transitional function.


do you remember the second to last question by any chance?
Original post by ubiquitousking
Went pretty well, except the Turing Machine question. They come up so often (probably every year?) but I forgot to revise them :ahee:


You didn't even need to revise them, all the information needed to do it was in the question.
what was the algorithm turing machine relation thing - was it just any problem that can be computed can be reduced to a turing machine so any valid algorithm can be executed by a turing machine
Original post by Sid1234
what was the algorithm turing machine relation thing - was it just any problem that can be computed can be reduced to a turing machine so any valid algorithm can be executed by a turing machine


Yes, that is correct
Original post by Shrek1234
Yes, that is correct


what were your points for the long q
What did people do for the normalization of the database? I created a new relation called Address with Postcode as primary key and as a foreign key in the Parcel relation.
(edited 7 years ago)
Original post by Sid1234
what were your points for the long q


Thin computing came up in a past paper
Thick is in the textbook I think.
SaaS was mentioned somewhere earlier on this thread

Quick Reply

Related discussions

Latest

Trending

Trending