Computing Paper 3 Last Week Revision

[A star]

And what was your AS grade?

A in p1 A in P2 and hopefully an A in p4.

 

[A star]

AlphaBeta Here's the short version of Insertion to Linked list algo.

A in p1 A in P2 and hopefully an A in p4.

u mean we have to learn it :O :O
do you guys have any clue what kind of questions come from the transport medium chapter

 

[AlphaBeta]

AlphaBeta but then they tell you what the //s are so yeah i think you have to write it all out

thanks alot

u mean we have to learn it :O :O
do you guys have any clue what kind of questions come from the transport medium chapter

check pastpapers , like they ask about all the medium n transfer rates , speed etc

 

[hope4thebest]

AlphaBeta but then they tell you what the //s are so yeah i think you have to write it all out

the short version is better

 

[AlphaBeta]

the short version is better

but we have to know the loonger version too

 

[AlphaBeta]

*the logic of the longer version , they wont ask directly to write the algo , but they might ask about filling in the missing procedure or smtng

 

[hope4thebest]

May June 2007 Q3
If the queue is held in a linked list,describe an algorithm for
(i) inserting an address into the queue
(ii) reading an address from the queue

 

[AlphaBeta]

inserting an address into the queue
The algorithm for insertion is
1. Check to see if queue is full.
2. If the queue is full report an error and stop.
3. Insert new data item into cell pointed to by the head pointer.
4. Increment the head pointer and stop.
its there in the compuing site google thing

 

[hope4thebest]

inserting an address into the queue
The algorithm for insertion is
1. Check to see if queue is full.
2. If the queue is full report an error and stop.
3. Insert new data item into cell pointed to by the head pointer.
4. Increment the head pointer and stop.
its there in the compuing site google thing

does a new item enters a queue from the side of head pointer or tail pointer?

 

[AlphaBeta]

does a new item enters a queue from the side of head pointer or tail pointer?

tail , leaving from head

 

[hope4thebest]

How would you define indexed and relative addressing?

 

[:: A^]

How would you define indexed and relative addressing?

indexed addressing is when the contents of the index register is added to the operand.
relative addressing is when the operan has an adress in relation to the first instruction.
Eg: JMP +3 means move 3 steps from the meory location of the 1st instruction.

 

[A star]

How would you define indexed and relative addressing?

bro indexed addressing is basically the address currently in the index register is added to the address given next to the instruction and the data from tha address is picked up and loaded into acc
relative addressing he explained well :3

 

[A star]

How would you define indexed and relative addressing?

its usually given in an exam :3 learning it= not neccessary

 

[hope4thebest]

its usually given in an exam :3 learning it= not neccessary

good point

 

[AlphaBeta]

these guys never tested quick sort , merging list for some time

 

[:: A^]

its usually given in an exam :3 learning it= not neccessary

havent u seen questions which ask you to use diagrams and define relative addressing and all that. lol

these guys never tested quick sort , merging list for some time

More and More reasons to study that

 

[A star]

havent u seen questions which ask you to use diagrams and define relative addressing and all that. lol

More and More reasons to study that

i know the logic behind it thats enough for me :3 i dont do ratta of algos or anything

 

[AlphaBeta]

i know the logic behind it thats enough for me :3 i dont do ratta of algos or anything

overconfidence = bad for health

 

[:: A^]

i know the logic behind it thats enough for me :3 i dont do ratta of algos or anything

allright. good for you.