Physical memory consists of 4 page frames, initially all empty. The following reference string is processed: 0 1 4 0 2 3 0 1 0 2 3 4 2 3 (c) Show which pages are resident under the LRU page replacement algorithm. Indicate when page faults happen.

What is the worst-case complexity of the maxrepeats function? assume that the longest string in the names array is at most 25 characters wide (i.e., string comparison can be treated as o( class namecounter { private: int* counts; int nc; string* names; int nn; public: namecounter (int ncounts, int nnames); int maxrepeats() const; }; int namecounter: : maxrepeats () { int maxcount = 0; for (int i = 0; i < nc; ++i) { int count = 1; for (int j = i+1; j < nc; ++j) { if (names[i] == names[j]) ++count; } maxcount = max(count, maxcount); } return maxcount; }

What is used to analyze and summarize your data without graphical support

Which component acts as a platform on which application software runs