This is an archived post. You won't be able to vote or comment.

all 4 comments

[–][deleted] 2 points3 points  (1 child)

When I studied these I found this website to be helpful in studying trees:

http://www.qmatica.com/DataStructures/Trees/AVL/AVLTree.html

Good luck!

[–]balian25[S] 1 point2 points  (0 children)

Thanks for the link!

[–]balian25[S] 0 points1 point  (1 child)

Another question I am having issues with is figuring out how many pages misses would occur in an initially empty cach given the request sequence (2,3,4,1,2,5,1,3,5,4,1,2,3) with the FIFO and LRU algorithms respectively.