-
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)
Recent content by akii
-
-
Computing hashing question. Urgent
as stated by the question 6 key digits so we take 123456 10000 needs to be stored so we do 123456 MOD 10000 = 12.3456 3456 is the address of location as it is the remainder part. Hey dude im going to do the paper 12 tomorrow, is it really that june 2007 is the key for tomorrow? -
VERY URGENT! PLEASE HELP IN COMPUTING JUNE 2007 PAPER 1
(a)7,0,4 (b) use of 4,6,3,7,1 : to check whether it cope with non integer 0: to check whether it can cope with 0 4,-6,3,7,1: to check whether it can deal with negative number Hey dude really june 2007 is the tips? -
Computing hashing question. Urgent
the question says about 6 digit ok... so we take 123456 as it 6 digits how to get clashes when using hashing algorithm in this. 123456 will have the same address that is 3456 as 213456. Just change the first 2 digits and its clashes dude. Good luck dude work well because it sure dry run an... -
-
Urgent! Plz! Help in Computing June 2006 Paper 1
• Customer name: String • Customer telephone number:text • Date of original commission: date/time • Whether or not the order has been paid for: Boolean (b) for records.. estimate the size of each and add them. eg customer name=20 etc add all the size * 1000 = ............. then...
