(this program adds a node at the bottom of a list using virtual memory)
I have a problem running my code on a (Unix) SUN machine, it compiles fine but with this part of the code i got a "Segmentation Fault". Works fine on my PC if i run it with BORLAND C.
This is part of the code i...
i need help creating a buffer system for an OS virtual memory, each node of the list has to be added to the end of the list! and adhere to the most recently used algorithm such that an element after being searched would be moved to the front of the list... it would be great to use double linked...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.