• We need your support!

    We are currently struggling to cover the operational costs of Xtremepapers, as a result we might have to shut this website down. Please donate if we have helped you and help make a difference in other students' lives!
    Click here to Donate Now (View Announcement)

Computing Paper 3 Last Week Revision

Messages
886
Reaction score
1,252
Points
153
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
 
Messages
886
Reaction score
1,252
Points
153
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
 
Messages
160
Reaction score
197
Points
38
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?
 
Top