This problem may be applicable only to the module you query. Has anyone email thye lecturers.by united - COS3216
If I am not mistaking, does a word not equal to 8 bits? Secondly if you are mapping logical memory to physical memory does not that mean that both will hold the same amount of bits because it is not mentionned that we are using virtual memory technique. Or doest it imply it when we talk of physical and logical memory. Does anyone know what should be done for this question. Thanksby united - COS3216
For question 7 using stack for infix and postfix expression. Do we pass the infix expression as a string? Any tips on this question especially about designing a class for the expressions will be much appreciated? Thanks and goodluck to you all for this assignment.by united - COS211X
Thanks pal. But it still is a time consuming questionby united - COS211X
Concerning the recursive function to find whether a word is a palindrome can anyone give me a tip. I am strugling with the question. What should the base case be in this question? I can't figure it out. Thanks for any help.by united - COS211X
Do we need to do programming exercise 10 fully because there is a lot asked in it. It is going to be time consuming. Does anyone has a tip on how to tackle it?by united - COS211X
One thing i am still not sure about. Does the function return a linked list containning the sum or it just add up the numbers of the 2 linked list. Do u have any idea what the function header should be? Help is most welcome. Thanks.by united - COS211X
I am not sure either. Anyones help is most welcome please. Thanksby united - COS211X
In the chapters in the 7th edition there are sections which illustrate concepts in those chapters with os examples. Do we need to study and take notes for these sections or just read it and see how the concepts are used in practice. I am studying the chapter on process synchronization and find it difficult to grasp the concepts. Can anyone provide clarifications and give me tips on how to proceedby united - COS3216
I got same waiting time for priority and SJF but a different one for RR. It is now better to move on and wait for the marked assignment or solution. There is no point in breaking heads with it. Good luck to you all.by united - COS3216
You should recheck your gantt charts. Are you using the formula given in the study guide?by united - COS3216
No negative numbers pal. You should have made a mistake somewhere.by united - COS3216
Ya I have received it. I think you should contact the despatch department. Hopes that helps.by united - COS3216
I do seem to have seen the textbook mentioning the disadvantage of assymetric multiprocessing and disadvantage of symmetric multiprocessing. It does not mention a system that uses assymetric multiprogramming. Can anyone give me a hint to find the answer. Thanks.by united - COS3216
The round robin scheduling algo is not supposed to put preempted proceses at the tail of the queue. I cant quite understand to the answer of ex 6.2 unit 6 in the study guide. Can anyone help?by united - COS3216
How are everyone finding ass01? Are the questions difficult. I have not yet started mine will start in 3 days time may be.by united - COS3216
Try to look for it at Adams and Co in durbanby united - COS211X
I have not understand preemptive scheduling, can anyone explain?by united - COS3216
But then how do we calculate the times as in assignment 01 the last few questions?by united - COS211X
Does anyone know if we are allowed to use calculators for the exams.by united - COS211X
Can anyone give a simple explanation of the virtual machine concept and how it is implemented. I am not sure that I have understood it from the text book and study guide. Thanksby united - COS3216
Can we share answers for the exercises at the end of each chapter. It would be nice if we could check our understanding of the subject by sharing the answers.by united - COS3216
Do we have to read section 19.1 of chapter 19 together with unit 1 of the study guide? Thanks.by united - COS3216
Can someone clarify the order log n and n log n. I have not really understand when an algorithm will be log n and n log n. Examples to support the explanation will be much appreciated. Thanks.by united - COS211X