Suppose the program has page requires as: 1, 4, 3, 2, 1, 4,…

Suppose the program has page requires as: 1, 4, 3, 2, 1, 4, 3, 4, 8, 1, 2, 5, 4. Show the buffer’s page allocation using the replacement policy: Least Recently Used-LRU, where the buffer size = 3.  (Note: the victim page should be on the top of a buffer, please upload file to answer the question.) 

According to the above sequential file contains the fixed-le…

According to the above sequential file contains the fixed-length records. If we choose to move record n to i, where i is a delete record and n is the last record. What is the structure of this sequential file after deleting id = 76766, 45565 and 83821? (Please upload file to answer the question.) 

According to the following B-tree, if we delete index all 2s…

According to the following B-tree, if we delete index all 2s and all 5s, what is the B-Tree index data structure(m=4) after the deletions?                             Note. Please show each step, not only the final answer.                     (Please upload file to answer the question.)